Dynamic network and routing method for a dynamic network

• US 7,031,321 B2
• Filed: 06/10/2002
• Issued: 04/18/2006
• Est. Priority Date: 06/11/2001
• Status: Expired due to Fees

• Current Assignee: Koninklijke Philips Electronics N.V. (Koninklijke Philips N.V.)
• Original Assignee: Koninklijke Philips Electronics N.V. (Koninklijke Philips N.V.)
• Inventors: Habetha, Joerg
• Primary Examiner(s): Trost, William
• Assistant Examiner(s): Ewart, James D.
• Application Number:
  US10/480,076
• Publication Number:
  US 20040170151A1
• Time in Patent Office: 1,408 Days
• Field of Search: 455/7, 455/11.1, 455/422.1, 370/218, 370/230, 370/252, 370/254, 370/285, 370/328, 370/338, 370/349, 370/351, 370/255, 370/389, 370/395.31, 370/401
• US Class Current: 370/395.31
• CPC Class Codes: H04L 45/028 Dynamic adaptation of the update intervals, e.g. event-triggered updates
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 45/34 Source routing
• CPC Class Codes: H04L 45/36 Backward learning
• CPC Class Codes: H04L 45/54 Organization of routing tables
• CPC Class Codes: H04W 40/248 Connectivity information update
• CPC Class Codes: H04W 40/32 for defining a routing cluster membership
• CPC Class Codes: H04W 48/08 Access restriction or access information delivery, e.g. discovery data delivery signalling during connection H04W76/00
• CPC Class Codes: H04W 48/16 Discovering, processing access restriction or access information
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

The invention relates to a dynamic network with a plurality of nodes, in which it is provided that—routing information is stored in local routing tables in nodes of the network,—the nodes send an update request to other nodes for updating the local routing tables, and—the addressed nodes send an update response with updated routing information to the requesting nodes.

Claims

1. A dynamic network, comprising:

a plurality of nodes for transmitting and receiving information, each of said nodes including local routing tables in which routing information is stored, each of said local routing tables including a first ield containing a time-based network topology change information and a second field containing a time-based indication of when said local routing table has changed as a result of the change in the network topology,

each of said nodes is arranged to send an update request to other, addressed ones of said nodes for updating the local routing tables in said node, the update request including time-based table update information indicative of the most recent update of said local routing tables in said requesting node, and

each of said addressed nodes is arranged to send at least one update response with updating routing information to the requesting one of said nodes only when said local routing tables of said addressed node reflect more updated routing information than said local routing tables of said requesting node as determined by analysis of said second field in said local routing tables of said addressed node and the table update information in the update request,

said requesting node being arranged to consider a change in said local routing table only when the at least one update response with updating routing information being sent by one of said addressed nodes indicates a later change in the network topology or an equally up-to-date network topology and a more desirable data transmission.

2. A network as claimed in claim 1, wherein said local routing tables contain the time-based table update information relating to the most recent updating of said local routing table and said second field in said local routing tables reflects field update information relating to the most recent updating of the individual fields, the update response containing those items of local routing information for which the field update information of said addressed node is more up to date than the table update information of said requesting node.

3. A network as claimed in claim 1, wherein said first field characterizes the up-to-dateness of a change in the network topology.

4. A network as claimed in claim 3, wherein said nodes are arranged such that the update response generated by addressed one of said nodes contains said first field of said local routing tables of said addressed node and characterizes the topology change information,

said requesting node being arranged to consider a change in said local routing table only when the at least one update response with updating routing information being sent by one of said addressed nodes indicates a later change in the network topology as determinable by analysis of said first field in said local routing table in said requesting node and said first field contained in the update response with updating routing information.

5. A network as claimed in claim 1, wherein the contents of said first and second fields are items of time information.

6. A network as claimed in claim 1, wherein the contents of said first and second fields are constituted by sequence numbers.

7. A network as claimed in claim 1, wherein said requesting node after receiving the update responses from one of said addressed nodes is arranged to carry out an update of its local routing table only when the at least one update response with updating routing information being sent by one of said addressed nodes indicates a network topology equally up to date as the topology change information of said requesting node and a path length to a respective target node is made shorter by the update.

