CN103249108A - Wireless sensor network balanced energy consumption route method based on non-uniform clustering - Google Patents

Abstract

The invention discloses a wireless sensor network balanced energy consumption route method based on non-uniform clustering. A wireless sensor network includes a plurality of independent clusters and aggregation nodes, and each cluster includes a cluster head node and a plurality of ordinary nodes; the clustering radius Ri of the cluster head is increased progressively along with the distance d from the cluster head to the each aggregation node and the probability CHprob that one node forms the cluster head; and for an isolated node added to the cluster to which the node nearest to the communication radius of the isolated node belongs, when no node is arranged within the communication radius of the isolated node, the isolated node forms a cluster independently. According to the method, during data transmission, an in-cluster single hop data transmission manner and a multi-hop data transmission manner among clusters are adopted, a cluster head node is selected from cluster head nodes of the adjacent cluster to serve as a relay node for each cluster head node, so that data can be transmitted to the aggregation node; and the method realizes the balance of energy consumption among the clusters and within the cluster, and prolongs the life cycle of the network.

Description

Wireless sensor network energy consumption balance method for routing based on non-homogeneous sub-clustering

Technical field

The present invention relates to a kind of wireless sensor network Routing Protocol, relate in particular to a kind of wireless sensor network energy consumption balance method for routing based on non-homogeneous sub-clustering, belong to the wireless sensor network technology field.

Background technology

Along with the high speed development of MEMS (micro electro mechanical system) (MEMS) technology, wireless communication technology and Digital Electronic Technique, wireless sensor network has worldwide caused extensive concern.Wireless sensor network be by one group of transducer with the wireless network that the self-organizing mode constitutes, its objective is the information of perceptive object in the geographic area of perception collaboratively, collection and the processing network coverage, and be distributed to the observer.Wireless sensor network can be widely used in fields such as military affairs, environmental monitoring and forecast, health care, Smart Home, urban transportation.Along with further investigation and the extensive use of wireless sensor network, wireless sensor network will progressively be deep into human lives's every field.

The self-organizing network of normally a kind of foundation-free facility of wireless sensor network, sensor node use powered battery, and deployment region unattended operation often, easily because depleted of energy lost efficacy, finally cause whole network paralysis.Simultaneously, be different from other wireless networks, as mobile ad hoc network and Cellular Networks, they do not have the constraint of energy aspect, only are absorbed in QoS(service quality) research, and the characteristics of wireless sensor network have determined whole network to be limited by energy.Therefore, a kind of method for routing of wireless sensor network that is applicable to can improve performance and the life-span of wireless sensor network to a great extent.

Routing Protocol based on sub-clustering is the class wireless sensor network Routing Protocol that present researcher relatively pays close attention to.Typical clustering route protocol has LEACH, HEED, EEUC etc.Wherein the HEED agreement is on this problem basis of a bunch skewness of LEACH agreement and the improvement of making.It can reach power AMRP as the standard of communications cost in weighing bunch with minimum average B configuration.Node sends challenge message with the different probability that becomes bunch head.After bunch head is campaigned for successfully, other nodes according to the Information Selection of collecting in the competitive stage add bunch.The HEED agreement can produce bunch head that is evenly distributed, and the whole network energy consumption is more balanced.

Application number is the non-homogeneous cluster routing method of wireless sensor network that the Chinese patent literature of CN 201110131502.4 discloses a kind of high energy efficiency, be characterized in by fuzzy logic system being used for the selection of optimum bunch head and the estimation of bunch size, final set up not of uniform size bunch, but this method is handled complicated, and the input fuzzy variable does not embody a bunch big or small influence degree, can not select best bunch radius.Application number is that the Chinese patent literature of CN 200810070376.4 discloses the non-homogeneous cluster-dividing method of a kind of cluster wireless sensor network based on balancing energy, be characterized in wireless sensor network is divided into endless belt heterogeneous, set up a bunch energy consumption solving equation, optimize the ring radius vectors, thereby definite bunch size, but this method is only applicable to the situation that aggregation node is in the wireless sensor network central area, and this method calculation of complex.Application number is that the Chinese patent literature of CN 201210166856.7 discloses the distributed non-homogeneous cluster-dividing method of a kind of WSN, be characterized in selecting candidate bunch head on the basis of balance the whole network energy, and compete radius by adaptively correcting and carry out non-homogeneous sub-clustering, final node is according to selecting best bunch adding based on the energy consumption function of energy and distance, but this method is selected candidate's bunch head by selecting a random number, cause candidate's bunch head too much or very few easily, it is too much or very few to cause leader cluster node to be selected at last, influences whole network energy consumption.It is a kind of based on the non-uniform sections wireless sensor network topology control method that application number is that the Chinese patent literature of CN 200810035214.7 discloses, in topological generation phase, introduced the energy consumption that a kind of non-homogeneous lowest mean square subtractive clustering sub-clustering mechanism reduces bunch interior nodes in the cluster process, distance is only considered in the selection of its bunch radius, do not consider the energy of leader cluster node, easily cause energy consumption unbalanced.

