SYSTEM AND METHOD FOR ADAPTIVELY SETTING THE PROBABILITY OF GENERATING A BEACON BROADCAST IN A WIRELESS NETWORK

• US 20100272094A1
• Filed: 04/24/2009
• Published: 10/28/2010
• Est. Priority Date: 04/24/2009
• Status: Active Grant

• Current Assignee: Digi International Inc.
• Original Assignee: Digi International Inc.
• Inventors: George, J. Douglas, Filoso, John P., Byard, Robert P.
• Granted Patent: US 8,532,072 B2
• Time in Patent Office: Days
• US Class Current: 370/350
• CPC Class Codes: H04J 3/0641 Change of the master or reference, e.g. take-over or failure of the master
• CPC Class Codes: H04W 52/0216 using a pre-established activity schedule, e.g. traffic indication frame
• CPC Class Codes: H04W 52/0219 where the power saving management affects multiple terminals
• CPC Class Codes: H04W 56/001 Synchronization between nodes
• CPC Class Codes: H04W 84/20 Master-slave selection or change arrangements
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A system and method of operating a wireless network having a plurality of nodes. Each node determines whether to replace the beacon node. When a node determines that the beacon node is to be replaced, the node determines whether it should nominate itself as a potential replacement beacon node. The decision whether to nominate itself as a potential replacement beacon node is a function of a nomination probability associated with the node. If the node determines that it should nominate itself as a potential replacement beacon node, the node sends out one or more beacon signals. Each node then adaptively modifies the probability of nominating itself as a function of the number of beacon signals received from other nodes. Beacon signals are received by potential replacement nodes and, if the potential replacement beacon node has received a beacon signal from a higher ranking potential replacement beacon node, the node removes itself as a candidate for the replacement beacon node.

Claims

1. In a wireless network having a plurality of nodes, including a beacon node, a method comprising:

determining, at each node, whether to replace the beacon node;

if a node determines that the beacon node is to be replaced, determining whether the node should nominate itself as a potential replacement beacon node, wherein determining whether the node should nominate itself is a function of a probability value associated with the node;

if the node determines that it should nominate itself as a potential replacement beacon node, sending out one or more beacon signals;

receiving a beacon signal from other nodes that have nominated themselves as potential replacement beacon nodes; and

selecting the replacement beacon node, wherein selecting includes;

determining, at each potential replacement beacon node, whether the potential replacement beacon node has received a beacon signal from a higher ranking potential replacement beacon node; and

if the potential replacement beacon node has received a beacon signal from a higher ranking potential replacement beacon node, removing itself as a candidate for the replacement beacon node;

wherein each node adaptively modifies the probability of nominating itself as a function of the number of beacon signals received from other nodes.

2. The method of claim 1, wherein determining whether the node should nominate itself as a potential replacement beacon node includes generating a random number at the node and comparing the random number to a threshold value associated with the node.

3. The method of claim 2, wherein each node adaptively modifies its threshold value in response to the number of beacon signals received from other nodes and as a function of its location in the wireless network.

4. The method of claim 3, wherein location is a function of a node-hop tally, wherein the node-hop tally includes the total number of node hops required for the node to reach each other node in the wireless network.

5. The method of claim 2, wherein each node adaptively modifies its threshold value in response to beacon signals received from other nodes and as a function of a link-quality metric associated with the node.

6. The method of claim 1, wherein determining whether the potential replacement beacon node has received a beacon signal from a higher ranking potential replacement beacon node includes comparing the MAC address of the potential replacement beacon node to the MAC addresses of each node that sent a beacon signal.

7. The method of claim 1, wherein determining whether the potential replacement beacon node has received a beacon signal from a higher ranking potential replacement beacon node includes comparing the node-hop tally of the potential replacement beacon node to the node-hop tally of each node that sent a beacon signal, wherein the node-hop tally of each node is the total number of node hops required for the node to reach each other node in the wireless network.

8. The method of claim 1, wherein determining whether the node should nominate itself as a potential replacement beacon node includes generating a random number at the node and comparing the random number to a threshold value, wherein the threshold value is adaptively modified to decrease nominations by nodes across the network as the number of nodes in the network increases.

9. The method of claim 1, wherein determining whether the node should nominate itself as a potential replacement beacon node includes generating a random number at the node and comparing the random number to a threshold value, wherein the threshold value is adaptively modified to favor nomination of nodes close to the center of the network and disfavor nodes away from the center of the network.

10. The method of claim 1, wherein determining whether the potential replacement beacon node has received a beacon signal from a higher ranking potential replacement beacon node includes comparing accuracy of timekeeping apparatus of the potential replacement beacon node to accuracy of timekeeping apparatus of the node receiving the beacon signal.

11. The method of claim 1, wherein determining whether the potential replacement beacon node has received a beacon signal from a higher ranking potential replacement beacon node includes comparing a length of time parameter from each node measured from when each node'"'"'s sleeping parameters was last configured.

12. The method of claim 1, wherein each node adaptively modifies its threshold value in response to beacon signals received from other nodes and wherein the threshold value is adaptively modified to favor nodes with better link-quality metrics.

13. The method of claim 1, wherein sending out one or more beacon signals includes transmitting a beacon signal periodically as long as the node remains a potential replacement beacon node.

14. The method of claim 13, wherein transmitting a beacon signal periodically includes throttling back transmission of beacon signals as a function of the volume of beacon signals received from other potential replacement beacon nodes.

21. An article comprising a computer readable medium having instructions thereon, wherein the instructions, when executed by a machine, create a system for executing the method of claim 1.

15. A wireless network comprising:

a plurality of nodes, wherein each node communicates wirelessly to one or more other nodes in the network and wherein one node operates as a beacon node to synchronize each of the remaining nodes;

wherein each node includes;

a detection mechanism for detecting when the beacon node should be replaced;

a self-nominating mechanism for determining when the node should nominate itself as a potential replacement beacon node; and

an election mechanism for removing the node as a candidate for the replacement beacon node;

wherein the self-nominating mechanism operates to determine whether the node should nominate itself as a potential replacement beacon node, wherein the node nominates itself as a function of a nomination probability associated with the node, wherein each node adaptively modifies its nomination probability in response to the number of beacon signals received from other nodes;

wherein the node transmits a beacon signal to other nodes in the network periodically as long as it remains a potential replacement beacon node; and

wherein the election mechanism removes the node as a candidate for the replacement beacon node when the node receives a beacon signal from a higher ranking potential replacement beacon node.

16. The network of claim 15, wherein the node nominates itself as a function of a random number generated by the node and a threshold value associated with the node.

17. The network of claim 16, wherein the threshold value associated with the node is adaptively modified as a function of the volume of beacon traffic received by the node and of a link-quality metric associated with the node.

18. The network of claim 16, wherein the threshold value associated with the node is adaptively modified as a function of the volume of beacon traffic received by the node and of the location of the node with respect to the other nodes in the wireless network.

19. The network of claim 16, wherein the threshold value associated with the node is skewed to favor nomination of nodes close to the center of the network and disfavor nodes away from the center of the network.

20. The network of claim 15, wherein the period for transmitting the beacon signal increases as a function of the number of beacon signals received by the node.