CN103281746A - Wireless sensing network routing method of quotient topology energy hierarchical dynamic programming - Google Patents

Abstract

A wireless sensing network routing method of quotient topology energy hierarchical dynamic programming comprises the steps that the first round of the network lifecycle is divided into quotient sets according to geographical attributes of sensing network nodes, alternative partition schemes are obtained, the best first layer of virtual clusters are found through competition, and cluster heads are recorded. The best sub-clusters of the first layer of the virtual clusters are found through the same method, the stratified hierarchy is conducted according to the method until all the clusters cannot be parted any more. The last layer of the clusters are final effective clusters, and all the cluster head nodes form multiple hop transmission paths through father cluster head nodes step by step. Starting from the second round, whether whole energy of all partition nodes in the first layer of the upper round is out of balance is judged, if the balance is lost, clustering routing is constructed again through the same method of the first round; if the balance exists, partition is reserved and new cluster heads are selected; whether a next layer of clusters with the same father cluster is balanced is judged, then the same method of the first layer is adopted to conduct recursion processing until the bottom layer of the clusters are formed, and new routing is constructed. The wireless sensing network routing method of the quotient topology energy hierarchical dynamic programming can construct high-efficiency low-consumption routes, and prolongs the lifecycle of a network.

Description

A kind of quotient topology energy is passed the wireless sense network route method of rank Dynamic Programming

Technical field

The present invention relates to the sensing network routing algorithm, be specifically related to a kind of wireless sense network route method of passing the rank game based on energy under the quotient topology of geographical position.

Background technology

In research and practice process to the method, the present inventor finds: the WSN(wireless sense network) by disposing wireless sensor nodes in a large number in specific monitored area, by gathering the information of perceived object in the specific wireless sensing network overlay area, communication by single-hop or multi-hop, data message after collecting and handling is offered terminal use .WSN do not need infrastructure and the network support fixed, has quick deployment, characteristics such as survivability is strong, can be widely used in military surveillance, environmental monitoring, medical monitoring, agricultural breeding and other commercial fields, and space exploration and disaster special dimension such as speedily carry out rescue work.The high usage route agreement research of WSN is one of the research emphasis in this field always in recent years.

Clustering route protocol is route-type important among the WSN, in clustering route protocol, network is divided into bunch (cluster) usually. and so-called bunch, having certain related set of network nodes exactly. each bunch is made up of member (cluster member) in a bunch of head (cluster head) and a plurality of bunches, the member is by a bunch sink information in bunch, by bunch head communicate by letter with base station BS (base station) the sub-clustering routing mechanism have following advantage (1) the member node most of the time can the communication close module, by bunch head constitute one more the connected network of last layer be responsible for the length of data apart from routing forwarding. so both guaranteed the data communication in original coverage, also saved network energy to a great extent; (2) bunch head is transmitted after having merged the data of member node again, has reduced data traffic, thereby has saved network energy; (3) function of member node is fairly simple, need not safeguard complicated routing iinformation. this has significantly reduced the quantity of route control information in the network, reduced the traffic: (4) sub-clustering topological structure is convenient to management, be conducive to the application of distributed algorithm, can make fast reaction to system change, have extensibility preferably, be fit to large scale network: (5) and plane road be by comparing, and overcomes sensor node and move the problem of bringing easilier.One of difficult point of current main sub-clustering technology is that difficulty is taken into account energy and consumed harmonious and geographical distribution harmony.

In topology and relevant art of mathematics thereof, some points that a quotient space (quotient space is also referred to as identification space identification space) is said so intuitively with a given space are equal to or " sticking together "; Determine that by an equivalence relation which point is equal to.This is the common methods from the new space of given spatial configuration.By to initial data manifold structure or induce the varigrained quotient topological space, quotient space theory is exactly the relation of studying between each quotient topological space, comprise synthetic, comprehensive, decompose the theory with problem reasoning in the different quotient spaces.

Summary of the invention

Purpose of the present invention: a kind of wireless sense network route method that obtains by the laddering energy game of layering strategy between the diverse geographic location quotient topology is provided.This method can be taken all factors into consideration energy and the geographical distribution characteristic of WSN node, and all node energies of efficient balance consume, and prolong network life cycle.

The solution of the present invention: the quotient set that induces different levels according to the sensing net node geographical attribute is divided (being sub-clustering), simultaneously regulation with bunch each submanifold in the node radix identical.The thought of passing rank by layering is carried out between different levels sub-clustering node the energy game and need to be determined whether to divide (being sub-sub-clustering) and optimal dividing how.After in the end obtaining final effectively sub-clustering, its each leader cluster node is by constituting the multi-hop transmission path to guarantee that each bunch information can the more effective Sink of being sent to each self-recording father's bunch leader cluster node step by step.Whether taking turns each that at first judge last round of ground floor from second, to divide between node integral energy unbalance.Then call the first round as disequilibrium and make the sub-clustering route with quadrat method reconstruct.If balance then keep is divided and selected new bunch of head, further judge down one deck then with each bunch of father balance whether, and take ground floor the same manner recurrence to handle until forming the bottom sub-clustering, constructing new route.Technical solution of the present invention can be taken all factors into consideration energy and the balanced sub-clustering route of geographical distribution characteristic structure sense network energy of WSN node, effectively prolongs network lifecycle.

Concrete steps of the present invention are as follows:

1, according to the region attribute of a relation wireless sensing net topology Wsn is induced N kind alternate divisions scheme, the step that to specify every kind of alternate divisions be k small grain size submanifold is:

(a) node is in case dispose and just no longer to change its geographical position, and the base station records node distributed intelligences such as the dump energy of each node and geographical indicator;

(b) by selected geographical distribution attribute, as certain height above sea level, or certain horizontal longitude and latitude, it is Wsn that Wsn is divided into K equivalence class node submanifold ₁', Wsn ₂' ... Wsn _k';

(c) selected different geographical distribution attribute repeats N execution in step b and obtains N kind alternate divisions scheme;

2, this N alternate divisions being carried out the competition that energy balance and energy are estimated consumption, is Wsn as obtaining namely optimum next the straton sub-clustering of optimal dividing ₁', Wsn ₂' ... Wsn _k', then enter the following step 3; Otherwise this wireless sense network Wsn originally as final effective bunch, then enters the following step 4, concrete steps:

(a) select one of alternate divisions;