Summary of the invention

The object of the present invention is to provide a kind of wireless sensor network energy consumption balance method for routing based on non-homogeneous sub-clustering, overcome the deficiencies in the prior art, the energy consumption of energy active balance whole system, prolonging network survival time is so that wireless sensor network obtains extensively effectively using.

Purpose of the present invention is achieved by the following technical programs:

A kind of wireless sensor network energy consumption balance method for routing based on non-homogeneous sub-clustering, wireless sensor network comprise some separately independently bunch and aggregation node; Described bunch comprises a leader cluster node and several ordinary nodes, it is characterized in that this method comprises the following step:

1) initial phase

Step S101: network scenarios is set, in network environment, disposes N at random and have identical primary power, ID numbering from the ordinary node of 0～N-1; Aggregation node is deployed in certain around the network, and each ordinary node can directly be communicated by letter with aggregation node, aggregation node energy infinity and can deal with data;

Step S102: netinit, hello message of aggregation node broadcasting is given all ordinary nodes in the network, each ordinary node after receiving hello message according to receive the signal strength signal intensity indication estimate itself and aggregation node apart from d (i, BS); Simultaneously each ordinary node broadcast once, other ordinary nodes in certain ordinary node broadcasting area are its neighbors, calculate each ordinary node and can reach power AMRP to the minimum average B configuration of its neighbors; Minimum average B configuration can reach the average signal strength of the neighbors that power AMRP receives with this ordinary node and represent:

$\mathrm{AMRP}=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{\mathrm{Radio}}_j/n$

Wherein n is the neighbors number of this ordinary node, Radio _jIt is the signal strength signal intensity that this ordinary node is received neighbors j;

2) the cluster stage

Step S201: cluster is prepared, and the initial proportion C that all ordinary nodes in the network become leader cluster node at first is set _Prob, each ordinary node calculates the probability CH that it becomes leader cluster node according to formula (1) then _Prob, and the set of the alternative leader cluster node of all ordinary nodes of initialization is for empty, and all ordinary nodes all are not candidate's leader cluster nodes, its node state is ordinary node;

CH _prob＝max(C _prob×E _residual/E _max,P _min) （1）

E wherein _ResidualBe this ordinary node current remaining, E _MaxBe the primary power of this ordinary node, regulation CH _ProbMinimum value is P _Min, prevent that leader cluster node election iterative convergence speed is too slow;

Step S202: each ordinary node judges whether own alternative leader cluster node set is empty, in namely whether this node adds bunch, if, then enter step S203, otherwise commentaries on classics step S204;

Step S203: each ordinary node judges that it becomes the probability CH of leader cluster node _ProbWhether more than or equal to 1, if then this ordinary node becomes final leader cluster node, and enter step S205, otherwise change step S206;

Step S204: alternative leader cluster node set does not judge oneself whether to be candidate's leader cluster node for empty ordinary node, if then enter step S207, otherwise change step S208;

Step S205: this ordinary node becomes final leader cluster node, and upgrading node state is final leader cluster node, with oneself adding its alternative leader cluster node set, calculates its bunch radius R according to formula (2) then _i, and with a bunch radius R _iThe message of final leader cluster node oneself is elected as in ordinary node broadcasting in its bunch, and this message comprises that ID number of this final leader cluster node, node state, minimum average B configuration can reach power AMRP and bunch radius; After message had been broadcasted, all ordinary nodes upgraded its alternative leader cluster node set in its bunch radius, should add in the alternative leader cluster node set by final leader cluster node, and changed step S212 over to;

$R_i=\mathrm{\ω}(1-c\frac{d_{\max }-d(i-\mathrm{BS})}{d_{\max }-d_{\min }})R_0+(1-\mathrm{\ω})(1-c\frac{{\mathrm{CH}}_{\mathrm{prob}\max }-{\mathrm{CH}}_{\mathrm{prob}}\left(i\right)}{{\mathrm{CH}}_{\mathrm{prob}\max }-{\mathrm{CH}}_{\mathrm{prob}\min }})R_0---\left(2\right)$

D wherein _MaxAnd d _MinBe respectively ordinary node to maximum and the minimum value of the distance of aggregation node, (i BS) is the distance of ordinary node i to aggregation node, CH to d _ProbmaxAnd CH _ProbminBe respectively ordinary node and become maximum probability and the minimum probability of leader cluster node, CH _Prob(i) become the probability of leader cluster node for ordinary node i, R ₀Be ordinary node greatest irradiation radius, ω and c are the parameters for the control span;

Step S206: each ordinary node judges that it becomes the probability CH of leader cluster node _ProbWhether more than or equal to the number that generates at random between 0～1, if then enter step S209, otherwise change step S210;

Step S207: the ordinary node that becomes candidate's leader cluster node judges that it becomes the probability CH of leader cluster node _ProbWhether more than or equal to 1, if then enter step S205, otherwise change step S209;

Step S208: for the set of alternative leader cluster node for empty and its oneself be not the ordinary node of candidate's leader cluster node, this ordinary node add minimum average B configuration in its alternative leader cluster node set can reach under candidate's leader cluster node of power AMRP minimum or the final leader cluster node bunch in, and enter step S211;

Step S209: this ordinary node becomes candidate's leader cluster node, and upgrading this ordinary node state is candidate's leader cluster node, will oneself add its alternative leader cluster node set, and calculates its bunch radius R according to formula (2) _i, simultaneously the message of candidate's leader cluster node oneself is elected as in ordinary node broadcasting in its bunch, and this message comprises that ID number of this candidate's leader cluster node self, node state, minimum average B configuration can reach power AMRP and bunch radius; After candidate's leader cluster node had been broadcasted message, all ordinary nodes upgraded its alternative leader cluster node set in its bunch radius, this candidate's leader cluster node is added in the alternative leader cluster node set, and execution in step S210;

Step S210: ordinary node or candidate's leader cluster node are with the CH of self _ProbMultiply by 2 and enter step S211;

Step S211: whether judge iterations greater than N time, N be maximum iteration time and

If then ends iteration and enter step S212, otherwise iterations adds 1, and change step S202;

Step S212: cluster stops, and each node determines its end-state; If ordinary node has become final leader cluster node when iterative process, then it is elected as leader cluster node; If have final leader cluster node in the set of the alternative leader cluster node of ordinary node, then it adds in minimum average B configuration in the alternative leader cluster node set can reach under the final leader cluster node of power AMRP minimum bunch; If certain ordinary node is isolated node, namely there is not final leader cluster node in the alternative leader cluster node set, in then adding under the cluster node nearest in its communication radius bunch; If do not have other nodes, the then independent cluster of isolated node in this isolated node communication radius;

3) stage of communication bunch

In adopting bunch single-hop and bunch between the multi-hop data transmission means, each leader cluster node need select a leader cluster node as its via node from the leader cluster node of adjacent cluster, transmits data and arrives aggregation node; All directly single-hop transmission is to aggregation node less than bunch head of T apart from the distance of aggregation node for bunch head, and wherein T is a predefined value, and it is worth always less than ordinary node greatest irradiation radius R ₀, apart from the distance of the aggregation node bunch head greater than T, bunch head of selecting a cost minimum from the set of adjacent cluster head node through multi-hop, is finished transfer of data to the aggregation node place as its via node for bunch head; Detailed process is as follows:

Step S301: leader cluster node calculates it apart from the distance of aggregation node, and whether judges distance less than T, if then enter step S302, otherwise change step S303;

Step S302: leader cluster node is directly transported to aggregation node with the data sheet jump set;

Step S303: leader cluster node c _iWith its β bunch radius broadcast doubly, wherein between the general value 1～1.5 of β and its broadcasting radius less than ordinary node greatest irradiation radius R ₀The message of leader cluster node broadcasting comprises the node cost of leader cluster node ID, dump energy, leader cluster node self and arrives the distance of aggregation node that the node cost is calculated according to formula (3); Other leader cluster nodes that receive message also send return messages to the leader cluster node c that sends message _i, return messages comprise its node cost and arrive the distance of aggregation node; Leader cluster node c _iCalculate adjacent cluster head node set c according to a bunch number of sending return messages _i.R _CH, a bunch c _iAdjacent cluster head node sets definition be: c _i.R _CH={ c _j| d (c _i, c _j)≤β R _i, d (c _j, BS)＜d (c _i, BS) };

