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

• US 20130064134A1
• Filed: 03/06/2012
• Published: 03/14/2013
• 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: Qiang, Gang, Chen, Yi, Xiong, Jing
• Granted Patent: US 8,792,389 B2
• Time in Patent Office: Days
• US Class Current: 370/254
• 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 device in a wireless self-organizing network, said device comprising:

a control unit, said control unit having a rapid deployment information segment setup module;

a wireless communication unit coupled to said control unit, said wireless communication unit broadcasting a neighbor beacon to at least one neighbor node,

wherein said rapid deployment information segment setup module expands said neighbor beacon to include a rapid deployment information segment to transmit rapid deployment information, and

wherein said rapid deployment information includes a cost sequence from a self-node to a reference node.

2. The device 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.

3. The device of claim 2, wherein said cost value is a time parameter for a data to transmit from a transmitting node to a destination node.

4. The device of claim 1, wherein said control unit further includes a reference node designation module so as to designate said reference node in a network.

5. The device of claim 1, wherein said control unit further includes an initiation module so as to initialize said rapid deployment information segment.

6. The device of claim 1, wherein said control unit further includes a rapid deployment information update module so as to update said rapid deployment information of said self-node based on said rapid deployment information of said at least one neighbor node.

7. The device of claim 2, wherein said control unit further includes a cost value update module so as to periodically update said cost value to said neighbor node.

8. The device of claim 1, wherein said control unit further includes a rapid deployment information inserting module so as to insert a latest rapid deployment information, wherein said latest rapid deployment information includes said rapid deployment information of a best neighbor.

9. The device of claim 1, wherein said control unit further includes an evaluation and indication module so as to periodically evaluate and indicate a connectivity to said reference node and to generate a data value.

10. The device of claim 9, further comprising a wireless link quality indication unit coupled to said control unit to output said data value, wherein said data value can be indicated in multiple levels.

11. The device of claim 10, wherein said wireless link quality indication unit is a plurality of LEDs.

12. The device of claim 1, further comprising an interface unit coupled to said control unit so as to establish a connection with an external device.

13. The device of claim 12, wherein said interface unit is a 10/100/1000M self-adaptive Ethernet connection port.

14. The device of claim 1, wherein said wireless communication unit is a wireless network card.

15. The device of claim 1, wherein said rapid deployment information further includes a relay number to said reference node.

16. The device of claim 5, wherein said initiation module initializing said rapid deployment information segment includes setting a relay number to said reference node to 0, said cost value to empty, and setting said relay number to a non-reference node to 255, said cost value to empty.

17. The device of claim 9, wherein said evaluation and indication module 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, if said best rout exists, then converting said cost sequence to said data value to be indicated, and if said best route does not exist, then indicating there is no route to said reference node.

18. The device of claim 17, wherein said evaluation and indication module periodically performing evaluation and indication of said connectivity to said reference node includes determining said best route does not exist if said relay number to said reference node is 255.

19. The device of claim 9, 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:

20. 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 a rapid deployment information in said rapid deployment information segment, wherein said rapid deployment information includes a cost sequence from said self-node to said reference node; and

periodically updating said rapid deployment information of said self-node based on said rapid deployment information of said at least one neighbor node.

21. The method of claim 20, wherein said reference node is a unique reference node.

22. The method of claim 20, 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.

23. The method of claim 20, further comprising initializing said rapid deployment information segment so as to set a 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.

24. The method of claim 20, wherein updating said rapid deployment information include continuously receiving said neighbor beacon sent from said neighbor node and storing said rapid deployment information included in said neighbor beacon.

25. The method of claim 20, further comprising periodically performing evaluation and indication of a connectivity to said reference node.

26. The method of claim 25, 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, if said best route exists, then converting said cost sequence to said data value to be indicated, and if said best route does not exist, then indicating there is no route to said reference node.

27. The method of claim 26, wherein said best route is deemed non-existent if said relay number to said reference node is 255.

28. The method of claim 26, 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:

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

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