CN1984015A - Construction and operation for wireless self-organizing network - Google Patents

Abstract

This invention discloses a self-organizing wireless network establishing method, the stated self-organizing wireless network is two-story network. On the network there sets father node list, when the network is established, the head node broadcasting takes self-node identification group created news, when other nodes receive the group created news, it amends its father node list according to the need, and the broadcasting taking self-node denotes the relative distance group created news. This invention also discloses one kind wireless self-organizing network's work method, when the group member node does not successfully send data to any node of father node lists, it will try to search for the new father node, and makes the sending invitation information node identification to replace its father node list. When the group member node finds that other nodes searching for the new father node, if it can provide relay, it sends the inviting information. Use of the providing technical program of this invention, it can reduce the overall energy consumption of the network and improve network stability.

Description

A kind of foundation of wireless self-organization network and method of work

Technical field

The present invention relates to wireless communication technology, particularly relate to a kind of foundation and method of work of wireless self-organization network.

Background technology

Wireless self-organization network is a kind of special cordless communication network.This network is made up of great deal of nodes usually, and these nodes become the network with hierarchical structure, collaborative work according to the automatic tissue of agreement after entering site of deployment.The node of wireless self-organization network is made up of microprocessor, internal memory, battery and mini radio transceiver and other application modules usually.Typical wireless self-organization network be wireless sensor network (Wireless Sensor Network, WSN).Wireless sensor network can be gathered the information of specifying monitoring target after being deployed in site of deployment in real time, and it is handled, and then result is sent to the base station, does further processing by the base station.

Existing wireless self-organization network is general to adopt packet-based two-layer structure to realize, and adopts low-yield self-adaption cluster level (LEACH, Low Energy Adaptive Clustering Hierarchy) algorithm to realize the self-organizing of network.So-called two-layer structure refers to and all nodes in the wireless self-organization network is divided into group leader's node and group member's node, formation group internal layer between group leader's node of a group and the group member's node, formation group interbed between group leader's node of each group and the base station.In the LEACH algorithm, select group leader's node at random by the cycle, group leader's node broadcasts is set up other node adding groups around the upright message invitation; Other nodes except that group leader's node add the group of being set up from own nearest group leader's node after receiving the upright message of establishment, become group member's node, direct later on and group leader's node communication.Direct and the base station communication of group leader's node is responsible for compression and is transmitted all data in this group.

By above description for the LEACH algorithm as can be seen, from concerning the requirement of node transmitting power, at first, the wireless signal transmission power of chosen group leader's node is bigger, needs at least to guarantee that the wireless signal that group leader's node is launched can cover whole group; Secondly group member's node is adjusted transmitting power according to the distance to group leader's node, needs extra hardware supports; At last, the closer to the edge of group, the transmitting power of group member's node is just big more, and the worst situation is that the emission radius of group member's node at group edge also needs to equal to organize radius.

In LEACH, because the coverage of a large amount of group member's nodes overlaps, need to adopt time division multiplexing (TDMA, Time Division Multiple Access) technology to prevent to organize the conflict of interior nodes, adopt the conflict of CDMA (Code Division Multiple Access) between preventing to organize and organize, thereby improved requirement hardware.

And from stability of network, in the course of work of network, group member's node can only with group leader's node communication, if this group leader's node failure, have only so when new round network is set up by the time, group member's node could play a role again, so stability of network is poor.

Summary of the invention

In view of this, main purpose of the present invention is to provide a kind of method for building up of wireless self-organization network, to reduce the whole energy consumption of network, reduces the requirement to hardware, improves stability of network.

Main purpose of the present invention also is to provide a kind of method of work of wireless self-organization network, to reduce the whole energy consumption of network, reduces the requirement to hardware, improves stability of network.

In order to achieve the above object, the invention provides a kind of method for building up of wireless self-organization network, it is characterized in that, described wireless self-organization network is two layers of wireless self-organization network, and the father node tabulation is set on radio self-organized network nodes, when setting up, wireless self-organization network at first determines group leader's node, carry the upright message of establishment of self node identification by group leader's node broadcasts, other nodes in the wireless self-organization network except that group leader's node add in the group of being set up by group leader's node according to the upright message of the establishment of being received after receiving the upright message of establishment.

Wherein, preestablish the cycle of changing group leader's node, and best group leader's probability, described definite group leader's node is:

When one-period begins, periodicity that each node has been worked according to best group leader's probability, node and the periodicity of serving as group member's node continuously, basis of calculation probability, and serve as group leader's node with the standard probability.

Wherein, described setting is changed best group leader's probability and is:

According to following formula calculating optimum group leader probability:

$p=[\frac{1}{3c}+\frac{\sqrt[3]{2}}{3c\×{(2+27c^2+3\sqrt{3}c\×\sqrt{27c^2+4})}^{\frac{1}{3}}}+\frac{1}{\sqrt[3]{2}}\frac{{(2+27c^2+3\sqrt{3}c\×\sqrt{27c^2+4})}^{\frac{1}{3}}}{3c}{]}^2$

Wherein, $c=3\frac{d^4\×e_{\mathrm{mp}}+E_{\mathrm{elec}}}{2\sqrt{2E_{\mathrm{elec}}\×e_{\mathrm{fs}}}}\×\sqrt{\mathrm{\λ}},$ D represents all internodal average distances in base station and the network, E _ElecIndication circuit energy consumption parameter, e _FsExpression free space model amplifier energy consumption parameter, e _MpExpression multichannel attenuation model amplifier energy consumption parameter, λ is the parameter of wireless ad hoc network node two dimension Poisson distribution.

Wherein, described each node is according to best group leader's probability, periodicity that node has been worked and the periodicity of serving as group member's node continuously, and basis of calculation probability is:

Judge serve as group member's node continuously periodicity whether less than If, less than then the standard probability of order is 0, otherwise calculate described standard probability according to following formula:

$\frac{p}{1-p\×\mathrm{round}\mathrm{mod}\left(\frac{1}{p}\right)}$

Wherein round represents the periodicity that node has been worked, and p represents described best group leader's probability.

Wherein, describedly serve as group leader's node with the standard probability and be:

Between 0 to 1, generate a random number, and whether the random number that is relatively generated is less than described standard probability, if less than at the interim group leader's node of serving as this week, otherwise at the interim group member's node of serving as this week,

Wherein, described other nodes except that group leader's node are after receiving the upright message of establishment, according to comprising in the group of the upright message adding of the establishment of being received by the foundation of group leader's node:

A1, according to the upright message of the establishment that receives, judge whether to need to revise the father node tabulation of self, if desired, execution in step B1 then, otherwise finish current flow process;

B1, according to the upright message of the establishment that receives, the upright message of establishment that judges whether to need broadcasting to transmit and receive, if desired, execution in step C1 then, otherwise, the node identification that carries in the upright message of the establishment of being received is added in the father node tabulation of self, finish current flow process then;

C1, empty self father node tabulation, then the father node sign in the upright message of the establishment of being received is added in the father node tabulation of self, and the relative distance of self is set according to the upright message of the establishment that receives;

The node identification of self and the upright message of establishment of relative distance are carried in D1, broadcasting.

Wherein, described group leader's node broadcasts is carried the upright message of establishment of self node identification and is:

Group leader's node in the upright message of the establishment of being broadcasted further the value of carrying be 0 relative distance.

Wherein, other nodes in the wireless self-organization network except that group leader's node further comprised before steps A 1 after receiving the upright message of establishment:

Judge whether the upright message of the establishment of being received carries relative distance, if do not carry, then making the relative distance of the node that sends the upright message of described establishment is 0.

Wherein, message is found in the establishment that steps A 1 described basis receives, and judges whether that the father node tabulation that needs to revise self is:

Judge the relative distance of the father node of self,,, otherwise think and do not need to revise the father node tabulation of self if then thinking needs to revise the father node tabulation of self whether more than or equal to the relative distance of the node that sends the upright message of described establishment;

Message is found in the establishment that the described basis of step B1 receives, and judges whether that the upright message of the establishment that needs the broadcasting forwarding to receive is:

Judge the relative distance of the father node of self, whether greater than the relative distance of the node that sends the upright message of described establishment, if greater than, then think the upright message of establishment that needs broadcasting to transmit to receive, otherwise think not need to broadcast and transmit the upright message of the establishment that receives.

Wherein, step B1 further comprised before the described node identification that the establishment of being received is carried in the upright message adds in self the father node tabulation:

Judge that whether Already in the node identification that to carry in the upright message of the establishment received in self the father node tabulation, if exist, then finish current flow process, otherwise the node identification that carries in the upright message of the establishment of being received is added in the father node tabulation of self.

Wherein, the upright message of the establishment that receives of the described basis of step C1 is provided with the relative distance of self and is:

Relative distance in the upright message of the establishment that receives is added the relative distance of 1 back as self.

Wherein, set in advance the relay point restriction, further comprise between step C1 and the step D1:

Whether the relative distance of judging self surpasses the relay point restriction, if, then finish current flow process, otherwise execution in step D1.

Wherein, described wireless self-organization network is a wireless sensor network.

In the first of the method for work of wireless self-organization network provided by the invention, this wireless self-organization network is two layers of wireless self-organization network, the father node tabulation is set on group member's node, the via node sign that can adopt when communicating by letter with group leader in order to be kept at, when father node sent data, this method comprised at group member's node:

A2, judge whether can be successfully arbitrary node in the father node tabulation send data, if can successfully send, then finish current flow process, otherwise execution in step B2;

B2, transmission reorganization request message are to attempt seeking new father node, and judge whether to receive invitation message, if receive then replace self father node tabulation with the node identification that sends invitation message, otherwise the state of self is set to wait for, finishes current flow process.

Wherein, this method further comprises:

C2, when group member's node is received reorganization request message except that other node self, judging whether to provide relaying for the node that sends the reorganization request message, if can, then send invitation message, otherwise finish current flow process to the node that sends the reorganization request message.

Wherein, set in advance response and wait for duration, steps A 2 is described to be judged whether that successfully the arbitrary node in the father node tabulation sends data and comprises:

A21, with all nodes of record in the father node tabulation as effective father node;

A22, from effective father node, select one as current parent's node, send data and pick up counting to current parent's node, judge then and in duration is waited in described response, whether receive the response message that current parent's node sends, if receive, think that then successfully the arbitrary node in the father node tabulation sends data, otherwise execution in step A23;

A23, be invalid, and it is invalid to judge whether in the father node tabulation that all nodes all have been labeled as, if think that then successfully the arbitrary node in the father node tabulation sends data, otherwise return execution in step A22 with current parent's vertex ticks.

Wherein, set in advance to repair and wait for duration, step B2 is described to judge whether to receive that invitation message is:

Whether judgement receives invitation message from sending the reorganization request message in repairing the wait duration.

Wherein, described invitation message is carried node identification and the relative distance of sending invitation message, and the father node tabulation that the described node identification with the transmission invitation message of step B2 is replaced self comprises:

B21, will send in the node of invitation message, the node of relative distance minimum is as new father node;

B22, empty father node tabulation, new father node sign is added in the father node tabulation.

B23, the relative distance of carrying in the invitation message is added 1 back as self relative distance.

Wherein, described reorganization request message carries the node identification that sends the reorganization request message, and described the judging whether of step C2 can provide relaying to be for the node that sends the reorganization request message:

C21, the node identification that carries in the request message according to reorganization, judge whether the node that sends the reorganization request message is the father node of self, if, then delete the node that sends the reorganization request message in uncle's node listing, and thinking to provide relaying for the node that sends the reorganization request message, if not, execution in step C22 then;

C22, judge whether self is in wait state,, otherwise think and to provide relaying for the node that sends the reorganization request message if then thinking to provide relaying for the node that sends the reorganization request message.

Wherein, set in advance the relay point restriction, in step C22, when node is not in wait state, further comprise:

Whether the relative distance of judging self surpass the relaying restriction of counting, if surpass, then thinking to provide relaying for the node that sends the reorganization request message, otherwise thinks and can provide relaying for the node that sends the request message of recombinating.

Wherein, in step C21, after the node of reorganization request message is sent in deletion in uncle's node listing, further comprise:

Whether the father node tabulation of judging self is empty, if be sky, and execution in step B2 then, otherwise finish current flow process.

Wherein, set in advance the buffering duration, describedly be at father node tabulation execution in step B2 when empty:

Pick up counting execution in step B2 after arriving the wait duration for sky from judging tabulation.

Wherein, described wireless self-organization network is a wireless sensor network.

In the second portion of the method for work of wireless self-organization network provided by the invention, this wireless self-organization network is two layers of wireless self-organization network, the father node tabulation is set on group member's node, the via node sign that can adopt when communicating by letter with group leader in order to be kept at, the node of group member's node in the tabulation of self father node sent the reorganization request message when all losing efficacy, when other nodes were received the reorganization request message, this method comprised:

A3, judge whether and can provide relaying for the node that sends the reorganization request message, if can, then send invitation message, otherwise finish current flow process to the node that sends the reorganization request message.

Wherein, described reorganization request message carries the node identification that sends the reorganization request message, and steps A 3 described judging whether can provide relaying to comprise for the node that sends the reorganization request message:

A31, the node identification that carries in the request message according to reorganization, judge whether the node that sends the reorganization request message is the father node of self, if, then delete the node that sends the reorganization request message in uncle's node listing, and thinking to provide relaying for the node that sends the reorganization request message, if not, execution in step A32 then;

A32, judge whether self is in wait state,, otherwise think and to provide relaying for the node that sends the reorganization request message if then thinking to provide relaying for the node that sends the reorganization request message.

Wherein, set in advance the relay point restriction, in steps A 32, when node is not in wait state, further comprise:

Whether the relative distance of judging self surpass the relaying restriction of counting, if surpass, then thinking to provide relaying for the node that sends the reorganization request message, otherwise thinks and can provide relaying for the node that sends the request message of recombinating.

Wherein, described wireless self-organization network is a wireless sensor network.

Adopt technical scheme provided by the present invention, from concerning the requirement of node transmitting power, at first all nodes comprise that group leader's node can adopt identical transmitting power with group member's node, and do not need to carry out the self adaptation adjustment according to nodal distance; Secondly, because the existence of via node makes that the transmitting power of all nodes all need not be too big, desired coverage is far smaller than the group radius.

From concerning the requirement of hardware,, reduced great deal of nodes and sent the probability that leads to a conflict simultaneously, and the simple CSMA/CA of communication utilization between the adjacent node can effectively avoid a conflict because the coverage of each node reduces greatly.

From stability of network, set up in the process at network, group member's node according to the relative distance of group leader's node, form tree, promptly with the nearer node of group leader's node relative distance as with the father node of group leader's node relative distance node far away, a child node can have a plurality of father nodes, and a father node also can have a plurality of child nodes.Like this in the network work process, for group member's node, certain father node in a plurality of father nodes lost efficacy, and perhaps and after the wireless channel conditions between this father node worsens, can also continue to send data to group leader's node by other father nodes.So just improved stability of network.

Description of drawings

Fig. 1 is the flow chart of wireless self-organization network method for building up provided by the invention;

Fig. 2 is the flow chart of wireless self-organization network method of work provided by the invention;

Fig. 3 is the flow chart of wireless self-organization network method of work provided by the invention.

Embodiment

Core concept of the present invention is: setting up in the process of the wireless self-organization network that adopts two-layer structure, set up upright message by group leader's node broadcasts, node except that group leader's node according to the relative distance of group leader's node, message is found in the establishment that forwarding group leader node is from the close-by examples to those far off broadcasted; Receive the node of setting up upright message, the node that sends the upright message of this establishment is kept in the father node tabulation of self; When group leader's node sends data, select in a plurality of father nodes one at needs dynamically as relaying.

For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with drawings and the specific embodiments.

At first illustrate in the wireless self-organization network method for building up provided by the invention, select the method for group leader's node.Because the energy consumption of group leader's node therefore need be according to certain cycle usually greater than group member's node in double layer network, periodic replacement group leader node is to safeguard the balancing energy of whole network.The described cycle is provided with before node enters site of deployment as required.In addition, say in principle that same node is served as for twice between group leader's node, should certain at interval periodicity.

In the present invention, two counters are set on each node: first counter and second counter.Node is when entering site of deployment, and first counter of all nodes and the value of second counter all are 0.Every through one-period, first counter and second counter of all nodes add 1 respectively.If node has been served as group leader's node in certain cycle, then to be reset be 0 to second counter.In other words, the value of first counter in the network on node, the periodicity that the expression node has been worked, and second Counter Value represent that this node serves as the periodicity of group member's node continuously.

Before the node of wireless self-organization network enters site of deployment, at first calculate best group leader's probability at this wireless self-organization network, the interstitial content of serving as group leader in each cycle just accounts for the ratio of total interstitial content, then best group leader's probability is stored in each node.Each cycle at first, the value that node is at first judged second counter whether less than