Node cost computing formula is: $\cos t\left(i\right)=\mathrm{\μ}\frac{\stackrel{\‾}{d_{c-\mathrm{BS}}}}{d_{\mathrm{ci}-\mathrm{BS}}}+(1-\mathrm{\μ})\frac{E_{\mathrm{ci}}}{\stackrel{\‾}{E_c}}---\left(3\right)$

Wherein

Be the mean value of the leader cluster node in this leader cluster node and the set of its adjacent cluster head node to the aggregation node distance, d _Ci-BSBe leader cluster node c _iTo the distance of aggregation node, Be the mean value of the leader cluster node dump energy in leader cluster node and the set of its adjacent cluster head node, E _CiBe leader cluster node c _iDump energy, μ be for control span parameter;

Step S304: leader cluster node c _iFrom its adjacent cluster head node set, select the leader cluster node of cost minimum as its next-hop node.

Compared with prior art, the invention has the beneficial effects as follows: by the node in the wireless sensor network is carried out non-homogeneous sub-clustering, the probability that makes bunch radius and bunch head become bunch head to distance and the node of aggregation node is and increases progressively relation, can reach in power AMRP adds bunch according to its minimum average B configuration for the node of a plurality of bunches of overlapping portions, energy consumption balance in feasible bunch, at last select to adopt single-hop or multi-hop to transmit according to the distance of distance aggregation node, energy consumption balance between making bunch finally can reach the energy consumption of active balance whole system.Between the present invention has realized bunch and bunch in the equilibrium of energy consumption, make the life cycle of network prolong.

Description of drawings

Fig. 1 is wireless sensor network structure chart of the present invention;

Fig. 2 is that of the present invention bunch of head produces flow chart;

Fig. 3 is communication flow diagram between of the present invention bunch;

Fig. 4 is the every analogous diagram of taking turns survival node number of network.

Embodiment

The invention will be further described below in conjunction with the drawings and specific embodiments.

The present invention proposes a kind of novel wireless sensor network energy consumption balance method for routing based on non-homogeneous sub-clustering, to the non-homogeneous sub-clustering of wireless sensor network, described bunch radius R _iAlong with bunch head becomes the probability CH of bunch head apart from aggregation node apart from d and node _ProbBe and increase progressively relation.Stage of communication single-hop and multi-hop mode can dynamically produce the little leader cluster node of energy consumption by internodal information interaction and carry out transfer of data, thereby make whole network energy consumption more balanced, and have avoided the quick death of a certain node.The present invention can effectively improve the life span of network, and its embodiment is as follows:

As shown in Figure 1, wireless sensor network comprises some bunch 2 and aggregation nodes 3 independently separately in monitored area 1; Comprise a leader cluster node 4 and several ordinary nodes 5 for described bunch 2, this method comprises the following step:

1) initial phase:

Step S101: network scenarios is set, in network environment, disposes N at random and have identical primary power, ID numbering from the ordinary node of 0～N-1; Aggregation node is deployed in certain around the network, and each ordinary node can directly be communicated by letter with aggregation node, aggregation node energy infinity and can deal with data;

Step S102: netinit, hello message of aggregation node broadcasting is given all ordinary nodes in the network, each ordinary node after receiving hello message according to receive signal strength signal intensity indication (RSSI) estimate itself and aggregation node apart from d (i, BS); Simultaneously each ordinary node broadcast once, other ordinary nodes in certain ordinary node broadcasting area are its neighbors, calculate each ordinary node and can reach power AMRP to the minimum average B configuration of its neighbors; Minimum average B configuration can reach the average signal strength of the neighbors that power AMRP receives with this ordinary node and represent:

$\mathrm{AMRP}=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{\mathrm{Radio}}_j/n$

Wherein n is the neighbors number of this ordinary node, Radio _jIt is the signal strength signal intensity that this ordinary node is received neighbors j;

3) the cluster stage