(b) in K sub-sub-clustering, each sub-sub-clustering is selected some optimums bunch head and predicted minimal energy consumption value Consume (Wsn_ based on these bunches head by calculating _i') wherein i ∈ 1,2 ... k};

(c) aggregation step b obtains k energy predicting consumption Compare with the father bunch prediction energy Consume (Wsn) that need consume, as shown in the formula dividing the post consumption energy shown in (1) and then cancelling this division more than or equal to consumption before dividing, as consuming as shown in the formula thinking then shown in (2) that this division effectively is alternate divisions less than before dividing;

$\mathrm{Consume}\left(\mathrm{Wsn}\right)\≤\underset{i=1}{\overset{k}{\mathrm{\Σ}}}\mathrm{Consume}\left(\mathrm{Ws}{n_i}^{\′}\right)\·\·\·\left(1\right)$

$\mathrm{Consume}\left(\mathrm{Wsn}\right)>\underset{i=1}{\overset{k}{\mathrm{\Σ}}}\mathrm{Consume}\left(\mathrm{Ws}{n_i}^{\′}\right)\·\·\·\left(2\right)$

(d) repeating step a to step c as do not obtain any alternate divisions then this father bunch basis as final effective bunch and enter step 4, if m alternate divisions arranged then enter next step e;

(e) calculate the sub-cluster knot point dump energy Energe (Wsn of K separately of m alternate divisions respectively ₁') wherein i ∈ 1,2 ..., k}

And balanced degree $\mathrm{Balance}(\mathrm{<figure-callout\; id="1"\; label="Ws\; n"\; filenames="130530144134.png,130530144137.png"\; state="\{\{state\}\}">Ws</figure-callout>}{n_{}}^{}{{}_1}^{\&prime;},\mathrm{Ws}{n_2}^{\&prime;},\&CenterDot;\&CenterDot;\&CenterDot;\mathrm{Ws}{n_k}^{\&prime;})=$

${\mathrm{Log}}_{\frac{1}{e}}\frac{\mathrm{Max}\{\mathrm{Energe}\left(\mathrm{Ws}{{\mathrm{<figure-callout\; id="1"\; label="n"\; filenames="130530144134.png,130530144137.png"\; state="\{\{state\}\}">n</figure-callout>}}_1}^{\&prime;}\right),\mathrm{Energe}\left(\mathrm{Ws}{\mathrm{<figure-callout\; id="2"\; label="n"\; filenames="130530144134.png,130530152449.png"\; state="\{\{state\}\}">n</figure-callout>}2}^{\&prime;}\right),\&CenterDot;\&CenterDot;\&CenterDot;\mathrm{Energe}\left(\mathrm{Ws}{n_k}^{\&prime;}\right)\}-\mathrm{Min}\{\mathrm{Energe}\left(\mathrm{Ws}{{\mathrm{<figure-callout\; id="1"\; label="n"\; filenames="130530144134.png,130530144137.png"\; state="\{\{state\}\}">n</figure-callout>}}_1}^{\&prime;}\right),\mathrm{Energe}\left(\mathrm{Wsn}{2}^{\&prime;}\right),\&CenterDot;\&CenterDot;\&CenterDot;\mathrm{Energe}\left(\mathrm{Ws}{n_k}^{\&prime;}\right)\}}{\mathrm{Min}\{\mathrm{Energe}\left(\mathrm{Ws}{n_1}^{\&prime;}\right),\mathrm{Energe}\left(\mathrm{Wsn}{2}^{\&prime;}\right),\&CenterDot;\&CenterDot;\&CenterDot;\mathrm{Energe}\left(\mathrm{Ws}{n_k}^{\&prime;}\right)\}}$

(f) take all factors into consideration the energy balance degree Balance () of each alternate divisions and the consumed energy of prediction and reduce degree Save (), select optimum sub-clustering.The consumed energy minimizing degree of prediction and discriminant function are as shown in the formula (3) and formula (4).

$\mathrm{Save}(\mathrm{Ws}{{\mathrm{<figure-callout\; id="1"\; label="n"\; filenames="130530144134.png,130530144137.png"\; state="\{\{state\}\}">n</figure-callout>}}_1}^{\&prime;},\mathrm{<figure-callout\; id="2"\; label="Ws\; n"\; filenames="130530144134.png,130530152449.png"\; state="\{\{state\}\}">Ws</figure-callout>}{n_{}}^{}{{}_2}^{\&prime;},...\mathrm{Ws}{n_k}^{\&prime;})={\mathrm{Log}}_{1/e}\frac{\mathrm{Consume}\left(\mathrm{Wsn}\right)-{\mathrm{\&Sigma;}}_{i=1}^k\mathrm{consume}\left(\mathrm{Ws}{n_i}^{\&prime;}\right)}{{\mathrm{\&Sigma;}}_{i=1}^k\mathrm{consume}\left(\mathrm{Ws}{n_i}^{\&prime;}\right)}\&CenterDot;\&CenterDot;\&CenterDot;\left(3\right)$

α?Save（Wsn ₁’，Wsn ₂’，…Wsn _k’）+β?Banance（Wsn ₁’，Wsn ₂’，…Wsn _k’）………（4）

Annotating α and β is adjustable parameter

3, for selected this K submanifold, it is as follows to enter step 1 step respectively:

(a) for this K selected submanifold Wsn ₁', Wsn ₂' ... Wsn _k', extract wherein any one Wsn _i', i ∈ { 1,2 ... k}

(b) Wsn _i' enter step 1. as following relatively independent sub-Wsn of one deck

(c) all the other K-1 submanifold also enters step a and b respectively and carries out next level and divide;

4, determine all final effective bunch after, member's distribution T DMA timetable in effective bunch leader cluster node is given bunch

(a) Sink node broadcasts notice corresponding node who be members in bunch head and father at different levels bunch head and who are bunch;

(b) each effective sub-clustering bunch head according to bunch in member node add up to it and distribute time slot, and broadcasting, ordinary node namely can transmit an information to bunch head in the time of distributing afterwards;

5, a bunch head is collected this bunch information, is implemented to the multi-hop transmission of Sink node by its father's in the cluster process bunch leader cluster node;

(a) after the information that leader cluster node has been collected this bunch ordinary node neat and sent, carry out data fusion;

(b) leader cluster node is received data father's bunch leader cluster node and is sent the Sink node step by step back to;

Annotate: the father bunch is not final effectively sub-clustering, excessive bunch of just producing in the clustering process;

6, enter and judge earlier the last round of ground floor division that whether exists after the next round;

A) according on take turns the whole Wsn of historical record and whether have the effective K of ground floor equivalence class node submanifold { Wsn ₁', Wsn ₂' ... Wsn _k' divide;

7, as just not dividing directly change bunch head, as final effective bunch; And enter step 4;

If a) not do not divide then think that Wsn is the final effectively sub-clustering of epicycle, more renews bunch head and enters step 4;

8, just to investigate these be that virtual whether integral energy is unbalance with younger brother's father and elder brothers sub-clustering as exist dividing;

A) be Wsn with younger brother's father and elder brothers sub-clustering a bit as existing division just to investigate these k according to formula 3 ₁', Wsn ₂' ... Wsn _k' whether integral energy is unbalance;