, wherein round represents the currency of first counter, p represents described best group leader's probability.

If the value of second counter more than or equal to

, then node calculates a standard probability according to following formula:

$\frac{p}{1-p\×\mathrm{round}\mathrm{mod}\left(\frac{1}{p}\right)}$

Wherein, p represents described best group leader's probability, and round represents the currency of described first counter.If the value of counter B less than , make directly then that described standard probability is 0.

Then, node generates a random number between 0 to 1, and whether the random number that is relatively generated is less than described standard probability, if less than at the interim group leader's node of serving as this week, otherwise, that is to say that node is served as group leader's node with described standard probability at the interim group member's node of serving as this week.

Because the random number that is generated must be more than or equal to 0, if therefore serving as group leader with probability 0 does not serve as group leader.

Be described in detail the computational methods of described best group leader's probability below, best group leader's probability is to make group leader's probability of whole energy consumption minimum of network.And the whole energy consumption of network can be expressed as:

λ×A×p×[J×(2E _elec+e _fs×r ²)+(d ⁴×e _mp+E _elec)]

Wherein, suppose that node is dispersed in the rectangular area with two-dimentional Poisson distribution, and λ is the parameter of two-dimentional Poisson distribution, represents the density of node substantially, the value of λ determines according to application need.

A represents the network gross area, and the value of A is determined by the application scenario.

P represents described best group leader's probability.

R represents the communication radius of node in the network.

D represents all internodal average distances in base station and the network, and it is determined by application need.

E _ElecIndication circuit energy consumption parameter, E _ElecValue be by coded system, modulation system etc. decisions.

e _FsExpression free space model amplifier energy consumption parameter, e _FsValue determine by the tolerable error rate.

e _MpExpression multichannel attenuation model amplifier energy consumption parameter, e _MpValue determine by the tolerable error rate.

J represents relaying number that group interior nodes signal post needs in the network, and J is obtained by following formula:

$J=\mathrm{MAX}\{\frac{(1-p)}{1.5p^{3/2}\×\sqrt{\mathrm{\λ}}\×r},\frac{1-p}{p}\}$

Wherein, MAX represents to get maximum.The meaning of other parameters is ditto described.

In the above-mentioned factor that influences the whole energy consumption of network, three energy consumption parameters are subjected to hardware constraints; And Parameter for Poisson Distribution λ, and the average distance d of all nodes in base station and the network, all determine by application need.Therefore, for a specific wireless self-organization network, can regard these five parameters as constant.So at the whole energy consumption λ * A of network * p * [J * (2E _Elec+ e _Fs* r ²)+(d ⁴* e _Mp+ E _Elec)] in, having only group radius and best group leader's probability in the network is variable.By the whole energy consumption of network is got extreme value to these two variablees, just can obtain making the best group leader's probability and the optimal node communication radius value of the whole energy consumption minimum of network, as follows:

$p=[\frac{1}{3c}\frac{\sqrt[3]{2}}{3c\×{(2+27c^2+3\sqrt{3}c\×\sqrt{27c^2+4})}^{\frac{1}{3}}}+\frac{1}{\sqrt[3]{2}}\frac{{(2+27c^2+3\sqrt{3}c\×\sqrt{27c^2+4})}^{\frac{1}{3}}}{3c}{]}^2$

$r=\sqrt{2\frac{E_{\mathrm{elec}}}{e_{\mathrm{fs}}}}$

Wherein, $c=3\frac{d^4\×e_{\mathrm{mp}}+E_{\mathrm{elec}}}{2\sqrt{2E_{\mathrm{elec}}\×e_{\mathrm{fs}}}}\×\sqrt{\mathrm{\λ}}.$

According to above formula, just can calculate described best group leader's probability.

Please refer to Fig. 1, Fig. 1 is the flow chart of wireless self-organization network method for building up provided by the invention.At the network establishment stage, group leader's node the present invention includes following steps after selecting and broadcast and setting up upright message:

Step 101: other nodes except that group leader's node receive sets up upright message.

The upright message of described establishment comprises the node identification that sends this message at least, and the relative distance of sending the node of this message.The relaying number that the relative distance of a node is represented need pass through when being this node and group leader's node communication.Description from behind as can be seen, the upright message of described establishment can be that group leader's node sends, and also can be that group member's node sends.The relative distance that group leader's node sends is 0, directly and the relative distance of group member's node of group leader's node communication be 1, the relative distance of the group member's node by relaying and group leader's node communication is 2, the rest may be inferred.In other words, the relative distance of group member's node, when equaling this group member's node and group leader's node communication the relaying number of process add 1; The relative distance of group leader's node is 0.

As a kind of replacement scheme, in the upright message of the establishment that group leader's node is sent, can not carry relative distance.Node receives the upright message of the establishment of not carrying relative distance, then is used as to have received that to have carried value be that the establishment of 0 relative distance is found message and handled.

Step 102: group member's node judges that whether entrained relative distance in the upright message of the establishment receive add after 1 the relative distance greater than self, if greater than, then execution in step 106, otherwise execution in step 103.

After node enters site of deployment, can at first carry out the initialization of self.In initialization procedure, node can self relative distance be set to maximal phase and adjusts the distance.For example, if represent relative distance with one 8 no symbol binary numbers, so in described initialization procedure, node will self relative distance be set to 255.Therefore, after receiving that article one is set up upright message, node will inevitably execution in step 103.But in subsequent process, node might continue to receive sets up upright message, and at this moment just possible execution in step 103 also might execution in step 106.

Step 103: group member's node judges the relative distance of carrying in the upright message of the establishment that receives adds whether equal the relative distance of self after 1, if equal, then execution in step 104, otherwise execution in step 107.

