Patent ID: 8792389

Claim:
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: X δ = { ∞ , ∃ X i ≥ C max , i ∈ [ 1 , n ] X 1 + X 2 + X _ i + D ⁢ ∑ ⁢ Δ ⁢ ⁢ X , X i < C max , i ∈ [ 3 , n ] ⁢ ⁢ X _ i = ∑ 3 n ⁢ ⁢ X i n - 2 ⁢ ⁢ ∑ ⁢ Δ ⁢ ⁢ X = ∑ 3 n ⁢ ⁢ X i - X _ i , X i > X _ i Wherein D is an adjustable parameter, X is a cost value, and C max is the maximum value of said cost value.