If 9 integral energies also keep balance, whether each bunch of investigating balance again exists lower floor to divide separately, and enters step 7;

If a) integral energy also keeps balance then investigates each bunch of balance successively

, Wsn ₂' ... Wsn _k'

B) determine Wsn _i' do not exist lower floor to divide, and with Wsn _i' remember and make Wsn and enter step 7;

If 10 integral energies are balance then more renew bunch head and enter step 1 no longer;

If a) integral energy does not keep balance then changes bunch head of Wsn;

B) will change the Wsn substitution step 1 of new bunch of head;

11, repeating step 1 exhausts until all node energies to step 10.

Beneficial effect of the present invention: this method can be taken all factors into consideration energy and the geographical distribution characteristic of WSN node, and all node energies of efficient balance consume, and prolong network life cycle.

Description of drawings

Fig. 1 is a typical sensors network diagram of the present invention;

Among the figure: 1, Sink node 2, bunch and bunch member 3, monitored area;

Fig. 2 induces the schematic diagram of N kind alternate divisions for wireless sensing net topology of the present invention;

Among the figure: 1, alternate divisions;

The every flow chart of taking turns of Fig. 3 the present invention;

Fig. 4 multi-hop data transmission of the present invention schematic diagram;

Among the figure: 1 base station (Skin node), 2 bunches, 3 bunches heads, 4, bunch member.

Embodiment

Shown in Fig. 1,2,3,4, be described as follows:

(establish with k=2, N=8 is example)

1) according to the region attribute of a relation wireless sensing net topology Wsn is induced N kind alternate divisions scheme, the step that to specify every kind of alternate divisions be two small grain size submanifolds is:

(a) node is in case dispose and just no longer to change its geographical position, and the base station records node distributed intelligences such as the dump energy of each node and geographical indicator.

(b) by a selected geographical distribution attribute (as certain height above sea level, or certain horizontal longitude and latitude) Wsn is divided into 2 equivalence class node submanifold { Wsn ₁', Wsn ₂'.

(c) selected different geographical distribution attribute repeats 8 execution in step b and obtains 8 kinds of alternate divisions schemes.

2) an above-mentioned N alternate divisions is carried out the competition that energy balance and energy are estimated consumption, as obtain optimal dividing (namely optimum next straton sub-clustering Wsn1 ', Wsn2 '), then enter the following step 3, otherwise this wireless sense network Wsn is originally as final effective bunch, then enter the following step 4, concrete steps:

(a) select one of alternate divisions.