Step 104: group member's node judges whether node identification entrained in the upright message of the establishment that receives is identical with the father node sign of self record, if identical, then execution in step 106, otherwise execution in step 105.

In initialization procedure, node can the father node sign be set to sky, perhaps is set to the sign of node self.Therefore, after receiving that article one is set up upright message, node will inevitably execution in step 105.But in subsequent process, node might continue to receive sets up upright message, and at this moment just possible execution in step 105 also might execution in step 106.

Description from behind as can be seen, group member's node can be for self being provided with the tabulation of father node.In tabulation, have under the situation of a plurality of father nodes, the father node sign of said herein and self record is identical refer to the father node tabulation in any one father node sign identical.

Step 105: group member's node adds the father node sign in the upright message of described establishment in the father node tabulation of self to, finishes current flow process.

The judgement that integrating step 103 and step 104 are done, group member's node can be confirmed, send the node of the upright message of described establishment, have identical relative distance with the father node of self, and not in current father node tabulation.Therefore, can be with the node that sends the upright message of described establishment as one of father node of candidate.

Step 106: group member's node abandons the upright message of described establishment, finishes current flow process.

Step 107: the relative distance that group member's node will be set up in the upright message adds the relative distance of 1 back as self.

Step 108: group member's node empties the father node tabulation of self, and the father node sign of setting up in the upright message is added in the father node tabulation of self.

Integrating step 102 and 103 judgements of being done have only the relative distance of carrying in the upright message of described establishment to add 1 after less than the relative distance of group member's node self, just understand execution in step 107 and 108.In this case, the relative distance of the node that sends the upright message of described establishment is described, littler than the relative distance of the father node of group member node.According to the principle of selecting nearest path with group leader's node communication, group member's node will be with the node that sends the upright message of described establishment as oneself new father node, and the node in no longer tabulating with former father node is as the father node of oneself.Like this, group member's node self also reduces accordingly to the relative distance of group leader's node.

Step 109: group member's node judges whether the relative distance of self surpasses the relay point restriction, if surpass, then execution in step 112, otherwise execution in step 110.

Described relay point restriction sets in advance for the scale that limits group.Because if network size is too big, from the near group member's node of group leader's node, will inevitably spend lot of energy and disposal ability for from group leader's node group member's node relay data far away, be unfavorable for the equilibrium of network energy, be unfavorable for that also node finishes other tasks of self bearing.

Can be set to surpassing here greater than, also can be set to more than or equal to.

Step 110: replace the node identification of setting up in the upright message with the node identification of self, replace the relative distance of setting up in the upright message with the relative distance of self.

Step 111: broadcast the upright message of amended establishment.

Like this, can be the center just with group leader's node, the foundation of finishing group from the close-by examples to those far off.The upright message of establishment is at first sent by group leader's node; After node in the wireless signal coverage of group leader's node is received the upright message of establishment that group leader's node sends, according to above-mentioned flow process adding group, the node identification in the message is found in the establishment of being received with node identification replacement separately respectively then, and the relative distance that will set up in the upright message is made as 1, broadcasts the upright message of new establishment then; Not in the wireless signal coverage of group leader's node, but the node in the wireless signal coverage of group member's node of above-mentioned adding group, receive the upright message of described new establishment after, again according to above-mentioned flow process adding group; And the like up to reaching the restriction that relaying is counted.

After the foundation of group is finished, be root node with group leader's node, group member's node according to the relative distance of group leader's node, form tree structure, and same node has a plurality of father nodes.Especially, for the group member's node that is in the group intersection, its a plurality of father nodes may belong to different groups respectively.In addition, by child node and the role of father node when communicating by letter with group leader as can be seen, child node can be called by via node, and father node can be called via node.

Please refer to Fig. 2, Fig. 2 is the flow chart of wireless self-organization network method of work provided by the invention.When network work, adopt the carrier sense multiple access to insert (CSMA/CA:Carrier Sense MultipleAccess with Collision Avoidance) technical approach and communicate.For group member's node, when group leader's node sent data, this method comprised at needs:

Step 201: be ready for sending data.

Step 202: all father nodes in the father node tabulation all are labeled as effectively

Described father node tabulation is exactly the father node tabulation of being write down in setting up upright process.

Step 203: from effective father node, choose one as current parent's node, send data to current parent's node, and pick up counting.

In the father node tabulation, have under the situation of a plurality of nodes, can select one of them at random as current parent's node; Also can choose according to the mode of rotating, for example, according to the position of node in tabulation, get first node in the tabulation for the first time, get second node in the tabulation for the second time, the rest may be inferred.

Step 204: judge whether the response message of receiving that current parent's node returns, if receive, then execution in step 205, otherwise execution in step 206.

Because wireless self-organization network often is applied in the environment complicated and changeable, big variation may take place in its wireless channel conditions at any time, and is unavailable even.Therefore, after father node receives the data of child node transmission, need send response, receive the data that child node sends to inform child node to child node.

Step 205: finish current flow process.

If receive the response message that father node returns, illustrate that data send successfully, then child node finishes this secondary data transmission flow.

Step 206: judge whether to arrive response and wait for duration, if execution in step 207 then, otherwise return execution in step 204.

Described response waits for that duration is to set in advance before node enters site of deployment.

Step 207: with current parent's vertex ticks is invalid.

If in described wait duration, do not receive the response message that current parent's node returns, illustrate that this father node lost efficacy, perhaps and the channel between the father node unavailable, therefore can't continue with this father node is that relaying sends data to group leader's node.

Step 208: it is invalid to judge whether all nodes in the father node tabulation all are marked as, if execution in step 209 then, otherwise return execution in step 203.

Step 209: empty the father node tabulation, send the reorganization request message.

