System and method for forming, maintaining and dynamic reconfigurable routing in an ad-hoc network

• US 7,035,207 B2
• Filed: 06/05/2002
• Issued: 04/25/2006
• Est. Priority Date: 06/05/2002
• Status: Expired due to Fees

• Current Assignee: Cooper Technologies Company (Eaton Corporation PLC.)
• Original Assignee: EKA Systems Incorporated (Eaton Corporation PLC.)
• Inventors: Winter, Timothy Clark, Anand, Minakshisundaran B., Chakravarthi, Prakash R.
• Primary Examiner(s): Chin, Wellington
• Assistant Examiner(s): HO, CHUONG T
• Application Number:
  US10/162,077
• Publication Number:
  US 20040008691A1
• Time in Patent Office: 1,420 Days
• Field of Search: 370/256, 370/408, 370/238, 370/255, 370/312, 370/338, 370/390, 370/469, 370/395.5, 370/252, 370/395.3, 370/254, 370/335, 370/351, 370/238.1, 370/395.43, 370/225, 455/453, 455/445, 455/519, 455/11.1, 455/13.1
• US Class Current: 370/225
• CPC Class Codes: H04L 45/122 by minimising distances, e.g. by selecting a route with minimum of number of hops
• CPC Class Codes: H04L 45/54 Organization of routing tables
• CPC Class Codes: H04W 4/24 Accounting or billing
• CPC Class Codes: H04W 40/00 Communication routing or communication path finding
• CPC Class Codes: H04W 40/08 based on transmission power
• CPC Class Codes: H04W 40/10 based on available power or energy
• CPC Class Codes: H04W 40/12 based on transmission quality or channel quality
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update
• CPC Class Codes: H04W 40/246 Connectivity information discovery
• CPC Class Codes: H04W 40/248 Connectivity information update
• CPC Class Codes: H04W 40/30 for proactive routing
• CPC Class Codes: H04W 8/26 Network addressing or numbering for mobility support
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A network comprises a plurality of network nodes. Each network node has a unique node identifier within the context of the network and stores a table of nodes. The table of nodes includes at least one table entry. The table entry includes three fields—a destination node field, a next node field and a cost field. The destination field is a unique node identifier corresponding to another node in the network. The next node is a unique node identifier corresponding to the next node in the communication path to the destination node. The cost field is the cost associated with communication with the network node. When a node is added to the network, it detects the presence of adjacent nodes. The new node obtains the table of nodes stored in each adjacent node and uses the information contained in the node tables to updates its own node table, thereby obtaining information for communicating with every other node in the network. Each of the adjacent nodes obtains information related to communicating with the new node, adjusts its own table of nodes accordingly, and sends update information to nodes adjacent to it to propagate knowledge of the new node. Changes in the network are propagated between network nodes by periodic exchange and updating of node tables. Updating can be performed at a pre-determined time and/or in response to a change in the network.

Claims

1. A method for building a network comprising a plurality of network nodes, comprising the steps of:

(a) associating a unique identifier with a network node;

(b) storing the unique identifier of the network node in the network node so that it can be accessed by other network nodes that are added to the network;

(c) creating a network table in the network node, the network node having a plurality of entries, with at least one entry for each node in the network, each entry adapted to store a destination node address corresponding to a unique identifier associated with a destination node with which the network node can communicate, a next node address corresponding to a unique identifier associated with an adjacent node that is in a communication path from the network node to the destination node and a cost value corresponding to a cost for the network node to communicate with the destination node;

(d) placing the network node in a network of other network nodes;

(e) detecting an adjacent network node;

(f) obtaining an adjacent network node entry from a table in an adjacent network node; and

(g) creating a new entry in the table of the network node network using the information in the entry obtained from the adjacent network node, wherein the destination node address of the new entry is the unique identifier associated with the destination node of the adjacent network node entry, the next node address of the new entry is the unique identifier of the adjacent network node and the cost value is the sum of the cost value in the adjacent node entry and the cost of communicating with the adjacent network node.

2. The method recited in claim 1, further comprising the step of repeating steps (f) and (g) for each adjacent network node.

3. The method recited in claim 1, further comprising the step of repeating steps (f) and (g) for each adjacent network node for every node in the network.

4. The method recited in claim 1, further comprising the step of repeating steps (f) and (g) at pre-determined times.

5. The method recited in claim 1, further comprising the step of repeating steps (f) and (g) periodically.

6. The method recited in claim 1, further comprising the step of repeating steps (f) and (g) at pre-determined times for each adjacent network node for every network node in the network.

7. The method recited in claim 1, further comprising the step of repeating steps (f) and (g) periodically for each adjacent network node for every network node in the network.

8. The method recited in claim 1, further comprising the step of storing the unique identifier of the adjacent network node as the destination node address and next node address for at least one entry in the table.