(b) in 2 sub-sub-clusterings, each sub-sub-clustering is selected some optimums bunch head and predicted the minimal energy consumption value based on these bunches head by calculating.

I ∈ { 1,2} wherein.

(c) 2 energy predicting consumption of aggregation step b acquisition are closed

With father's bunch prediction energy that (not dividing) needs consume

Compare, as shown in the formula dividing the post consumption energy shown in (1) and then cancelling this division more than or equal to consumption before dividing, as consuming as shown in the formula thinking then shown in (2) that this division effectively is alternate divisions less than before dividing.

$\mathrm{Consume}\left(\mathrm{Wsn}\right)\&le;\underset{i=1}{\overset{2}{\mathrm{\&Sigma;}}}\mathrm{Consume}\left(\mathrm{Ws}{n_i}^{\&prime;}\right)\&CenterDot;\&CenterDot;\&CenterDot;\left(1\right)$

$\mathrm{Consume}\left(\mathrm{Wsn}\right)>\underset{i=1}{\overset{2}{\mathrm{\&Sigma;}}}\mathrm{Consume}\left(\mathrm{Ws}{n_i}^{\&prime;}\right)\&CenterDot;\&CenterDot;\&CenterDot;\left(2\right)$

(d) repeating step a to step c as do not obtain any alternate divisions then this father bunch basis as final effective bunch and enter step 4, if m alternate divisions arranged then enter next step e.

(e) calculate 2 sub-cluster knot point dump energy Energe (Wsn separately of m alternate divisions respectively ₁') i ∈ { 1,2} wherein

And balanced degree $\mathrm{Balance}(\mathrm{<figure-callout\; id="1"\; label="Ws\; n"\; filenames="130530144134.png,130530144137.png"\; state="\{\{state\}\}">Ws</figure-callout>}{n_{}}^{}{{}_1}^{\&prime;},\mathrm{<figure-callout\; id="2"\; label="Ws\; n"\; filenames="130530144134.png,130530152449.png"\; state="\{\{state\}\}">Ws</figure-callout>}{n_{}}^{}{{}_2}^{\&prime;})=$

${\mathrm{Log}}_{\frac{1}{e}}\frac{\mathrm{Max}\{\mathrm{Energe}\left(\mathrm{<figure-callout\; id="1"\; label="Ws\; n"\; filenames="130530144134.png,130530144137.png"\; state="\{\{state\}\}">Ws</figure-callout>}{n_{}}^{}{{}_1}^{\&prime;}\right),\mathrm{Energe}\left(\mathrm{<figure-callout\; id="2"\; label="Ws\; n"\; filenames="130530144134.png,130530152449.png"\; state="\{\{state\}\}">Ws</figure-callout>}{n}^{}{2}^{\&prime;}\right)\}-\mathrm{Min}\{\mathrm{Energe}\left(\mathrm{<figure-callout\; id="1"\; label="Ws\; n"\; filenames="130530144134.png,130530144137.png"\; state="\{\{state\}\}">Ws</figure-callout>}{n_{}}^{}{{}_1}^{\&prime;}\right),\mathrm{Energe}\left(\mathrm{<figure-callout\; id="2"\; label="Wsn"\; filenames="130530144134.png,130530152449.png"\; state="\{\{state\}\}">Wsn</figure-callout>}{2}^{\&prime;}\right)\}}{\mathrm{Min}\{\mathrm{Energe}\left(\mathrm{<figure-callout\; id="1"\; label="Ws\; n"\; filenames="130530144134.png,130530144137.png"\; state="\{\{state\}\}">Ws</figure-callout>}{n_{}}^{}{{}_1}^{\&prime;}\right),\mathrm{Energe}\left(\mathrm{<figure-callout\; id="2"\; label="Wsn"\; filenames="130530144134.png,130530152449.png"\; state="\{\{state\}\}">Wsn</figure-callout>}{2}^{\&prime;}\right)\}}$

(f) take all factors into consideration the energy balance degree Balance () of each alternate divisions and the consumed energy of prediction and reduce degree Save (), select optimum sub-clustering.The consumed energy of prediction reduces degree and discriminant function as shown in the formula 3 and formula 4.

$\mathrm{Save}(\mathrm{<figure-callout\; id="1"\; label="Ws\; n"\; filenames="130530144134.png,130530144137.png"\; state="\{\{state\}\}">Ws</figure-callout>}{n_{}}^{}{{}_1}^{\&prime;},\mathrm{<figure-callout\; id="2"\; label="Ws\; n"\; filenames="130530144134.png,130530152449.png"\; state="\{\{state\}\}">Ws</figure-callout>}{n_{}}^{}{{}_2}^{\&prime;})={\mathrm{<figure-callout\; id="1"\; label="Log"\; filenames="130530144134.png,130530144137.png"\; state="\{\{state\}\}">Log</figure-callout>}}_{1/e}\frac{\mathrm{Consume}\left(\mathrm{Wsn}\right)-{\mathrm{\&Sigma;}}_{i=1}^2\mathrm{consume}\left(\mathrm{Ws}{n_i}^{\&prime;}\right)}{{\mathrm{\&Sigma;}}_{i=1}^2\mathrm{consume}\left(\mathrm{Ws}{n_i}^{\&prime;}\right)}\&CenterDot;\&CenterDot;\&CenterDot;\left(3\right)$

α?Save（Wsn ₁’，Wsn ₂’）+β?Banance（Wsn ₁’，Wsn ₂’）………（4）

Annotating α and β is adjustable parameter

3) for selected this K submanifold, it is as follows to enter step 1 step respectively:

(a) for these selected 2 submanifold Wsn ₁', Wsn ₂', extract wherein any one Wsn _i',

(b) Wsn _i' enter step 1. as following relatively independent sub-Wsn of one deck

(c) in addition 1 submanifold also enters step a and b and carries out next level and divide.

4) determine all final effective bunch after, member's distribution T DMA timetable in effective bunch leader cluster node is given bunch

(a) Sink node broadcasts notice corresponding node who be members in bunch head and father at different levels bunch head and who are bunch.

(b) each effective sub-clustering bunch head according to bunch in member node add up to it and distribute time slot, and broadcasting, ordinary node namely can transmit an information to bunch head in the time of distributing afterwards.

5) a bunch head is collected this bunch information, is implemented to the multi-hop transmission of Sink node by its father's in the cluster process bunch leader cluster node.

(a) after the information that leader cluster node has been collected this bunch ordinary node neat and sent, carry out data fusion.

(b) leader cluster node is received data father's bunch leader cluster node and is sent the Sink node step by step back to.Annotate: the father bunch is not final effectively sub-clustering, excessive bunch of just producing in the clustering process.

6) enter and judge earlier the last round of ground floor division that whether exists after the next round.

(a) according on take turns the whole Wsn of historical record and whether have effective 2 the equivalence class node submanifold { Wsn of ground floor ₁', Wsn ₂' divide.

7) as just not dividing directly change bunch head, as final effective bunch.And enter step 4.

(a) if not do not divide then think that Wsn is the final effectively sub-clustering of epicycle, more renews bunch head and enters step 4.

8) whether integral energy is unbalance with younger brother's father and elder brothers sub-clustering (virtual) as existing division just to investigate these.

(a) investigate these 2 a bit with younger brother's father and elder brothers sub-clustering (Wsn as existing just to divide according to formula 3 ₁', Wsn ₂') whether integral energy is unbalance.

9) if integral energy also keeps balance, whether each bunch of investigating balance again exists lower floor to divide separately, and enters step 7.

(a) if also keeping balance, integral energy extracts each bunch of balance successively out

(b) determine Wsn _i' do not exist lower floor to divide, and with Wsn _i' remember and make Wsn and enter step 7.

10) if integral energy balance then more renew bunch head and enter step 1 no longer.

(a), integral energy changes bunch head of Wsn if not keeping balance.

(b) will change the Wsn substitution step 1 of new bunch of head.

11) repeating step 1 exhausts until all node energies to step 10.

Claims (1)