Because it is invalid that all nodes in the father node tabulation all are marked as, other group member's nodes that not can be used as relaying around group member's node be describeds, so group member's node need attempt seeking new father node as relaying, or perhaps attempt adding group again.Described reorganization request message sends with the form of broadcasting, comprises the node identification of group member's node self at least.

Step 210: judge whether to receive invitation message, if receive, then execution in step 213, otherwise execution in step 211.

Step 211: judge whether to surpass to repair and wait for duration, if surpass, then execution in step 212, otherwise return execution in step 210.

Described reparation waits for that duration set in advance before node enters site of deployment.

Step 212: finish current flow process, enter wait state, wait for that next network sets up process.

In the back in the description of Fig. 3 as can be seen, group member's node or group leader's node can send invitation message after receiving described reorganization request message.If send group member's node of reorganization request message, in waiting for duration, described reparation do not receive invitation message, illustrate and seek the new i.e. trial failure of adding group again of father node as relaying.This node can only wait for that next network sets up process.

Step 213: select to send in the node of invitation message, the node of relative distance minimum is as the father node of self, and upgrades the relative distance of self, sends data to new father node then.

In the back in the description of Fig. 3 as can be seen, described invitation message comprises node identification and the relative distance of sending invitation message.Many invitation message have been received if send the node of described reorganization request message, then according to the principle of selecting nearest path and group leader's node communication, the node of relative distance minimum adds in the father node tabulation as the father node of oneself in the node of selection transmission invitation message; And the relative distance of described minimum is added the relative distance of 1 back as self.Like this, the node that sends described reorganization request message has just added in the group again, can send data to new father node.If it is a plurality of that the node of said here relative distance minimum has, the node that then sends described reorganization request message all adds it in the father node tabulation of self.

As a kind of replacement scheme, can in step 209, not empty the father node tabulation yet, but in step 213, replace existing father node tabulation with new father node sign, promptly at first the father node tabulation is emptied, then new father node sign is added in the father node tabulation.

Please refer to Fig. 3, Fig. 3 is the flow chart of wireless self-organization network method of work provided by the invention.When network work, the node in the network is when receiving the reorganization request message that other nodes send, and this method comprises:

Step 301: receive the reorganization request message.

Step 302: judge that whether described reorganization request message is sent by the father node of self, if execution in step 305 then, otherwise execution in step 303.

Step 303: judge whether self is in wait state, if execution in step 308 then, otherwise execution in step 304.

The described judgement of step 302 and step 303 does not have strict sequencing requirement.That is to say to judge self whether to be in wait state earlier; If be not in wait state, continue then to judge that whether described reorganization request message is sent by the father node of self; Send if described reorganization request message is the father node of self, then execution in step 305, otherwise execution in step 304.

Step 304: send invitation message, carry relative distance of self and the sign of self, finish current flow process.

Certainly, according in the described reason of step 109, node can judge earlier also whether the relative distance of self surpasses the relay point restriction that sets in advance, and only the relative distance at self surpasses under the situation of the relay point restriction that sets in advance, and just sends invitation message.

Step 302, step 303 and judgement described herein can be referred to as and not judged whether and can provide relaying for the node of attempting adding again group.

Step 305: the father node of reorganization request message is sent in deletion from the father node tabulation of self.

Send if the reorganization request message that node is received is the father node by node, illustrate that this father node self all can't communicate with group leader's node, so node can't continue to send data communication by this father node to group leader's node.

Described reorganization request message carries the node identification that sends node, therefore receive the node of reorganization request message, the node identification of preserving in the tabulation of the node identification that carries of this message and the father node of self relatively, just can judge that whether described reorganization request message is sent by the father node of self, and further from the father node tabulation of self deletion send the father node of reorganization request message.

Step 306: whether the father node tabulation of judging self is empty, if be empty, then execution in step 307, otherwise execution in step 308.

Step 307: send the reorganization request message, in fact node has entered step 210 in the flow process of step 213.

As a kind of replacement scheme, can set in advance a buffering duration.Node is in execution in step 306 described judgements, and the father node tabulation of finding self postpones to send the request message of recombinating again behind the described buffering duration for behind the sky.The purpose of doing like this is, send the father node of the message of reorganization described in the step 301, might in described buffering duration, finish the process of adding group again, like this, after node sent the described reorganization request message of step 307, this father node just can send invitation message.

In addition, also not execution in step 306 and step 307.Because if the tabulation of the father node of node is for empty, then this node also will inevitably enter into the flow process of step 210 to step 213 when sending data.

Step 308: finish current flow process.

According to the Fig. 2 and the described course of work of Fig. 3, group member's node is sending in the process of data to group leader's node, can select an effective father node as relaying from the father node tabulation of self preserving; If all father nodes are all invalid, perhaps the father node tabulation is for empty, and node can also be attempted seeking the new father node as relaying by sending the reorganization request message, promptly attempts adding group again.On the other hand, attempting adding again group, can send invitation message to the node of attempting adding group again, for it provides relaying if the node of operate as normal is found contiguous node.Like this, when the residing applied environment of network changes, perhaps in the network life later stage, part node lost efficacy in succession, when perhaps causing some node failure owing to accident, the structure of adaptive adjustment network is to continue to keep the connectedness of network, thereby improved stability of network, prolonged the life-span of network.

In a word, the above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (27)

1, a kind of method for building up of wireless self-organization network, it is characterized in that, described wireless self-organization network is two layers of wireless self-organization network, and the father node tabulation is set on radio self-organized network nodes, when setting up, wireless self-organization network at first determines group leader's node, carry the upright message of establishment of self node identification by group leader's node broadcasts, other nodes in the wireless self-organization network except that group leader's node add in the group of being set up by group leader's node according to the upright message of the establishment of being received after receiving the upright message of establishment.

