Rapid deployment devices in wireless self-organizing networks and methods for same

• US 8,792,389 B2
• Filed: 03/06/2012
• Issued: 07/29/2014
• Est. Priority Date: 09/13/2011
• Status: Active Grant

• Current Assignee: Skyphy Networks Co., Ltd, Skyphy Networks Communication (Shanghai), Inc. (Skyphy Networks Co., Ltd)
• Original Assignee: Skyphy Networks Co., Ltd, Skyphy Networks Communication (Shanghai), Inc. (Skyphy Networks Co., Ltd)
• Inventors: Xiong, Jing, Qiang, Gang, Chen, Yi
• Primary Examiner(s): Haile, Awet
• Assistant Examiner(s): MYERS, ERIC A
• Application Number:
  US13/385,757
• Publication Number:
  US 20130064134A1
• Time in Patent Office: 875 Days
• Field of Search: 370/248, 370/252, 370254-255, 370/328, 4554221-425, 455/446, 709223-224
• US Class Current: 370/255
• CPC Class Codes: H04W 40/12 based on transmission quality or channel quality
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

The present invention provides rapid deployment devices in wireless self-organizing networks. The device in accordance with the present invention may include a control unit having a rapid deployment information segment module and a wireless communication unit electrically coupled to the control unit. The control unit of the present invention may broadcast a neighbor beacon to at least one neighbor. In accordance with the present invention, the rapid deployment information segment module may expand the neighbor beacon to include a rapid deployment information segment so as to transmit rapid deployment information. In accordance with the present invention, the rapid deployment information may include a cost sequence to a reference node.

Claims

1. A rapid deployment method in a wireless self-organizing network, said method comprising:

designating a reference node to a self-node already in said network;

broadcasting a neighbor beacon of said self-node to at least one neighbor node in said network;

expanding said neighbor beacon of said self-node to include a rapid deployment information segment;

inserting rapid deployment information of said self-node in said rapid deployment information segment, wherein said rapid deployment information of said self-node includes a cost sequence from said self-node to said reference node;

periodically updating said rapid deployment information of said self-node based on rapid deployment information of said at least one neighbor node, wherein said rapid deployment information of said at least one neighbor node includes a cost sequence from said at least one neighbor node to said reference node; and

periodically performing evaluation and indication of a connectivity to said reference node,

wherein periodically performing evaluation and indication of said connectivity to said reference node includes determining whether a best route exists based on a relay number to said reference node, when said best route exists, said cost sequence is converted to said data value to be indicated, and when said best route does not exist, no route to said reference node is indicated, and

wherein said data value is calculated based on a multi-hop integral evaluation method, said multi-hop integral evaluation method is derived from the following equation;

2. The method of claim 1, further comprising updating a cost value of said self-node to said at least one neighbor node.

3. The method of claim 1, further comprising outputting said data value, wherein said data value can be indicated in multiple levels.

4. The method of claim 1, wherein said reference node is a unique reference node.

5. The method of claim 1, wherein said cost sequence is a sequence consisted of a cost value of each relay on a best route from said self-node to said reference node, and wherein said cost value is a time parameter for a data to transmit from a transmitting node to a destination node.

6. The method of claim 1, further comprising initializing said rapid deployment information segment so as to set said relay number to said reference node to 0, said cost value to empty, and to set said relay number to a non-reference node to 255, said cost value to empty.

7. The method of claim 1, wherein updating said rapid deployment information includes continuously receiving said neighbor beacon sent from said neighbor node and storing said rapid deployment information included in said neighbor beacon.

8. The method of claim 1, wherein said best route is deemed non-existent when said relay number to said reference node is 255.

9. A rapid deployment method in a wireless self-organizing network, said method comprising:

designating a reference node in a network;

broadcasting a neighbor beacon of a self-node to at least one neighbor node;

expanding said neighbor beacon to include a rapid deployment information segment;

inserting rapid deployment information of said self-node in said rapid deployment information segment, wherein said rapid deployment information of said self-node includes a cost sequence from said self-node to said reference node;

periodically updating said rapid deployment information of said self-node based on rapid deployment information of said at least one neighbor node, wherein said rapid deployment information includes a cost sequence from said at least one neighbor node to said reference node; and

periodically performing evaluation and indication of a connectivity to said reference node, wherein periodically performing evaluation and indication of said connectivity to said reference node includes determining whether a best route exists based on a relay number to said reference node, when said best route exists, said cost sequence is converted to said data value to be indicated, and when said best route does not exist, no route to said reference node is indicated, and wherein said data value is calculated based on a multi-hop integral evaluation method, said multi-hop integral evaluation method is derived from the following equation;

10. The method of claim 9, further comprising updating a cost value of said self-node to said at least one neighbor node.

11. The method of claim 9, further comprising outputting said data value, wherein said data value can be indicated in multiple levels.

12. The method of claim 9, wherein said reference node is a unique reference node.

13. The method of claim 9, wherein said cost sequence is a sequence consisted of a cost value of each relay on a best route from said self-node to said reference node, and wherein said cost value is a time parameter for a data to transmit from a transmitting node to a destination node.

14. The method of claim 9, further comprising initializing said rapid deployment information segment so as to set said relay number to said reference node to 0, said cost value to empty, and to set said relay number to a non-reference node to 255, said cost value to empty.

15. The method of claim 9, wherein updating said rapid deployment information includes continuously receiving said neighbor beacon sent from said neighbor node and storing said rapid deployment information included in said neighbor beacon.

16. The method of claim 9, wherein said best route is deemed non-existent when said relay number to said reference node is 255.