8. A network as claimed in claim 1, wherein said requesting node after receiving the update responses from one of said addressed nodes is arranged to carry out an update of its local routing table only when the at least one update response with updating routing information being sent by one of said addressed nodes indicates a network topology equally up to date as the topology change information of said requesting node and a maximum data transmission rate to an envisaged target node is made higher by the update.

9. A network as claimed in claim 1, wherein the network is subdividable into several sub-networks which each contain a controller for controlling said sub-networks,

said sub-networks being interconnectable by means of respective forwarding terminals, and

each controller being designed for storing and managing a central routing table for a respective one of the sub-networks.

10. A network as claimed in claim 1, wherein each of said local routing tables include a third field containing table update information relating to the most recent update of said local routing table, a fourth field containing an identification of a target node, a fifth field containing an identification of an adjoining node in a path toward the target node, and a sixth field containing a quantity representing a path length to the target node.

11. A network as claimed in claim 10, wherein each of said local routing tables further includes a seventh field containing a maximum data rate at which data is transmittable to the target node.

12. A network as claimed in claim 1, wherein the time-based table update information and the contents of said first and second fields are coded.

13. A network as claimed in claim 1, wherein each of said nodes when acting as an addressed node is arranged to convert the time-based table update information contained in the update request into its own time system before comparing the time-based table update information to said second field in said local routing tables of said addressed node.

14. A network as claimed in claim 1, wherein each of said nodes when acting as a requesting node is arranged to convert the time-based information in said first field contained in the at least one update response with updating routing information into its own time system before comparing said second field of said local routing tables of said addressed node with said second field of said local routing tables of said requesting node.

15. A network as claimed in claim 1, wherein each of said nodes is arranged to generate and send the at least one update response by combining information about a plurality of network topology changes in a single update response.

16. A routing method for a dynamic network having a plurality of nodes, comprising:

storing routing information in local routing tables in each node of the network, each of the local routing tables including a first field containing a time-based network topology change information and a second field containing a time-based indication of when the local routing table has changed as a result of the change in the network topology,

sending an update request from each of the nodes to other, addressed one of the nodes for updating the local routing tables in that node, the update request including time-based table update information indicative of the most recent update of the local routing tables in the requesting node,

sending at least one update response with updating routing information from each of the addressed nodes only when the local routing tables of the addressed node reflect more updated routing information than the local routing tables of the requesting node as determined by analysis of the second field in the local routing tables of the addressed node and the table update information in the update request, and

changing the local routing tables in the requesting one of the nodes only when the at least one update response with updating routing information being sent by one of the addressed nodes indicates a later change in the network topology or an equally up-to-date network topology and a more desirable data transmission.

17. A method as claimed in claim 16, wherein the local routing tables in the requesting one of the nodes are changed only when the at least one update response with updating routing information being sent by one of the addressed nodes indicates a later change in the network topology.

18. A method as claimed in claim 16, wherein the local routing tables in the requesting one of the nodes are changed only when the at least one update response with updating routing information being sent by one of the addressed nodes indicates an equally up-to-date network topology and a path length to a respective target node is made shorter by the update or a maximum data transmission rate to an envisaged target node is made higher by the update.

19. A node for a dynamic network, comprising:

local routing tables in which routing information is stored, each of said local routing tables including a first field containing a time-based network topology change information and a second field containing a time-based indication of when the local routing table has changed as a result of the change in the network topology,

the node being arranged to generate and send an update request to other nodes which respond to the update request by sending at least one update response with updated routing information, the update request including time-based table update information indicative of the most recent update of said local routing tables in the requesting node,

the node being arranged to consider a change in said local routing table only when the updating routing information of the at least one update response sent by the other nodes indicates a later change in the network topology or an equally up-to-date network topology and a more desirable data transmission.

20. A node as claimed in claim 19, wherein the node is arranged to receive update requests from other nodes and send at least one update response with updating routing information in response to the update request to the requesting node only when the contents of said second field of said local routing tables of said node indicates that said local routing tables of said node reflect more updated routing information than said local routing tables of the requesting node as determined by analysis of said second field in said local routing tables of the node and said second field of said local routing tables of the requesting node as sent in the update request.