2, the method for building up of wireless self-organization network according to claim 1 is characterized in that, preestablishes the cycle of changing group leader's node, and best group leader's probability, and described definite group leader's node is:

When one-period begins, periodicity that each node has been worked according to best group leader's probability, node and the periodicity of serving as group member's node continuously, basis of calculation probability, and serve as group leader's node with the standard probability.

3, the method for building up of wireless self-organization network according to claim 2 is characterized in that, described setting is changed best group leader's probability and is:

According to following formula calculating optimum group leader probability:

$p=[\frac{1}{3c}+\frac{\sqrt[3]{2}}{3c\×{(2+27c^2+3\sqrt{3}c\×\sqrt{27c^2+4})}^{\frac{1}{3}}}+\frac{1}{\sqrt[3]{2}}\frac{{(2+27c^2+3\sqrt{3}c\×\sqrt{27c^2+4})}^{\frac{1}{3}}}{3c}{]}^2$

Wherein, $c=3\frac{d^4\×e_{\mathrm{mp}}+E_{\mathrm{elec}}}{2\sqrt{2E_{\mathrm{elec}}\×e_{\mathrm{fs}}}}\×\sqrt{\mathrm{\λ}}$ , d represents all internodal average distances in base station and the network, E _ElecIndication circuit energy consumption parameter, e _FsExpression free space model amplifier energy consumption parameter, e _MpExpression multichannel attenuation model amplifier energy consumption parameter, λ is the parameter of wireless ad hoc network node two dimension Poisson distribution.

4, the method for building up of wireless self-organization network according to claim 2 is characterized in that, described each node is according to best group leader's probability, periodicity that node has been worked and the periodicity of serving as group member's node continuously, and basis of calculation probability is:

Judge serve as group member's node continuously periodicity whether less than If, less than then the standard probability of order is 0, otherwise calculate described standard probability according to following formula:

$\frac{p}{1-p\×\mathrm{round}\mathrm{mod}\left(\frac{1}{p}\right)}$

Wherein round represents the periodicity that node has been worked, and p represents described best group leader's probability.

5, the method for building up of wireless self-organization network according to claim 2 is characterized in that, describedly serves as group leader's node with the standard probability and is:

Between 0 to 1, generate a random number, and whether the random number that is relatively generated is less than described standard probability, if less than at the interim group leader's node of serving as this week, otherwise at the interim group member's node of serving as this week,

6, the method for building up of wireless self-organization network according to claim 1 is characterized in that, described other nodes except that group leader's node are after receiving the upright message of establishment, according to comprising in the group of the upright message adding of the establishment of being received by the foundation of group leader's node:

A1, according to the upright message of the establishment that receives, judge whether to need to revise the father node tabulation of self, if desired, execution in step B1 then, otherwise finish current flow process;

B1, according to the upright message of the establishment that receives, the upright message of establishment that judges whether to need broadcasting to transmit and receive, if desired, execution in step C1 then, otherwise, the node identification that carries in the upright message of the establishment of being received is added in the father node tabulation of self, finish current flow process then;

C1, empty self father node tabulation, then the father node sign in the upright message of the establishment of being received is added in the father node tabulation of self, and the relative distance of self is set according to the upright message of the establishment that receives;

The node identification of self and the upright message of establishment of relative distance are carried in D1, broadcasting.

7, the method for building up of wireless self-organization network according to claim 6 is characterized in that, the upright message of establishment that described group leader's node broadcasts is carried self node identification is:

Group leader's node in the upright message of the establishment of being broadcasted further the value of carrying be 0 relative distance.

8, the method for building up of wireless self-organization network according to claim 6 is characterized in that, other nodes in the wireless self-organization network except that group leader's node further comprised before steps A 1 after receiving the upright message of establishment:

Judge whether the upright message of the establishment of being received carries relative distance, if do not carry, then making the relative distance of the node that sends the upright message of described establishment is 0.

According to the method for building up of claim 7 or 8 described wireless self-organization networks, it is characterized in that 9, message is found in the establishment that steps A 1 described basis receives, judge whether that the father node tabulation that needs to revise self is:

Judge the relative distance of the father node of self,,, otherwise think and do not need to revise the father node tabulation of self if then thinking needs to revise the father node tabulation of self whether more than or equal to the relative distance of the node that sends the upright message of described establishment;

Message is found in the establishment that the described basis of step B1 receives, and judges whether that the upright message of the establishment that needs the broadcasting forwarding to receive is:

Judge the relative distance of the father node of self, whether greater than the relative distance of the node that sends the upright message of described establishment, if greater than, then think the upright message of establishment that needs broadcasting to transmit to receive, otherwise think not need to broadcast and transmit the upright message of the establishment that receives.

10, the method for building up of wireless self-organization network according to claim 6 is characterized in that, step B1 further comprised before the described node identification that the establishment of being received is carried in the upright message adds in self the father node tabulation:

Judge that whether Already in the node identification that to carry in the upright message of the establishment received in self the father node tabulation, if exist, then finish current flow process, otherwise the node identification that carries in the upright message of the establishment of being received is added in the father node tabulation of self.

11, the method for building up of wireless self-organization network according to claim 6 is characterized in that, the relative distance that the upright message of the establishment that the described basis of step C1 receives is provided with self is:

Relative distance in the upright message of the establishment that receives is added the relative distance of 1 back as self.

12, the method for building up of wireless self-organization network according to claim 6 is characterized in that, sets in advance the relay point restriction, further comprises between step C1 and the step D1:

Whether the relative distance of judging self surpasses the relay point restriction, if, then finish current flow process, otherwise execution in step D1.

13, the method for building up of wireless self-organization network according to claim 1 is characterized in that, described wireless self-organization network is a wireless sensor network.