Step S201: cluster is prepared, and the initial proportion C that all ordinary nodes in the network become leader cluster node at first is set _Prob, each ordinary node calculates the probability CH that it becomes leader cluster node according to formula (1) then _Prob, and the set of the alternative leader cluster node of all ordinary nodes of initialization is for empty, and all ordinary nodes all are not candidate's leader cluster nodes, its node state is ordinary node;

CH _prob＝max(C _prob×E _residual/E _max,P _min) （1）

E wherein _ResidualBe this ordinary node current remaining, E _MaxBe the primary power of this ordinary node, regulation CH _ProbMinimum value is P _Min, prevent that leader cluster node election iterative convergence speed is too slow, P _MinGet 10 ^-4

Step S202: as shown in Figure 2, each ordinary node judges whether own alternative leader cluster node set is empty, in namely whether this node adds bunch, if, then enter step S203, otherwise commentaries on classics step S204;

Step S203: each ordinary node judges that it becomes the probability CH of leader cluster node _ProbWhether more than or equal to 1, if then this ordinary node becomes final leader cluster node, and enter step S205, otherwise change step S206;

Step S204: alternative leader cluster node set does not judge oneself whether to be candidate's leader cluster node for empty ordinary node, if then enter step S207, otherwise change step S208;

Step S205: this ordinary node becomes final leader cluster node, and upgrading node state is final leader cluster node, with oneself adding its alternative leader cluster node set, calculates its bunch radius R according to formula (2) then _i, and with a bunch radius R _iThe message of final leader cluster node oneself is elected as in ordinary node broadcasting in its bunch, and this message comprises that ID number of this final leader cluster node, node state, minimum average B configuration can reach power AMRP and bunch radius; After message had been broadcasted, all ordinary nodes upgraded its alternative leader cluster node set in its bunch radius, should add in the alternative leader cluster node set by final leader cluster node, and changed step S212 over to;

$R_i=\mathrm{\&omega;}(1-c\frac{d_{\max }-d(i-\mathrm{BS})}{d_{\max }-d_{\min }}){\mathrm{<figure-callout\; id="0"\; label="R"\; filenames="HDA00003071112600032.png"\; state="\{\{state\}\}">R</figure-callout>}}_0+(1-\mathrm{\&omega;})(1-c\frac{{\mathrm{CH}}_{\mathrm{prob}\max }-{\mathrm{CH}}_{\mathrm{prob}}\left(i\right)}{{\mathrm{CH}}_{\mathrm{prob}\max }-{\mathrm{CH}}_{\mathrm{prob}\min }})R_0---\left(2\right)$

D wherein _MaxAnd d _MinBe respectively ordinary node to maximum and the minimum value of the distance of aggregation node, (i BS) is the distance of ordinary node i to aggregation node, CH to d _ProbmaxAnd CH _ProbminBe respectively ordinary node and become maximum probability and the minimum probability of leader cluster node, CH _Prob(i) become the probability of leader cluster node for ordinary node i, R ₀Be ordinary node greatest irradiation radius, ω and c are the parameters for the control span, value between 0～1;

Step S206: each ordinary node judges that it becomes the probability CH of leader cluster node _ProbWhether more than or equal to the number that generates at random between 0～1, if then enter step S209, otherwise change step S210;

Step S207: the ordinary node that becomes candidate's leader cluster node judges that it becomes the probability CH of leader cluster node _ProbWhether more than or equal to 1, if then enter step S205, otherwise change step S209;

Step S208: for the set of alternative leader cluster node for empty and its oneself be not the ordinary node of candidate's leader cluster node, this ordinary node add minimum average B configuration in its alternative leader cluster node set can reach under candidate's leader cluster node of power AMRP minimum or the final leader cluster node bunch in, and enter step S211;

Step S209: this ordinary node becomes candidate's leader cluster node, and upgrading this ordinary node state is candidate's leader cluster node, will oneself add its alternative leader cluster node set, and calculates its bunch radius R according to formula (2) _i, simultaneously the message of candidate's leader cluster node oneself is elected as in ordinary node broadcasting in its bunch, and this message comprises that ID number of this candidate's leader cluster node self, node state, minimum average B configuration can reach power AMRP and bunch radius; After candidate's leader cluster node had been broadcasted message, all ordinary nodes upgraded its alternative leader cluster node set in its bunch radius, this candidate's leader cluster node is added in the alternative leader cluster node set, and execution in step S210;

Step S210: ordinary node or candidate's leader cluster node are with the CH of self _ProbMultiply by 2 and enter step S211;

