WIRELESS DATA BUS

• US 20080013502A1
• Filed: 02/08/2007
• Published: 01/17/2008
• Est. Priority Date: 02/08/2006
• Status: Abandoned Application

• Current Assignee: Securaplane Technologies, Inc. (Meggitt PLC)
• Original Assignee: Securaplane Technologies, Inc. (Meggitt PLC)
• Inventors: Clark, Alan
• Application Number:
  US11/672,700
• Publication Number:
  US 20080013502A1
• Time in Patent Office: Days
• US Class Current: 370/338
• CPC Class Codes: G08C 17/00 Arrangements for transmitting signals characterised by the use of a wireless electrical link
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update
• CPC Class Codes: H04W 8/005 Discovery of network devices, e.g. terminals
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A wireless device for use with a plurality of wireless nodes that includes a controller node, the wireless device including a wireless transceiver for wirelessly communicating with the plurality of wireless nodes; a processor system; and memory storing a neighbor table, the memory also storing code which when executed on the processor causes the wireless device to initiate a discovery process during which the wireless device discovers neighbor nodes with which the wireless device establishes wireless communication links, identifies the discovered neighbor nodes in the neighbor table, and for each identified neighbor in the neighbor table indicates whether the corresponding link has an active status or a parked status, wherein the wireless device uses links having active status to send communications and does not use links having parked status to send communications.

Claims

1. A wireless device for use with a plurality of wireless nodes that includes a controller node, said wireless device comprising:

a wireless transceiver for wirelessly communicating with the plurality of wireless nodes;

a processor system; and

memory storing a neighbor table, said memory also storing code which when executed on the processor causes the wireless device to initiate a discovery process during which the wireless device discovers neighbor nodes with which the wireless device establishes wireless communication links, identifies the discovered neighbor nodes in the neighbor table, and for each identified neighbor in the neighbor table indicates whether the corresponding link has an active status or a parked status, wherein the wireless device uses links having active status to send communications and does not use links having parked status to send communications.

2. The wireless device of claim 1, wherein the memory stores a measure of a distance that the wireless device is from the controller and wherein the code further causes the wireless device to send to each discovered neighbor node with which the wireless device establishes a wireless communications link information from its neighbor table as well as the measure of the distance of the wireless device from the controller, an identity of the wireless device, and a measure of the quality of the communications link with that discovered neighbor node.

3. The wireless device of claim 1, wherein the code further causes the wireless device to receive information from the discovered neighbor nodes and store that received information in the neighbor table in association with the corresponding identified discovered nodes.

4. The wireless device of claim 1, wherein the code further causes the wireless device to determine for which discovered neighbor nodes the corresponding links are to be identified as having active status and for which the corresponding links are to be identified as having parked status based at least in part on which discovered neighbor nodes provide better paths to the controller node.

5. The wireless device of claim 1, wherein the code further causes the wireless device to determine for which discovered neighbor nodes the corresponding links are to be identified as having active status and for which the corresponding links are to be identified as having parked status based at least in part on how far the discovered nodes are from the controller.

6. The wireless device of claim 1, wherein the code further causes the wireless device to determine for which discovered neighbor nodes the corresponding links are to be identified as having active status and for which the corresponding links are to be identified as having parked status based at least in part on the strength of signals received over the communications links to the discovered nodes.

7. The wireless device of claim 1, wherein the code further causes the wireless device to initiate a discovery mode during which the wireless device parks all links having active status at least during the discovery mode and discovers another neighbor node from among the plurality of nodes for which the corresponding link is identified as having the active status.

8. The wireless device of claim 7, wherein the code further causes the wireless device to activate the previously active links having parked status and then determine whether the number of links having active status is greater than a threshold value.

9. The wireless device of claim 8, wherein the code further causes the wireless device to respond to a determination that the number of active links exceeds the threshold value by identifying which of the links having active status are of lowest quality and switching those identified links to parked status.

10. A network comprising:

a plurality of nodes; and

a controller node,

wherein each of the plurality of nodes comprises;

a wireless transceiver for communicating with other nodes among the plurality of nodes;

a memory system storing a neighbor table for recording identities of neighbor nodes among the plurality of nodes, wherein each neighbor node of the plurality of neighbor nodes has a corresponding link over which wireless communications take place, said neighbor table for also recording for each identified neighbor node an indication of whether its corresponding link has an active status or a parked status and a parameter indicating a distance of that identified neighbor node from the controller; and

a processor system which is programmed to respond to receiving over a link from one of the plurality neighbor nodes a message that is from the controller by sending that message out on all links that are identified as having active status except the link over which the message was received and to not send that message out on any links identified as having parked status.

11. The network of claim 10, wherein in each node of the plurality of nodes the processor system of that node is further programmed to discover links to other neighbor nodes of that node and to determine whether those other discovered links are to be identified as having active status or parked status.

12. The network of claim 10, wherein in each node of the plurality of nodes, the neighbor table records for each node identified in the neighbor table as having a link with an active status, the table also stores a measure of the distance of that node from the controller.

13. The network of claim 10, wherein the measure of the distance of a node from the controller is a hop count which indicates the minimum number of nodes that a message must pass through before reaching the controller.

14. The network of claim 10, wherein in each node of the plurality of nodes the processor system of that node is further programmed to respond to receiving a message that is intended for the controller by sending that message out on a subset of the links that are identified as having active status and to not send that message out on any links identified as having parked status.

15. The network of claim 10, wherein in each node of the plurality of nodes the processor system of that node is programmed to determine the subset of the links based at least in part on how far the corresponding nodes are from the controller.

16. The network of claim 10, wherein in each node of the plurality of nodes the subset of the links has no more than two members.

17. A network comprising:

a plurality of nodes; and

a controller node,

wherein each of the plurality of nodes comprises;

a wireless transceiver for communicating with other nodes among the plurality of nodes;

a memory storing a neighbor table for recording identities of neighbor nodes among the plurality of nodes, wherein each neighbor node of the plurality of neighbor nodes has a corresponding link over which wireless communications take place, said neighbor table for also recording for each identified neighbor node an indication of whether its corresponding link has an active status or a parked status and a parameter indicating a distance of that identified neighbor node from the controller; and

a processor system which is programmed to respond to receiving a message that is intended for the controller by sending that message out on a subset of the links that are identified as having active status and to not send that message out on any links identified as having parked status.

18. The network of claim 17, wherein in each node of the plurality of nodes the processor system of that node is further programmed to discover links to other neighbor nodes of that node and to determine whether those other discovered links are to be identified as having active status or parked status.

19. The network of claim 17, wherein in each node of the plurality of nodes, the neighbor table records for each node identified in the neighbor table as having a link with an active status, the table also stores a measure of the distance of that node from the controller.

20. The network of claim 17, wherein the measure of the distance of a node from the controller is a hop count which indicates the minimum number of nodes that a message must pass through before reaching the controller.

21. A method implemented by a designated node that is one of a plurality of wireless nodes in a wireless network, said plurality of wireless nodes also including a controller node, said method comprising:

storing a neighbor table in the designated node;

storing a measure of a distance from the designated node and the controller node;

discovering nodes among the plurality of wireless nodes that are neighbors of the designated node, each discovered neighbor node having a corresponding link for supporting communications with the discovered neighbor node;

for each discovered neighbor node;

sending information to the discovered node, said information including a measure of a quality of the corresponding link for that discovered neighbor node and the measure of the distance of the designated node from the controller node;

receiving information from the discovered neighbor node including a measure of a quality of the corresponding link and a measure of the distance of the discovered node from the controller node;

recording in the neighbor table an identifier for the discovered node and in association therewith at least some of the information received from the discovered neighbor node including the measure of the quality of the corresponding link, the measure of the distance of the discovered node from the controller node, and an indication of whether the link corresponding with that discovered node has an active status or a parked status, wherein the designated node uses links having active status to send communications and does not use links having parked status to send communications.

22. The method of claim 21, further comprising, for each discovered neighbor node, determining whether the discovered node is to be given a status of active or parked.

23. The method of claim 22, wherein, for each discovered neighbor node, the determining is based on at least in part on the measure of the distance of the discovered node from the controller node.

24. The method of claim 22, further comprising, for each discovered neighbor node, limiting the number of links that are identified as active to a preselected number and designating the remainder of the links as parked.