14, a kind of method of work of wireless self-organization network, it is characterized in that, this wireless self-organization network is two layers of wireless self-organization network, the father node tabulation is set on group member's node, the via node sign that can adopt when communicating by letter with group leader in order to be kept at, when father node sent data, this method comprised at group member's node:

A2, judge whether can be successfully arbitrary node in the father node tabulation send data, if can successfully send, then finish current flow process, otherwise execution in step B2;

B2, transmission reorganization request message are to attempt seeking new father node, and judge whether to receive invitation message, if receive then replace self father node tabulation with the node identification that sends invitation message, otherwise the state of self is set to wait for, finishes current flow process.

15, the method for work of wireless self-organization network according to claim 14 is characterized in that, this method further comprises:

C2, when group member's node is received reorganization request message except that other node self, judging whether to provide relaying for the node that sends the reorganization request message, if can, then send invitation message, otherwise finish current flow process to the node that sends the reorganization request message.

16, the method for work of wireless self-organization network according to claim 14 is characterized in that, sets in advance response and waits for duration, and steps A 2 is described to be judged whether that successfully the arbitrary node in the father node tabulation sends data and comprise:

A21, with all nodes of record in the father node tabulation as effective father node;

A22, from effective father node, select one as current parent's node, send data and pick up counting to current parent's node, judge then and in duration is waited in described response, whether receive the response message that current parent's node sends, if receive, think that then successfully the arbitrary node in the father node tabulation sends data, otherwise execution in step A23;

A23, be invalid, and it is invalid to judge whether in the father node tabulation that all nodes all have been labeled as, if think that then successfully the arbitrary node in the father node tabulation sends data, otherwise return execution in step A22 with current parent's vertex ticks.

17, the method for work of wireless self-organization network according to claim 14 is characterized in that, sets in advance to repair to wait for duration, and step B2 is described to judge whether to receive that invitation message is:

Whether judgement receives invitation message from sending the reorganization request message in repairing the wait duration.

18, the method for work of wireless self-organization network according to claim 14, it is characterized in that, described invitation message is carried node identification and the relative distance of sending invitation message, and the father node tabulation that the described node identification with the transmission invitation message of step B2 is replaced self comprises:

B21, will send in the node of invitation message, the node of relative distance minimum is as new father node;

B22, empty father node tabulation, new father node sign is added in the father node tabulation.

B23, the relative distance of carrying in the invitation message is added 1 back as self relative distance.

19, the method for work of wireless self-organization network according to claim 15, it is characterized in that, described reorganization request message carries the node identification that sends the reorganization request message, and described the judging whether of step C2 can provide relaying to be for the node that sends the reorganization request message:

C21, the node identification that carries in the request message according to reorganization, judge whether the node that sends the reorganization request message is the father node of self, if, then delete the node that sends the reorganization request message in uncle's node listing, and thinking to provide relaying for the node that sends the reorganization request message, if not, execution in step C22 then;

C22, judge whether self is in wait state,, otherwise think and to provide relaying for the node that sends the reorganization request message if then thinking to provide relaying for the node that sends the reorganization request message.

20, the method for work of wireless self-organization network according to claim 19 is characterized in that, sets in advance the relay point restriction, in step C22, when node is not in wait state, further comprises:

Whether the relative distance of judging self surpass the relaying restriction of counting, if surpass, then thinking to provide relaying for the node that sends the reorganization request message, otherwise thinks and can provide relaying for the node that sends the request message of recombinating.

21, the method for work of wireless self-organization network according to claim 19 is characterized in that, in step C21, after the node of reorganization request message is sent in deletion in uncle's node listing, further comprises:

Whether the father node tabulation of judging self is empty, if be sky, and execution in step B2 then, otherwise finish current flow process.

22, the method for work of wireless self-organization network according to claim 21 is characterized in that, sets in advance the buffering duration, describedly at father node tabulation execution in step B2 when empty is:

Pick up counting execution in step B2 after arriving the wait duration for sky from judging tabulation.

23, the method for building up of wireless self-organization network according to claim 14 is characterized in that, described wireless self-organization network is a wireless sensor network.

24, a kind of method of work of wireless self-organization network, it is characterized in that, this wireless self-organization network is two layers of wireless self-organization network, the father node tabulation is set on group member's node, the via node sign that can adopt when communicating by letter with group leader in order to be kept at, the node of group member's node in the tabulation of self father node sent the reorganization request message when all losing efficacy, and when other nodes were received the reorganization request message, this method comprised:

A3, judge whether and can provide relaying for the node that sends the reorganization request message, if can, then send invitation message, otherwise finish current flow process to the node that sends the reorganization request message.

25, the method for work of wireless self-organization network according to claim 24, it is characterized in that, described reorganization request message carries the node identification that sends the reorganization request message, and steps A 3 described judging whether can provide relaying to comprise for the node that sends the reorganization request message:

A31, the node identification that carries in the request message according to reorganization, judge whether the node that sends the reorganization request message is the father node of self, if, then delete the node that sends the reorganization request message in uncle's node listing, and thinking to provide relaying for the node that sends the reorganization request message, if not, execution in step A32 then;

A32, judge whether self is in wait state,, otherwise think and to provide relaying for the node that sends the reorganization request message if then thinking to provide relaying for the node that sends the reorganization request message.

26, the method for work of wireless self-organization network according to claim 25 is characterized in that, sets in advance the relay point restriction, in steps A 32, when node is not in wait state, further comprises:

Whether the relative distance of judging self surpass the relaying restriction of counting, if surpass, then thinking to provide relaying for the node that sends the reorganization request message, otherwise thinks and can provide relaying for the node that sends the request message of recombinating.

27, the method for building up of wireless self-organization network according to claim 24 is characterized in that, described wireless self-organization network is a wireless sensor network.

Images