Step S211: whether judge iterations greater than N time, N be maximum iteration time and If then ends iteration and enter step S212, otherwise iterations adds 1, and change step S202;

Step S212: cluster stops, and each node determines its end-state; If ordinary node has become final leader cluster node when iterative process, then it is elected as leader cluster node; If have final leader cluster node in the set of the alternative leader cluster node of ordinary node, then it adds in minimum average B configuration in the alternative leader cluster node set can reach under the final leader cluster node of power AMRP minimum bunch; If certain ordinary node is isolated node, namely there is not final leader cluster node in the alternative leader cluster node set, in then adding under the cluster node nearest in its communication radius bunch; If do not have other nodes, the then independent cluster of isolated node in this isolated node communication radius.

4) stage of communication bunch

In adopting bunch single-hop and bunch between the multi-hop data transmission means, each leader cluster node need select a leader cluster node as its via node from the leader cluster node of adjacent cluster, transmits data and arrives aggregation node; All directly single-hop transmission is to aggregation node less than bunch head of T apart from the distance of aggregation node for bunch head, and wherein T is a predefined value, and it is worth always less than ordinary node greatest irradiation radius R ₀, the value of T can be obtained suitable optimal parameter according to the test of value repeatedly.Apart from the distance of the aggregation node bunch head greater than T, bunch head of selecting a cost minimum from the set of adjacent cluster head node through multi-hop, is finished transfer of data to the aggregation node place as its via node for bunch head.Detailed process is as follows:

Step S301: as shown in Figure 3, leader cluster node calculates it apart from the distance of aggregation node, and whether judges distance less than T, if then enter step S302, otherwise change step S303;

Step S302: leader cluster node is directly transported to aggregation node with the data sheet jump set;

Step S303: leader cluster node c _iWith its β bunch radius broadcast doubly, wherein between the general value 1～1.5 of β and its broadcasting radius less than ordinary node greatest irradiation radius R ₀The message of leader cluster node broadcasting comprises the node cost of leader cluster node ID, dump energy, leader cluster node self and arrives the distance of aggregation node that the node cost is calculated according to formula (3); Other leader cluster nodes that receive message also send return messages to the leader cluster node c that sends message _i, return messages comprise its node cost and arrive the distance of aggregation node; Leader cluster node c _iCalculate adjacent cluster head node set c according to a bunch number of sending return messages _i.R _CH, a bunch c _iAdjacent cluster head node sets definition be: c _i.R _CH={ c _j| d (c _i, c _j)≤β R _i, d (c _j, BS)＜d (c _i, BS) };

Node cost computing formula is: $\cos t\left(i\right)=\mathrm{\&mu;}\frac{\stackrel{\&OverBar;}{d_{c-\mathrm{BS}}}}{d_{\mathrm{ci}-\mathrm{BS}}}+(1-\mathrm{\&mu;})\frac{E_{\mathrm{ci}}}{\stackrel{\&OverBar;}{E_c}}---\left(3\right)$

Wherein

Be the mean value of the leader cluster node in this leader cluster node and the set of its adjacent cluster head node to the aggregation node distance, d _Ci-BSBe leader cluster node c _iTo the distance of aggregation node,

Be the mean value of the leader cluster node dump energy in leader cluster node and the set of its adjacent cluster head node, E _CiBe leader cluster node c _iDump energy, μ be for control span parameter, value between 0～1;

Step S304: leader cluster node c _iFrom its adjacent cluster head node set, select the leader cluster node of cost minimum as its next-hop node.

In order to verify this method for routing validity, now adopt the every survival node number of taking turns of network that this method for routing is carried out emulation.The emulation tool matlab of emulation tool for being generally acknowledged by industry that uses.This method and LEACH, HEED algorithm are compared, select 200 nodes to be randomly dispersed in 100 * 100m ²The zone in, all node primary powers are 2J.Network is every in the emulation takes turns survival node number as shown in Figure 4.

In addition to the implementation, the present invention can also have other execution modes, and all employings are equal to the technical scheme of replacement or equivalent transformation formation, all drop in the protection range of requirement of the present invention.

Claims (1)

1. wireless sensor network energy consumption balance method for routing based on non-homogeneous sub-clustering, wireless sensor network comprise some separately independently bunch and aggregation node; Described bunch comprises a leader cluster node and several ordinary nodes, it is characterized in that this method comprises the following step:

1) initial phase

Step S101: network scenarios is set, in network environment, disposes N at random and have identical primary power, ID numbering from the ordinary node of 0～N-1; Aggregation node is deployed in certain around the network, and each ordinary node can directly be communicated by letter with aggregation node, aggregation node energy infinity and can deal with data;

Step S102: netinit, hello message of aggregation node broadcasting is given all ordinary nodes in the network, each ordinary node after receiving hello message according to receive the signal strength signal intensity indication estimate itself and aggregation node apart from d (i, BS); Simultaneously each ordinary node broadcast once, other ordinary nodes in certain ordinary node broadcasting area are its neighbors, calculate each ordinary node and can reach power AMRP to the minimum average B configuration of its neighbors; Minimum average B configuration can reach the average signal strength of the neighbors that power AMRP receives with this ordinary node and represent:

$\mathrm{AMRP}=\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}{\mathrm{Radio}}_j/n$

Wherein n is the neighbors number of this ordinary node, Radio _jIt is the signal strength signal intensity that this ordinary node is received neighbors j;

2) the cluster stage

Step S201: cluster is prepared, and the initial proportion C that all ordinary nodes in the network become leader cluster node at first is set _Prob, each ordinary node calculates the probability CH that it becomes leader cluster node according to formula (1) then _Prob, and the set of the alternative leader cluster node of all ordinary nodes of initialization is for empty, and all ordinary nodes all are not candidate's leader cluster nodes, its node state is ordinary node;

CH _prob＝max(C _prob×E _residual/E _max,P _min) （1）

E wherein _ResidualBe this ordinary node current remaining, E _MaxBe the primary power of this ordinary node, regulation CH _ProbMinimum value is P _Min, prevent that leader cluster node election iterative convergence speed is too slow;

Step S202: each ordinary node judges whether own alternative leader cluster node set is empty, in namely whether this node adds bunch, if, then enter step S203, otherwise commentaries on classics step S204;

Step S203: each ordinary node judges that it becomes the probability CH of leader cluster node _ProbWhether more than or equal to 1, if then this ordinary node becomes final leader cluster node, and enter step S205, otherwise change step S206;

Step S204: alternative leader cluster node set does not judge oneself whether to be candidate's leader cluster node for empty ordinary node, if then enter step S207, otherwise change step S208;

Step S205: this ordinary node becomes final leader cluster node, and upgrading node state is final leader cluster node, with oneself adding its alternative leader cluster node set, calculates its bunch radius R according to formula (2) then _i, and with a bunch radius R _iThe message of final leader cluster node oneself is elected as in ordinary node broadcasting in its bunch, and this message comprises that ID number of this final leader cluster node, node state, minimum average B configuration can reach power AMRP and bunch radius; After message had been broadcasted, all ordinary nodes upgraded its alternative leader cluster node set in its bunch radius, should add in the alternative leader cluster node set by final leader cluster node, and changed step S212 over to;

$R_i=\mathrm{\&omega;}(1-c\frac{d_{\max }-d(i-\mathrm{BS})}{d_{\max }-d_{\min }})R_0+(1-\mathrm{\&omega;})(1-c\frac{{\mathrm{CH}}_{\mathrm{prob}\max }-{\mathrm{CH}}_{\mathrm{prob}}\left(i\right)}{{\mathrm{CH}}_{\mathrm{prob}\max }-{\mathrm{CH}}_{\mathrm{prob}\min }})R_0---\left(2\right)$

D wherein _MaxAnd d _MinBe respectively ordinary node to maximum and the minimum value of the distance of aggregation node, (i BS) is the distance of ordinary node i to aggregation node, CH to d _ProbmaxAnd CH _ProbminBe respectively ordinary node and become maximum probability and the minimum probability of leader cluster node, CH _Prob(i) become the probability of leader cluster node for ordinary node i, R ₀Be ordinary node greatest irradiation radius, ω and c are the parameters for the control span;

Step S206: each ordinary node judges that it becomes the probability CH of leader cluster node _ProbWhether more than or equal to the number that generates at random between 0～1, if then enter step S209, otherwise change step S210;

Step S207: the ordinary node that becomes candidate's leader cluster node judges that it becomes the probability CH of leader cluster node _ProbWhether more than or equal to 1, if then enter step S205, otherwise change step S209;

