Dynamic network and routing method for a dynamic network

• US 20040170151A1
• Filed: 12/08/2003
• Published: 09/02/2004
• Est. Priority Date: 06/11/2001
• Status: Active Grant

• 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
• Granted Patent: US 7,031,321 B2
• Time in Patent Office: Days
• US Class Current: 370/338
• 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 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 updating routing information to the requesting nodes.

2. A network as claimed in claim 1, characterized in that the tables comprise fields for the target nodes,

in that the local routing tables contain a table update information relating to the most recent updating of the local routing table and a field update information relating to the most recent updating of the individual fields,

in that the update request contains the table update information, and

in that the update response contains those items of local routing information for which the field update information of the addressed node is more up to date than the table update information of the requesting node.

3. A network as claimed in claim 1, characterized in that the local routing tables contain fields for the target nodes, and in that the fields contain a topology change information for characterizing the up-to-dateness of a change in the network topology.

4. A network as claimed in claim 3, characterized in that the update response contains the topology change information, and in that the requesting node after receiving the update responses from the addressed nodes carries out an update of its local routing table if the topology change information of the addressed node is more up to date than the topology change information of the requesting node.

5. A network as claimed in claim 1, characterized in that the table update information and/or the field update information and/or the topology change information are items of time information.

6. A network as claimed in claim 1, characterized in that the table update information and/or the field update information and/or the topology change information is/are constituted by sequence numbers.

7. A network as claimed in claim 1, characterized in that the requesting node after receiving the update responses from the addressed nodes carries out an update of its local routing table if the topology change information of the addressed node is equally up to date as the topology change information of the requesting node and the path length to the respective target node is made shorter by the update.

8. A network as claimed in claim 1, characterized in that the requesting node after receiving the update responses from the addressed nodes carries out an update of its local routing table if the topology change information of the addressed node is equally up to date as the topology change information of the requesting node and the maximum data transmission rate to the envisaged target node is made higher by the update.

9. A network as claimed in claim 1, characterized in that the network can be subdivided into several sub-networks which each contain a controller for controlling the sub-networks,

in that the sub-networks can be interconnected by means of respective forwarding terminals, and

in that each controller is designed for storing and managing a central routing table for the respective sub-network.

10. A routing method for a dynamic network comprising a plurality of nodes, wherein 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.

11. A node for a dynamic network, in which it is provided that

routing information is stored in a local routing table,

the node sends an update request to other nodes for updating the local routing table, and

the node sends an update response with updated routing information to other requesting nodes.