1. a quotient topology energy is passed the wireless sense network route method of rank Dynamic Programming, it is characterized in that:

(1) according to the region attribute of a relation wireless sensing net topology Wsn is induced N kind alternate divisions scheme, the step that to specify every kind of alternate divisions be k small grain size submanifold is:

(a) node is in case dispose and just no longer to change its geographical position, and the base station records node distributed intelligences such as the dump energy of each node and geographical indicator;

(b) by selected geographical distribution attribute, as certain height above sea level, or certain horizontal longitude and latitude, it is Wsn that Wsn is divided into K equivalence class node submanifold ₁', Wsn ₂' ... Wsn _k';

(c) selected different geographical distribution attribute repeats N execution in step b and obtains N kind alternate divisions scheme;

(2) an above-mentioned N alternate divisions being carried out the competition that energy balance and energy are estimated consumption, is Wsn as obtaining namely optimum next the straton sub-clustering of optimal dividing ₁', Wsn ₂' ... Wsn _k', then enter the following step (three); Otherwise this wireless sense network Wsn originally as final effective bunch, then enters the following step (four), concrete steps:

(a) select one of alternate divisions;

(b) in K sub-sub-clustering, each sub-sub-clustering is selected some optimums bunch head and predicted minimal energy consumption value Consume (Wsn_ based on these bunches head by calculating _i') wherein i ∈ 1,2 ... k};

(c) aggregation step b obtains k energy predicting consumption

Compare with the father bunch prediction energy Consume (Wsn) that need consume, as shown in the formula dividing the post consumption energy shown in (1) and then cancelling this division more than or equal to consumption before dividing, as consuming as shown in the formula thinking then shown in (2) that this division effectively is alternate divisions less than before dividing;

$\mathrm{Consume}\left(\mathrm{Wsn}\right)\&le;\underset{i=1}{\overset{k}{\mathrm{\&Sigma;}}}\mathrm{Consume}\left(\mathrm{Ws}{n_i}^{\&prime;}\right)\&CenterDot;\&CenterDot;\&CenterDot;\left(1\right)$

$\mathrm{Consume}\left(\mathrm{Wsn}\right)>\underset{i=1}{\overset{k}{\mathrm{\&Sigma;}}}\mathrm{Consume}\left(\mathrm{Ws}{n_i}^{\&prime;}\right)\&CenterDot;\&CenterDot;\&CenterDot;\left(2\right)$

(d) repeating step a to step c as do not obtain any alternate divisions then this father bunch basis as final effective bunch and enter step (four), if m alternate divisions arranged then enter next step e;

(e) calculate the sub-cluster knot point dump energy Energe (Wsn of K separately of m alternate divisions respectively ₁') wherein i ∈ 1,2 ..., k}

And balanced degree $\mathrm{Balance}(\mathrm{Ws}{n_1}^{\&prime;},\mathrm{Ws}{n_2}^{\&prime;},\&CenterDot;\&CenterDot;\&CenterDot;\mathrm{Ws}{n_k}^{\&prime;})=$

${\mathrm{Log}}_{\frac{1}{e}}\frac{\mathrm{Max}\{\mathrm{Energe}\left(\mathrm{Ws}{n_1}^{\&prime;}\right),\mathrm{Energe}\left(\mathrm{Ws}{n2}^{\&prime;}\right),\&CenterDot;\&CenterDot;\&CenterDot;\mathrm{Energe}\left(\mathrm{Ws}{n_k}^{\&prime;}\right)\}-\mathrm{Min}\{\mathrm{Energe}\left(\mathrm{Ws}{n_1}^{\&prime;}\right),\mathrm{Energe}\left(\mathrm{Wsn}{2}^{\&prime;}\right),\&CenterDot;\&CenterDot;\&CenterDot;\mathrm{Energe}\left(\mathrm{Ws}{n_k}^{\&prime;}\right)\}}{\mathrm{Min}\{\mathrm{Energe}\left(\mathrm{Ws}{n_1}^{\&prime;}\right),\mathrm{Energe}\left(\mathrm{Wsn}{2}^{\&prime;}\right),\&CenterDot;\&CenterDot;\&CenterDot;\mathrm{Energe}\left(\mathrm{Ws}{n_k}^{\&prime;}\right)\}}$

(f) take all factors into consideration the energy balance degree Balance () of each alternate divisions and the consumed energy of prediction and reduce degree Save (), select optimum sub-clustering.The consumed energy of prediction reduces degree and discriminant function as shown in the formula 3 and formula 4.

$\mathrm{Save}(\mathrm{Ws}{n_1}^{\&prime;},\mathrm{Ws}{n_2}^{\&prime;},...\mathrm{Ws}{n_k}^{\&prime;})={\mathrm{Log}}_{1/e}\frac{\mathrm{Consume}\left(\mathrm{Wsn}\right)-{\mathrm{\&Sigma;}}_{i=1}^k\mathrm{consume}\left(\mathrm{Ws}{n_i}^{\&prime;}\right)}{{\mathrm{\&Sigma;}}_{i=1}^k\mathrm{consume}\left(\mathrm{Ws}{n_i}^{\&prime;}\right)}\&CenterDot;\&CenterDot;\&CenterDot;\left(3\right)$

α?Save（Wsn ₁’，Wsn ₂’，…Wsn _k’）+β?Banance（Wsn ₁’，Wsn ₂’，…Wsn _k’）………（4）

Annotating α and β is adjustable parameter

(3) for selected this K submanifold, it is as follows to enter step () step respectively:

(a) for this K selected submanifold Wsn ₁', Wsn ₂' ... Wsn _k', extract wherein any one Wsn _i', i ∈ { 1,2 ... k}

(b) Wsn _i' enter step () as following relatively independent sub-Wsn of one deck;

(c) all the other K-1 submanifold also enters step a and b respectively and carries out next level and divide;

(4) determine all final effective bunch after, member's distribution T DMA timetable in effective bunch leader cluster node is given bunch

(a) Sink node broadcasts notice corresponding node who be members in bunch head and father at different levels bunch head and who are bunch;

(b) each effective sub-clustering bunch head according to bunch in member node add up to it and distribute time slot, and broadcasting, ordinary node namely can transmit an information to bunch head in the time of distributing afterwards;

(5) a bunch head is collected this bunch information, is implemented to the multi-hop transmission of Sink node by its father's in the cluster process bunch leader cluster node;

(a) after the information that leader cluster node has been collected this bunch ordinary node neat and sent, carry out data fusion;

(b) leader cluster node is received data father's bunch leader cluster node and is sent the Sink node step by step back to;

Annotate: the father bunch is not final effectively sub-clustering, excessive bunch of just producing in the clustering process;

(6) enter and judge earlier the last round of ground floor division that whether exists after the next round;

A) according on take turns the whole Wsn of historical record and whether have the effective K of ground floor equivalence class node submanifold { Wsn ₁', Wsn ₂' ... Wsn _k' divide;

(7) as just not dividing directly change bunch head, as final effective bunch; And enter step (four);

If a) not do not divide then think that Wsn is the final effectively sub-clustering of epicycle, more renews bunch head and enters step (four);

(8) just to investigate these be that virtual whether integral energy is unbalance with younger brother's father and elder brothers sub-clustering as exist dividing;

A) be Wsn with younger brother's father and elder brothers sub-clustering a bit as existing division just to investigate these k according to formula 3 ₁', Wsn ₂' ... Wsn _k' whether integral energy is unbalance;

(9) if integral energy also keeps balance, whether each bunch of investigating balance again exists lower floor to divide separately, and enters step (seven);

If a) integral energy also keeps balance then investigates each bunch of balance successively

B) determine Wsn _i' do not exist lower floor to divide, and with Wsn _i' remember and make Wsn and enter step (seven);

(10) if integral energy balance then more renew bunch head and enter step () no longer;

If a) integral energy does not keep balance then changes bunch head of Wsn;

B) will change the Wsn substitution step () of new bunch of head;

(11) repeating step (one) exhausts until all node energies to step (ten).

Images