Step S208: for the set of alternative leader cluster node for empty and its oneself be not the ordinary node of candidate's leader cluster node, this ordinary node add minimum average B configuration in its alternative leader cluster node set can reach under candidate's leader cluster node of power AMRP minimum or the final leader cluster node bunch in, and enter step S211;

Step S209: this ordinary node becomes candidate's leader cluster node, and upgrading this ordinary node state is candidate's leader cluster node, will oneself add its alternative leader cluster node set, and calculates its bunch radius R according to formula (2) _i, simultaneously the message of candidate's leader cluster node oneself is elected as in ordinary node broadcasting in its bunch, and this message comprises that ID number of this candidate's leader cluster node self, node state, minimum average B configuration can reach power AMRP and bunch radius; After candidate's leader cluster node had been broadcasted message, all ordinary nodes upgraded its alternative leader cluster node set in its bunch radius, this candidate's leader cluster node is added in the alternative leader cluster node set, and execution in step S210;

Step S210: ordinary node or candidate's leader cluster node are with the CH of self _ProbMultiply by 2 and enter step S211;

Step S211: whether judge iterations greater than N time, N be maximum iteration time and

If then ends iteration and enter step S212, otherwise iterations adds 1, and change step S202;

Step S212: cluster stops, and each node determines its end-state; If ordinary node has become final leader cluster node when iterative process, then it is elected as leader cluster node; If have final leader cluster node in the set of the alternative leader cluster node of ordinary node, then it adds in minimum average B configuration in the alternative leader cluster node set can reach under the final leader cluster node of power AMRP minimum bunch; If certain ordinary node is isolated node, namely there is not final leader cluster node in the alternative leader cluster node set, in then adding under the cluster node nearest in its communication radius bunch; If do not have other nodes, the then independent cluster of isolated node in this isolated node communication radius;

3) stage of communication bunch

In adopting bunch single-hop and bunch between the multi-hop data transmission means, each leader cluster node need select a leader cluster node as its via node from the leader cluster node of adjacent cluster, transmits data and arrives aggregation node; All directly single-hop transmission is to aggregation node less than bunch head of T apart from the distance of aggregation node for bunch head, and wherein T is a predefined value, and it is worth always less than ordinary node greatest irradiation radius R ₀, apart from the distance of the aggregation node bunch head greater than T, bunch head of selecting a cost minimum from the set of adjacent cluster head node through multi-hop, is finished transfer of data to the aggregation node place as its via node for bunch head; Detailed process is as follows:

Step S301: leader cluster node calculates it apart from the distance of aggregation node, and whether judges distance less than T, if then enter step S302, otherwise change step S303;

Step S302: leader cluster node is directly transported to aggregation node with the data sheet jump set;

Step S303: leader cluster node c _iWith its β bunch radius broadcast doubly, wherein between the general value 1～1.5 of β and its broadcasting radius less than ordinary node greatest irradiation radius R ₀The message of leader cluster node broadcasting comprises the node cost of leader cluster node ID, dump energy, leader cluster node self and arrives the distance of aggregation node that the node cost is calculated according to formula (3); Other leader cluster nodes that receive message also send return messages to the leader cluster node c that sends message _i, return messages comprise its node cost and arrive the distance of aggregation node; Leader cluster node c _iCalculate adjacent cluster head node set c according to a bunch number of sending return messages _i.R _CH, a bunch c _iAdjacent cluster head node sets definition be: c _i.R _CH={ c _j| d (c _i, c _j)≤β R _i, d (c _j, BS)＜d (c _i, BS) };

Node cost computing formula is: $\cos t\left(i\right)=\mathrm{\&mu;}\frac{\stackrel{\&OverBar;}{d_{c-\mathrm{BS}}}}{d_{\mathrm{ci}-\mathrm{BS}}}+(1-\mathrm{\&mu;})\frac{E_{\mathrm{ci}}}{\stackrel{\&OverBar;}{E_c}}---\left(3\right)$

Wherein

Be the mean value of the leader cluster node in this leader cluster node and the set of its adjacent cluster head node to the aggregation node distance, d _Ci-BSBe leader cluster node c _iTo the distance of aggregation node,

Be the mean value of the leader cluster node dump energy in leader cluster node and the set of its adjacent cluster head node, E _CiBe leader cluster node c _iDump energy, μ be for control span parameter;

Step S304: leader cluster node c _iFrom its adjacent cluster head node set, select the leader cluster node of cost minimum as its next-hop node.

Images