CN104936230B - One kind being based on the desired balancing energy of wireless sensor network routing optimization method of cluster head - Google Patents
One kind being based on the desired balancing energy of wireless sensor network routing optimization method of cluster head Download PDFInfo
- Publication number
- CN104936230B CN104936230B CN201510328962.4A CN201510328962A CN104936230B CN 104936230 B CN104936230 B CN 104936230B CN 201510328962 A CN201510328962 A CN 201510328962A CN 104936230 B CN104936230 B CN 104936230B
- Authority
- CN
- China
- Prior art keywords
- cluster head
- node
- energy
- cluster
- head
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses one kind being based on the desired balancing energy of wireless sensor network routing optimization method of cluster head, the algorithm considers two optimization aims of sub-clustering load distribution situation and residue energy of node simultaneously when electing cluster head, threshold value when cluster head is elected to ensure each round cluster head number in expected range, to alleviate the unbalanced problem of cluster head energy expenditure by improvement；Simultaneously by controlling the coverage area of different location cluster head, consider apart from weights and dump energy weights so that the member node distribution of cluster head is more uniform, to improve node energy efficiency.Algorithm proposed by the present invention has higher capacity usage ratio, the balanced well energy expenditure of nodes, cluster head is distributed and quantity can more be stablized, data biography amount can be improved, extend network lifecycle, preferably meet wireless sensor network in periodical monitoring of environmental to the requirement of network lifecycle.
Description
Technical field
The present invention relates to a kind of balancing energy of wireless sensor network routing optimization methods, more particularly to one kind being based on cluster head
Desired balancing energy of wireless sensor network routing optimization method.
Background technology
An important branch of the wireless sensor network WSN (Wireless Sensor Networks) as Internet of Things,
Its effect is that gathered data is perceived in institute's monitoring of environmental, and adjacent node perceives same target information, then melted in real time
After conjunction, compression base station is sent to from group multi-hop agreement by wireless.WSN clustering routings have that clear layer, autgmentability be strong, Yi Shi
The advantages that existing adjacent data fusion, it is very suitable for the application fields such as industry monitoring.
Clustering Routing includes the communication between election, cluster head and the base station of cluster head, and two kinds of single-hop and multi-hop can be used
Communication mode.LEACH (the Low-energy Adaptive Clustering that W.Heinzelman et al. is proposed
Hierarchy) algorithm is a kind of self-organizing, adaptive complete distributed clustering routing algorithm.In order to extend first sensing
The out-of-service time of device node, LEACH algorithms utilize randomness Cycle-switching Cluster-head, to reach balance nodes energy load
Purpose.It is directed to hot-zone problem at method et al., proposes the multihop routing algorithm based on Uneven Cluster, close to the scale of the cluster of base station
Less than the cluster far from base station, therefore the data forwarding that the cluster head close to base station can be between cluster reserves energy, reaches balanced cluster head
The purpose of energy expenditure.Lv Tao et al. for LEACH algorithms there are very big cluster and minimal varieties the case where, propose by control cluster at
Member's number and the method for merging minimal variety make each sub-clustering energy balance in WSN；Rivers Jiang Chang et al. are directed to the sub-clustering of multi-hop mode
In network the problem of hot-zone, it is proposed that multihop routing organically combines between a kind of efficient balancing energy, Uneven Cluster and cluster
Distributed routing algorithm；HuiLin et al. is for integrated topological structure and clustering routing problem, it is proposed that a mixing integer
Linear programming model, with the best cluster head position of determination；Sun Yan is clear et al. for the hot-zone problem that node load is uneven and is formed, and carries
A kind of Clustering Routing based on dynamic partition load balancing is gone out；Su Jin trees et al. are directed to the lack of uniformity loaded between cluster,
Propose the fault-tolerant cluster algorithm of wireless sensor network of load balancing perception；Wasp pine et al. is directed to multiple in LEACH
Cluster head and the excessive problem of base station telecommunication energy expenditure, consider the energy and positional factor of node, to optimize the knot of cluster
Structure；Aimin Wang et al. introduce energy information in the election of cluster head threshold value of LEACH, can root using sliding window mechanism
Cluster head number is adjusted according to dynamic node number.
It carries out communicating between cluster again since cluster head should manage in cluster to communicate, so the energy consumption of cluster head will be saved than member in cluster
Point is more, unbalanced so as to cause node energy.If cluster head premature failure, the cluster will be caused to fail in epicycle, it is empty to form routing
Hole, and then shorten network lifecycle.Although the above Clustering Routing is energy efficient to a certain extent, section
The point unbalanced problem of energy not yet solves, although Clustering Routing can optimize the transmission quantity of data, reduces network energy consumption,
But the lack of uniformity of cluster head load can seriously affect the performance of routing algorithm.Therefore, it elects when cluster head and how to consider node
Dump energy and the load for balancing each cluster head are vital.
Invention content
The deficiency for aiming to overcome that the prior art of invention provides a kind of based on the desired wireless sensor network of cluster head
Balancing energy routing optimization method (CHEEB), the algorithm consider sub-clustering load distribution situation and node simultaneously when electing cluster head
Two optimization aims of dump energy, elect threshold value when cluster head to ensure each round cluster head number in expected range by improvement,
To alleviate the unbalanced problem of cluster head energy expenditure；Simultaneously by controlling the coverage area of different location cluster head, distance power is considered
Value and dump energy weights so that the member node distribution of cluster head is more uniform, to improve node energy efficiency.
The technical solution adopted by the present invention to solve the technical problems is：It provides a kind of based on the desired wireless sensing of cluster head
Device network energy proportional routing optimization method, which is characterized in that including：By the load of number of clusters mesh, residue energy of node and cluster
The factors such as equilibrium are added in the election of cluster head, using the load distribution situation of sub-clustering and residue energy of node as election cluster head
Two leading indicators；The working time unit of the election of the cluster head is wheel, and each round is divided into cluster establishment stage and data transmission
Stage two parts ensure each round cluster head number in expected range by adjusting threshold value, it is unbalanced to solve cluster head energy expenditure
The problem of；By controlling the coverage area of different location cluster head, calculate apart from weights and dump energy weights so that the section of cluster head
Point member's distribution is more uniform, to improve node energy efficiency.
Preferably, Ci is the indicator function whether node i became cluster head in current period, the step of the cluster establishment stage
Suddenly it is：
A1, traversal does not fail each and the node of Ci=1, node i generate the real number l between [0,1] at random；
The threshold value Pi of A2, calculate node i, judge the magnitude relationship of Pi and l；If l<Pi then enters step A3, otherwise turns
To step A4；
A3, node i are elected as epicycle cluster head, and Ci is set to 0；Cluster head information is elected in cluster head broadcast；Enter step A5；
The not elected epicycle cluster head of A4, node i, Ci are set to 1；Receive the elected cluster head information that all cluster heads are sent；Into step
Rapid A5；
The letter for the elected cluster head information that A5, the non-leader cluster node for not being elected as cluster head are sent according to each cluster head received
Number intensity, the cluster head of selection signal maximum intensity is as the epicycle cluster to be added；Non- leader cluster node is anti-by connectivity request message
It feeds selected cluster head；
A6, cluster head receive the connectivity request message of non-leader cluster node, and according to the quantity of cluster interior nodes, cluster head creates an announcement
Know node when can transmission data timetable, and this timetable is broadcast to the node in cluster；
Node receiving time table in A7, cluster simultaneously enters data transfer phase.
Preferably, the step of data transfer phase is：
Whether B1, decision node i are cluster heads；If not B2 is then entered step, if yes then enter step B3；
B2, the wireless of node in each cluster are electrically turn off until the transmission time for distributing to the node arrives；The section of Ci=1
Point sends the data packet of dump energy information to cluster head in the last one time slot of oneself；The node of Ci=0 oneself most
The data packet without dump energy information is sent in the latter time slot to cluster head, goes to step B3；
B3, cluster head open receiver and receive the data packet that cluster interior nodes are sent；Cluster head receives the number of all cluster interior nodes
According to advanced row data fusion after packet, then incidentally dump energy information it will be sent to base station；
B4, base station receive the information that cluster head is sent and the average energy for calculating Ci=1 nodes, then are broadcast to the whole network；
B5, node receive average energy necessary to calculating threshold value；
B6, a new round start, and judge whether to be the new period, and the Ci of all nodes is then reset to 1 if it is the new period,
It is transferred to step A1；If it is determined that being otherwise transferred to step B1.
Preferably, the ID and disappear for distinguishing this that cluster head information includes elected leader cluster node are elected in cluster head broadcast in step A3
Breath whether be notice information stem.
Preferably, the calculation formula of the threshold value Pi in the step A2 is：
Because only that the node that current period does not become cluster head can also participate in election of cluster head, so energy ratio in (1) formula
The average energy of the not all nodes of denominator of the example factor, is eligible for the node average energy of election；(1) formula simultaneously
It can it is expected that cluster head number keeps k constant；Cluster head it is expected that formula is：
(1) formula substitution (2) formula is obtained：
The document studied by W.Heinzelman et al.《An application-specific protocol
architecture for wireless microsensor networks》Known to：
By (4) formula and (3) Shi Ke get:
For node energy equilibrium, high-energy node to be allowed to be elected to cluster head, each candidate cluster head is by the address bit of itself more
It sets, dump energy, node are at a distance from cluster head and the message such as cluster head is at a distance from base station are broadcast to other nodes；Enable node i
Primary power be Ei0, the dump energy weights F (E before r takes turns sub-clusteringir) be
F(Eir) bigger, illustrate that the dump energy of the node at this moment is bigger；
Node i is to cluster head CHiCommunication range it is smaller, the energy consumption between cluster head and node is smaller；If same node i arrives
The communication range of base station BS is smaller, and the energy consumption of data transmission is also smaller.According to Free propagation energy model it is found that then comprehensive distance
Weights can be expressed as
In conjunction with formula (5), while comprehensive distance weights are added and make cluster head close proximity to base station, reduces data transmission consumption
Energy；The probability that node i becomes cluster head is calculated by formula (8)：
Pi-ch=α F (Eir)+βD(vi) (8)
If α, β are to adjust residue energy of node weights and the comprehensive distance weights probability ratio shared when cluster head competes,
And alpha+beta=1.
The beneficial effects of the invention are as follows：The present invention algorithm when elect cluster head simultaneously consider sub-clustering load distribution situation with
Two optimization aims of residue energy of node elect threshold value when cluster head to ensure each round cluster head number in desired model by improvement
It encloses, to alleviate the unbalanced problem of cluster head energy expenditure；Simultaneously by controlling the coverage area of different location cluster head, distance is considered
Weights and dump energy weights so that the member node distribution of cluster head is more uniform, to improve node energy efficiency.The present invention carries
The algorithm gone out has higher capacity usage ratio, the balanced well energy expenditure of nodes, cluster head distribution and quantity
It can more stablize, data biography amount can be improved, extend network lifecycle, preferably meet wireless sensor network in periodicity
To the requirement of network lifecycle in monitoring of environmental.
Invention is further described in detail with reference to the accompanying drawings and embodiments；But one kind of the present invention being based on the cluster head phase
The balancing energy of wireless sensor network routing optimization method of prestige is not limited to embodiment.
Description of the drawings
Fig. 1 is the sub-clustering phase flow figure based on the desired balancing energy Routing Optimization Algorithm of cluster head of the present invention；
Fig. 2 is the data transfer phase flow chart based on the desired balancing energy Routing Optimization Algorithm of cluster head of the present invention；
Fig. 3 is that the total energy consumption that three kinds of algorithms of the present invention are often taken turns compares；
Fig. 4 is that the network lifecycle of three kinds of algorithms of the present invention compares；
Fig. 5 is that the volume of transmitted data of three kinds of algorithms of the present invention compares；
Fig. 6 is that the cluster head distributed number of three kinds of algorithms of the present invention compares；
Fig. 7 is the CHEEB sub-clustering effects that the cluster head number of the present invention is 8.
Specific implementation mode
Embodiment 1
Shown in referring to Fig. 1 and Fig. 2, one kind of the invention is based on the desired balancing energy of wireless sensor network routing of cluster head
Optimization method, which is characterized in that including：The factors such as the load balancing by number of clusters mesh, residue energy of node and cluster are added to cluster
In the election of head, using the load distribution situation of sub-clustering and residue energy of node as two leading indicators of election cluster head；It is described
The working time unit of the election of cluster head is wheel, and each round is divided into cluster establishment stage and data transfer phase two parts, passes through tune
Whole threshold value ensures that each round cluster head number in expected range, solves the problems, such as that cluster head energy expenditure is unbalanced；By controlling not
It with the coverage area of position cluster head, calculates apart from weights and dump energy weights so that node member's distribution of cluster head is more equal
It is even, to improve node energy efficiency.
Further, Ci is the indicator function whether node i became cluster head in current period, the cluster establishment stage
Step is：
A1, traversal does not fail each and the node of Ci=1, node i generate the real number l between [0,1] at random；
The threshold value Pi of A2, calculate node i, judge the magnitude relationship of Pi and l；If l<Pi then enters step A3, otherwise turns
To step A4；
A3, node i are elected as epicycle cluster head, and Ci is set to 0；Cluster head information is elected in cluster head broadcast；Enter step A5；
The not elected epicycle cluster head of A4, node i, Ci are set to 1；Receive the elected cluster head information that all cluster heads are sent；Into step
Rapid A5；
The letter for the elected cluster head information that A5, the non-leader cluster node for not being elected as cluster head are sent according to each cluster head received
Number intensity, the cluster head of selection signal maximum intensity is as the epicycle cluster to be added；Non- leader cluster node is anti-by connectivity request message
It feeds selected cluster head；
A6, cluster head receive the connectivity request message of non-leader cluster node, and according to the quantity of cluster interior nodes, cluster head creates an announcement
Know node when can transmission data timetable, and this timetable is broadcast to the node in cluster；
Node receiving time table in A7, cluster simultaneously enters data transfer phase.
Further, the step of data transfer phase is：
Whether B1, decision node i are cluster heads；If not B2 is then entered step, if yes then enter step B3；
B2, the wireless of node in each cluster are electrically turn off until the transmission time for distributing to the node arrives；The section of Ci=1
Point sends the data packet of dump energy information to cluster head in the last one time slot of oneself；The node of Ci=0 oneself most
The data packet without dump energy information is sent in the latter time slot to cluster head, goes to step B3；
B3, cluster head open receiver and receive the data packet that cluster interior nodes are sent；Cluster head receives the number of all cluster interior nodes
According to advanced row data fusion after packet, then incidentally dump energy information it will be sent to base station；
B4, base station receive the information that cluster head is sent and the average energy for calculating Ci=1 nodes, then are broadcast to the whole network；
B5, node receive average energy necessary to calculating threshold value；
B6, a new round start, and judge whether to be the new period, and the Ci of all nodes is then reset to 1 if it is the new period,
It is transferred to step A1；If it is determined that being otherwise transferred to step B1.
Preferably, the ID and disappear for distinguishing this that cluster head information includes elected leader cluster node are elected in cluster head broadcast in step A3
Breath whether be notice information stem.
Embodiment 2
LEACH algorithms use Cycle-switching Cluster-head method, and working time unit is wheel, and each round is divided into cluster establishment stage sum number
According to transmission stage two parts.Cluster establishment stage, node i generates a positive number less than 1 at random, if it is less than threshold value Pi, that
Node i is elected as epicycle cluster head.Threshold value PiFor：
Wherein n is node total number, and desired cluster head number is k (k is custom parameter, such as k=5%*n), and r is to work as front-wheel
Number, it is a cycle to define n/k wheels.CiIt is the indicator function whether node i became cluster head in current period, i.e., if node
I did not became cluster head also in current period, then Ci=1, otherwise Ci=0.For the ease of operation and proof, (1) formula is rewritten as
(2) formula：
The ALEACH algorithms proposed there are many improved method such as Md.Solaiman Ali et al. are examined when electing cluster head
Consider dump energy, threshold value is：
However, its cluster head desired value is more than optimal cluster head number, and as wheel number increases, the ENERGY E of node iiGradually
It reduces so that PiIt is gradually reduced, this will cause desired cluster head number fewer and fewer.But ALEACH algorithms destroy
The cluster head number of LEACH verified W.Heinzelman et al. it is expected, cluster head number occurs and is passed within the same period
Subtract, the dynamic problem of zigzag wave during each week.There is no consider node residual energy when electing cluster head for LEACH algorithms
Amount, the few node of such dump energy can also be chosen as cluster head, to the cluster head energy pre-mature exhaustion, the cluster be caused to fail.
In order to solve this problem, the threshold value P of CHEEB algorithms proposed by the present inventioniIt is set as：
Because only that the node that current period does not become cluster head can also participate in election of cluster head, so energy ratio in (4) formula
The average energy of the not all nodes of denominator of the example factor, is eligible for the node average energy of election.(4) formula simultaneously
It can it is expected that cluster head number keeps k constant.Cluster head it is expected that formula is：
(4) formula substitution (5) formula is obtained：
The document studied by W.Heinzelman et al.《An application-specific protocol
architecture for wireless microsensor networks》Known to：
By (6) formula and (7) Shi Ke get:
To sum up, it has proved that the expectation of the cluster head number of CHEEB algorithms proposed by the present invention is all k, illustrates CHEEB algorithms
Maintain the optimal cluster head number of LEACH algorithms.
For node energy equilibrium, high-energy node to be allowed to be elected to cluster head, each candidate cluster head is by the address bit of itself more
It sets, dump energy, node are at a distance from cluster head and the message such as cluster head is at a distance from base station are broadcast to other nodes.Enable node i
Primary power be Ei0, the dump energy weights F (E before r takes turns sub-clusteringir) be
F(Eir) bigger, illustrate that the dump energy of the node at this moment is bigger.
Node i is to cluster head CHiCommunication range it is smaller, the energy consumption between cluster head and node is smaller；If same node i arrives
The communication range of base station BS is smaller, and the energy consumption of data transmission is also smaller.According to Free propagation energy model it is found that then comprehensive distance
Weights can be expressed as
In conjunction with formula (8), while comprehensive distance weights are added and make cluster head close proximity to base station, reduces data transmission consumption
Energy.The probability that node i becomes cluster head is calculated by formula (11).
Pi-ch=α F (Eir)+βD(vi) (11)
If α, β are to adjust residue energy of node weights and the comprehensive distance weights probability ratio shared when cluster head competes,
And alpha+beta=1.
Embodiment 3
The pseudocode of CHEEB algorithms proposed by the invention is as follows：
Embodiment 4
In order to prove effectiveness of the invention, tested using MATLAB emulation tools, compare ALEACH, EEUC and
Tri- kinds of routing algorithms of CHEEB.Specific simulation parameter is as shown in table 1.
1 parameter setting table of table
(1) network energy consumption
The height of network energy consumption directly affects the performance of routing, and network energy consumption is smaller relative to the slope of wheel number, energy consumption
With regard to smaller, energy is more efficient.Fig. 3 compares the total energy consumption that three kinds of algorithms are often taken turns, it can be seen from the figure that the energy consumption of CHEEB is equal
Less than the energy consumption of ALEACH and EEUC.Since CHEEB not only allows for the dump energy of node when electing cluster head, it is ensured that
Each round cluster head number is in expected range, so the energy of CHEEB ratio ALEACH and EEUC is more efficient.
(2) network lifecycle
Since the first round of WSN to the timing definition of first node failure be network lifecycle.Fig. 4 compares three
The network lifecycle of kind algorithm, it can be seen from the figure that the life cycle of CHEEB is longer than the Life Cycle of ALEACH and EEUC
Phase.The life cycle that the life cycle of wherein CHEEB ratios ALEACH is about 25%, CHEEB ratios EEUC is about 10%.It is saved from survival
From the point of view of the quantity of point, surviving nodes of the CHEEB when the 1000th takes turns is 90% or more, and the node of ALEACH has all failed,
The surviving node of EEUC is about 40%.This illustrates the CHEEB energy expenditures of nodes balanced well.
(3) volume of transmitted data
The collected information of sensor node will finally be sent to base station, and volume of transmitted data also becomes routing algorithm efficiency
One of index, identical in energy expenditure, volume of transmitted data is The more the better.Fig. 5 compares the data of three kinds of algorithms
Transmission quantity, it can be seen from the figure that CHEEB volumes of transmitted data are most, EEUC takes second place, and ALEACH is minimum.When all node energies
When exhausting, CHEEB is data transmission increments of the EEUC relative to ALEACH relative to the data transmission increment of ALEACH
1.5 times, illustrate the efficiency of algorithm higher of CHEEB ratio ALEACH and EEUC.
(4) cluster head distributed number
In expected range, more stable cluster head quantity will be so that load be more balanced.Fig. 6 compares the cluster of three kinds of algorithms
Head quantity, it can be seen from the figure that relative to ALEACH and EEUC, the cluster head quantity that CHEEB algorithms generate focuses more on cluster head
The desired value of quantity, main cause be propose network can relatively accurately be described based on the desired threshold value of cluster head and apart from weights
Characteristic, therefore cluster head distribution and quantity can more be stablized.
From figure 7 it can be seen that the size of cluster is integrally relatively uniform in CHEEB algorithms, while position of the cluster in application scenarios
It is relatively appropriate to set, this is all to balance leader cluster node and energy whole in the energy expenditure gap and network of non-leader cluster node
Wear rate plays certain effect
One kind that above-described embodiment only is used for further illustrating the present invention is based on the desired wireless sensor network energy of cluster head
Proportional routing optimization method is measured, but the invention is not limited in embodiments, it is every according to the technical essence of the invention to above real
Any simple modification, equivalent change and modification made by example are applied, are each fallen in the protection domain of technical solution of the present invention.
Claims (3)
1. one kind being based on the desired balancing energy of wireless sensor network routing optimization method of cluster head, which is characterized in that including：It will
The factors such as the load balancing of number of clusters mesh, residue energy of node and cluster are added in the election of cluster head, by the load distribution of sub-clustering
Two leading indicators of situation and residue energy of node as election cluster head；The working time unit of the election of the cluster head is
Wheel, each round is divided into cluster establishment stage and data transfer phase two parts, ensures each round cluster head number by adjusting threshold value
In expected range, solve the problems, such as that cluster head energy expenditure is unbalanced；By control different location cluster head coverage area, calculate away from
From weights and dump energy weights so that node member's distribution of cluster head is more uniform, to improve node energy efficiency；
The step of Ci is the indicator function whether node i became cluster head in current period, the cluster establishment stage be：
A1, traversal does not fail each and the node of Ci=1, node i generate the real number l between [0,1] at random；
The threshold value Pi of A2, calculate node i, judge the magnitude relationship of Pi and l；If l<Pi, then enter step A3, otherwise goes to step
Rapid A4；
A3, node i are elected as epicycle cluster head, and Ci is set to 0；Cluster head information is elected in cluster head broadcast；Enter step A5；
The not elected epicycle cluster head of A4, node i, Ci are set to 1；Receive the elected cluster head information that all cluster heads are sent；Enter step A5；
The signal for the elected cluster head information that each cluster head that A5, the non-leader cluster node foundation for not being elected as cluster head receive is sent is strong
Degree, the cluster head of selection signal maximum intensity is as the epicycle cluster to be added；Non- leader cluster node feeds back to connectivity request message
Selected cluster head；
A6, cluster head receive the connectivity request message of non-leader cluster node, and according to the quantity of cluster interior nodes, cluster head creates one and informs section
Point when can transmission data timetable, and this timetable is broadcast to the node in cluster；
Node receiving time table in A7, cluster simultaneously enters data transfer phase；
The calculation formula of threshold value Pi in the step A2 is：
Wherein, n indicates that node total number, r indicate that wheel number, k indicate cluster head number, EiIndicate the energy of node i,Indicate money
The node energy of lattice vote；It indicatesAverage energy；Mod is mathematic sign, indicates complementation operation；
Because only that current period also do not become cluster head node can participate in election of cluster head, so in (1) formula energy proportion because
The average energy of the not all nodes of denominator of son is eligible for the node average energy of election；(1) formula can be with simultaneously
So that it is expected that cluster head number keeps k constant；Cluster head it is expected that formula is：
(1) formula substitution (2) formula is obtained：
Known following formula：
By (4) formula and (3) Shi Ke get:
For node energy equilibrium, high-energy node to be allowed be elected to cluster head more, each candidate cluster head by the address location of itself, remain
Complementary energy, node are at a distance from cluster head and the message such as cluster head is at a distance from base station are broadcast to other nodes；Enable the initial of node i
Energy isDump energy weights before r takes turns sub-clusteringFor
Wherein,Indicate the energy of node i r wheels；Indicate the energy of node j r-1 wheels；Indicate the initial of node i
Energy；M is expressed as member node, and N (m, r-1) indicates the member node quantity of the non-cluster head before r takes turns sub-clustering；
It is bigger, illustrate that the dump energy of the node at this moment is bigger；
Node i is to cluster head CHiCommunication range it is smaller, the energy consumption between cluster head and node is smaller；If same node i is to base station
The communication range of BS is smaller, and the energy consumption of data transmission is also smaller；According to Free propagation energy model it is found that then comprehensive distance weights
It can be expressed as
Wherein, d (i, CHi) indicate node i to cluster head CHiDistance, d (i, BS) indicate node i to base station BS distance, d (j,
CHi) indicate node j to cluster head CHiDistance, d (j, BS) indicate node j to base station BS distance；
In conjunction with formula (5), while comprehensive distance weights are added and make cluster head close proximity to base station, reduces the energy of data transmission consumption
Amount；The probability that node i becomes cluster head is calculated by formula (8)：
If α, β are to adjust residue energy of node weights and the comprehensive distance weights probability ratio shared when cluster head competes, and alpha+beta
=1.
2. according to claim 1 a kind of based on the desired balancing energy of wireless sensor network routing optimality side of cluster head
Method, it is characterised in that：The step of data transfer phase is：
Whether B1, decision node i are cluster heads；If not B2 is then entered step, if yes then enter step B3；
B2, the wireless of node in each cluster are electrically turn off until the transmission time for distributing to the node arrives；The node of Ci=1 exists
The data packet of dump energy information is sent in the last one time slot of oneself to cluster head；The node of Ci=0 is in oneself last
The data packet without dump energy information is sent in a time slot to cluster head, goes to step B3；
B3, cluster head open receiver and receive the data packet that cluster interior nodes are sent；Cluster head receives the data packet of all cluster interior nodes
Advanced row data fusion afterwards, then incidentally dump energy information will be sent to base station；
B4, base station receive the information that cluster head is sent and the average energy for calculating Ci=1 nodes, then are broadcast to the whole network；
B5, node receive average energy necessary to calculating threshold value；
B6, a new round start, and judge whether to be the new period, and the Ci of all nodes is then reset to 1 if it is the new period, is transferred to
Step A1；If it is determined that being otherwise transferred to step B1.
3. according to claim 1 a kind of based on the desired balancing energy of wireless sensor network routing optimality side of cluster head
Method, it is characterised in that：The ID and disappear for distinguishing this that cluster head information includes elected leader cluster node are elected in cluster head broadcast in step A3
Breath whether be notice information stem.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510328962.4A CN104936230B (en) | 2015-06-15 | 2015-06-15 | One kind being based on the desired balancing energy of wireless sensor network routing optimization method of cluster head |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510328962.4A CN104936230B (en) | 2015-06-15 | 2015-06-15 | One kind being based on the desired balancing energy of wireless sensor network routing optimization method of cluster head |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104936230A CN104936230A (en) | 2015-09-23 |
| CN104936230B true CN104936230B (en) | 2018-07-20 |
Family
ID=54123128
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510328962.4A Active CN104936230B (en) | 2015-06-15 | 2015-06-15 | One kind being based on the desired balancing energy of wireless sensor network routing optimization method of cluster head |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104936230B (en) |
Families Citing this family (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105764108B (en) * | 2016-03-25 | 2019-02-15 | 重庆邮电大学 | A kind of weight hop count method for routing of the industry wireless network of balancing energy |
| CN105813161A (en) * | 2016-04-15 | 2016-07-27 | 深圳市国电科技通信有限公司 | Clustering routing method of micropower wireless sensor network based on energy difference |
| CN107690168B (en) * | 2016-08-04 | 2021-03-12 | 王莹莹 | Extensible networking method for wireless sensor network |
| CN106658641B (en) * | 2016-12-28 | 2020-03-27 | 上海海事大学 | Clustering routing method for distributed wireless sensor network |
| CN106921979B (en) * | 2017-03-16 | 2020-04-03 | 河海大学 | Method for constructing wireless monitoring system of wind turbine generator |
| CN107071811B (en) * | 2017-04-18 | 2019-12-27 | 长春师范大学 | WSN fault-tolerant non-uniform clustering method based on fuzzy control |
| CN107300428A (en) * | 2017-06-28 | 2017-10-27 | 武汉万千无限科技有限公司 | A kind of automatic continuous measuring system of rotary spherical digester temperature based on internet-based control |
| CN107371124A (en) * | 2017-07-29 | 2017-11-21 | 陈剑桃 | A kind of public safety monitoring system on micro explosive |
| CN108107748B (en) * | 2018-01-19 | 2018-12-11 | 赵一然 | A kind of smart home environment control system |
| CN108521661B (en) * | 2018-04-15 | 2019-11-05 | 佛山市虚拟现实大数据产业研究院有限公司 | A kind of wireless sensor network routing method based on block chain technology |
| CN109257114B (en) * | 2018-09-28 | 2021-09-28 | 天津大学 | Effective route design method based on evidence theory |
| CN110662190B (en) * | 2019-09-19 | 2021-07-13 | 北京交通大学 | Dynamic clustering LEACH method in wireless sensor network |
| CN111711930B (en) * | 2020-06-04 | 2023-03-24 | 中国联合网络通信集团有限公司 | Cluster head election method, system, terminal equipment and computer readable storage medium |
| CN112929991B (en) * | 2021-02-10 | 2022-12-23 | 上海工程技术大学 | Sensor management method, device, equipment and storage medium |
| CN113596950B (en) * | 2021-07-12 | 2023-03-14 | 南昌大学 | Energy-balanced non-equilibrium clustering method for circular wireless sensor network |
| CN113993177A (en) * | 2021-11-19 | 2022-01-28 | 江苏科技大学 | Game theory-based energy consumption balancing wireless sensor network clustering routing method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101594657A (en) * | 2009-06-25 | 2009-12-02 | 北京航空航天大学 | In the radio sensing network based on the election of cluster head method of soft-threshold |
| CN102149160A (en) * | 2011-04-20 | 2011-08-10 | 宁波职业技术学院 | Energy perception routing algorithm used for wireless sensing network |
| CN103209455A (en) * | 2013-01-06 | 2013-07-17 | 南昌大学 | Wireless sensor network routing method based on node position information |
| CN104486715A (en) * | 2014-11-26 | 2015-04-01 | 南京邮电大学 | Mobile sensor network clustering method based on geographical position information |
-
2015
- 2015-06-15 CN CN201510328962.4A patent/CN104936230B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101594657A (en) * | 2009-06-25 | 2009-12-02 | 北京航空航天大学 | In the radio sensing network based on the election of cluster head method of soft-threshold |
| CN102149160A (en) * | 2011-04-20 | 2011-08-10 | 宁波职业技术学院 | Energy perception routing algorithm used for wireless sensing network |
| CN103209455A (en) * | 2013-01-06 | 2013-07-17 | 南昌大学 | Wireless sensor network routing method based on node position information |
| CN104486715A (en) * | 2014-11-26 | 2015-04-01 | 南京邮电大学 | Mobile sensor network clustering method based on geographical position information |
Non-Patent Citations (1)
| Title |
|---|
| WSN中基于权值的Leach协议的研究与改进;张辉;《微计算机信息》;20101130;第26卷(第22期);第1-2章 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104936230A (en) | 2015-09-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104936230B (en) | One kind being based on the desired balancing energy of wireless sensor network routing optimization method of cluster head | |
| Ghaleb et al. | A survey of limitations and enhancements of the ipv6 routing protocol for low-power and lossy networks: A focus on core operations | |
| CN106454905B (en) | A kind of improved wireless sense network hierarchical multichain path method | |
| CN107360612B (en) | A kind of data transmission method of the wireless sensor network based on ant colony multipath | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN104618997A (en) | Data aggregation method based on non-uniform grids | |
| CN106304243A (en) | A kind of wireless sensor network topology control method based on gesture game | |
| CN103298032A (en) | Node energy consumption balancing method for wireless sensor network | |
| CN104284386B (en) | Wireless sensor network cluster head selection method based on betweenness | |
| CN109673034A (en) | A kind of wireless sensor network cluster routing method that must be searched for based on longicorn | |
| CN108521633A (en) | Minepit environment wireless sense network cluster routing method based on K mean values | |
| Tong et al. | A cross unequal clustering routing algorithm for sensor network | |
| CN105848238A (en) | IPv6 routing method of wireless sensor networks based on multiple parameters | |
| CN105813161A (en) | Clustering routing method of micropower wireless sensor network based on energy difference | |
| Rahama et al. | A routing protocol for improving energy efficiency in wireless sensor networks | |
| CN104994020A (en) | Predictive energy-efficient clustering routing method based on bee colony optimization algorithm model | |
| Kang et al. | On the lifetime extension of energy-efficient multihop broadcast networks | |
| CN105979539A (en) | Fuzzy logic based clustering method in mobile self-organizing network | |
| CN108566658A (en) | A kind of cluster algorithm of Energy Consumption in Wireless Sensor Networks equilibrium | |
| Choi et al. | Regional clustering scheme in densely deployed wireless sensor networks for weather monitoring systems | |
| CN106686652B (en) | Wireless sensor network topology control method | |
| CN110049465A (en) | A kind of water area monitoring communication means based on WSN | |
| Zytoune et al. | Stochastic low energy adaptive clustering hierarchy | |
| Qin et al. | A dynamic unequal energy efficient clustering in wireless sensor network | |
| CN104994557B (en) | Cluster algorithm based on dynamic grid and data fusion |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |