CN104093196B - LEACH alternating time dynamic optimization method based on energy consumption - Google Patents
LEACH alternating time dynamic optimization method based on energy consumption Download PDFInfo
- Publication number
- CN104093196B CN104093196B CN201410320567.7A CN201410320567A CN104093196B CN 104093196 B CN104093196 B CN 104093196B CN 201410320567 A CN201410320567 A CN 201410320567A CN 104093196 B CN104093196 B CN 104093196B
- Authority
- CN
- China
- Prior art keywords
- cluster
- energy
- node
- round
- centerdot
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000005265 energy consumption Methods 0.000 title claims abstract description 18
- 238000005457 optimization Methods 0.000 title claims abstract description 12
- 230000005540 biological transmission Effects 0.000 claims description 23
- 241000854291 Dianthus carthusianorum Species 0.000 claims description 21
- 241000209094 Oryza Species 0.000 claims description 8
- 235000007164 Oryza sativa Nutrition 0.000 claims description 8
- 235000009566 rice Nutrition 0.000 claims description 8
- 238000006116 polymerization reaction Methods 0.000 claims description 7
- 230000008569 process Effects 0.000 claims description 7
- 230000005059 dormancy Effects 0.000 claims description 4
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 claims description 3
- IRLXSDZTLYOBQH-WOUKDFQISA-N [(2r,3s,4r,5r)-3,4-dihydroxy-5-imidazo[2,1-f]purin-3-yloxolan-2-yl]methyl dihydrogen phosphate Chemical compound O[C@@H]1[C@H](O)[C@@H](COP(O)(O)=O)O[C@H]1N1C(N=CN2C=CN=C22)=C2N=C1 IRLXSDZTLYOBQH-WOUKDFQISA-N 0.000 claims description 2
- 230000002035 prolonged effect Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 16
- 230000006872 improvement Effects 0.000 description 11
- 238000004891 communication Methods 0.000 description 3
- 230000002045 lasting effect Effects 0.000 description 3
- 238000011017 operating method Methods 0.000 description 3
- 230000021715 photosynthesis, light harvesting Effects 0.000 description 3
- 230000004913 activation Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000002474 experimental method Methods 0.000 description 2
- 230000004927 fusion Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000001902 propagating effect Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000010835 comparative analysis Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000003032 molecular docking Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000004083 survival effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Classifications
-
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to an LEACH alternating time dynamic optimization method based on energy consumption and belongs to the technical field of the wireless sensor network. The LEACH alternating time dynamic optimization method based on energy consumption includes the following steps of calculating energy consumption of nodes in an LEACH protocol every turn firstly, calculating the time of duration of each turn according to the energy consumption of the turn, and dynamically adjusting the time of duration of clusters every turn according to the principle of balance of the energy consumption of the turns. By applying the alternating time dynamic optimization method based on energy consumption to the LEACH protocol, the cluster selection period can be effectively optimized, inter-node energy consumption can be effectively balanced, and the life cycle of the network can be effectively prolonged.
Description
Technical field
The present invention relates to a kind of dynamic optimization method of the Leach rotation times based on energy consumption, belongs to wireless sensor network
Network technical field.
Background technology
It is problem important in a radio sensing network to extend Network morals.Many scholars it is also proposed a lot
Energy-efficient agreement is extending the life cycle of radio sensing network.At present, the equilibrium of energy is realized by network cluster dividing
Realize extending the focus direction that network lifecycle is research with this.LEACH algorithms are proposed most by Heinzelman et al.
The popular energy-efficient communication protocol based on sub-clustering, agreement to node by carrying out sub-clustering and loading to balancing energy respectively
In individual cluster to reduce network in gross energy consumption.In order to ensure the equilibrium of energy is consumed, LEACH is periodically in all nodes
It is middle to randomly choose node to serve as cluster head.LEACH agreements are realized with " wheel ".Each wheel includes：Establishment stage and stable
Operation phase.Establishment stage will complete the selection of leader cluster node, the broadcast of leader cluster node, the cluster of the addition of non-leader cluster node and be formed
Process and leader cluster node are the TDMA scheduling processes that member distributes tdma slot in cluster；In stable operation stage, cluster head receives
From its member message and by the data is activation after polymerization to base station.However, many parameters of LEACH can affect agreement
Performance, these parameters have to be optimized, e.g., threshold values, the number of cluster etc..Therefore, many scholars are devoted to optimize LEACH's
Parameter is improving the performance of LEACH.Although many people have done different optimizations to LEACH, each wheels of LEACH it is lasting when
Between but few people research.The length of each wheel duration is very crucial for the whole performance of network.If the time is too
Long, then cluster head is just in for a long time active state, what the energy of leader cluster node will be quickly is exhausted；If the time is too
Short, the selection of cluster head excessively frequently results in excessive energy dissipation in cluster establishment stage, because this stage is will not to send number
According to.
The content of the invention
The invention aims to overcome the defect that prior art is present, it is proposed that a kind of Leach based on energy consumption takes turns
Change time dynamic optimization method.
Idea of the invention is that according to cluster interior nodes quantity and the difference of energy ezpenditure, dynamic adjustment often take turns it is lasting when
Between, optimized with this LEACH the energy ezpenditure selected between cluster cycle, balance nodes, extend network life cycle.
The purpose of the present invention is achieved through the following technical solutions：
A kind of LEACH rotation time dynamic optimization methods based on energy consumption, comprise the following steps：
Step one, calculating LEACH agreements interior joint often take turns energy ezpenditure, including herein below：
1.1st step：The energy ezpenditure of cluster head node in often taking turns is calculated according to following formula：
Ei_CH/round=Ei_CH/frame×Nframes/round； (2)
Wherein Ei_CH/frameRepresent the energy ezpenditure of every frame of leader cluster node, Ei_CH/roundRepresent the energy that leader cluster node is often taken turns
Amount is consumed, niThe number of nodes that cluster i is included is represented, l represents bit number contained in each packet, EelecRepresent that propagating one compares
Special data institute consumed energy, EDARepresent energy needed for one bit data of polymerization, di_toBSLeader cluster node i is represented to the distance of base station,
εampRepresent and work as d >=d0When radio frequency amplifier transmit 1bit unit square rice square energy for being consumed, d0For the valve for presupposing
Value distance, Nframes/roundRepresent the quantity for often taking turns transmitting data frame；
1.2nd step：The energy ezpenditure of non-cluster head node in often taking turns is calculated according to following formula：
Ek_non-CH/round=Ek_non-CH/frame×Nframes/round； (4)
Wherein Ek_non-CH/frameRepresent the energy ezpenditure of every frame of member node in cluster, dk_toCHRepresent member node k in cluster
To the distance of cluster head node, εfsRepresent and work as d ＜ d0When the emission amplifier transmission energy that consumed of 1bit unit square rice,
Ek_non-CH/roundRepresent the energy ezpenditure that member node is often taken turns in cluster；
Step 2, calculating LEACH agreements are often taken turns the duration, including herein below：
2.1st step：The gross energy that cluster i is consumed in often taking turns is calculated according to following formula：
Wherein, Ei_totalRepresent the energy ezpenditure that cluster i often takes turns；
2.2nd step：The data volume of cluster i transmission in often taking turns is calculated according to following formula：
2.3rd step：The duration of each wheel is calculated according to following formula：
Wherein rbFor bit rate；
The duration that step 3, each cluster of dynamic adjustment are often taken turns, including herein below：
3.1st step：Further calculate energy ezpenditures of the cluster i in a wheel：
The energy ezpenditure often taken turns by the cluster i of formula (7) is：
3.2nd step：The often wheel duration of each cluster of dynamic adjustment, including content once：
When the conduct maximum cluster that cluster internal segment points are most, dump energy is maximum is found out in each cluster of front-wheel, cluster j, cluster j are designated as
Often wheel duration tj_roundAdjust according to formula (10), the time of other clusters adjusts according to formula (11)：
tj_round=tround(Enj_current/Enj_init)；(10)
By tj_roundBe set as each node selects cluster cycle, the often wheel duration t that non-maximum cluster specifies at iti_round
Inside carry out data transmission, after end of transmission in the time of regulation, dormancy tj_round-ti_roundTime to save node energy, so
Enter next round process together with maximum cluster node afterwards.
Beneficial effect
The traditional LEACH agreements of contrast, according to the cluster rotation time dynamic adjusting method that the present invention is provided, can be effectively
The energy ezpenditure of balanced net interior nodes, extends the quantity of network life cycle and base station receive information bag；Additionally, the method is suitable
The all basic LEACH agreements fixed for the current wheel time for proposing and its improved protocol, it is applied widely.
Description of the drawings
Fig. 1 is LEACH agreement topology diagrams.
Fig. 2 is the flow chart of the inventive method.
Fig. 3 is the comparison diagram of life cycle in the case of different rotation times in the scene of 50,100,200 nodes.
Fig. 4 is the comparison diagram of the node life span of 100 node scenes under different rotation times.
Fig. 5 is the comparison diagram of the rate of energy dissipation of 100 node scenes under different rotation times.
Fig. 6 is the comparison diagram of the base station receiving data amount of 100 node scenes under different rotation times.
When Fig. 7 is 20s for rotation time, comparison diagram of the LEACH algorithms before and after improvement in network life cycle.
When Fig. 8 is 20s for rotation time, comparison diagram of the LEACH algorithms before and after improvement in node life span.
When Fig. 9 is 20s for rotation time, comparison diagram of the LEACH algorithms before and after improvement in node average energy consumption.
When Figure 10 is 20s for rotation time, comparison diagram of the LEACH algorithms before and after improvement in the receiving data amount of base station.
When Figure 11 is 20s for rotation time, the LEACH algorithms before and after improvement are in first node death time and a half-section
Comparison diagram on the point death time.
Specific embodiment
With reference to the accompanying drawings and examples the present invention will be further described.
The LEACH agreements topological diagram of the present invention as shown in figure 1, each leader cluster node is in communication with each other with base station, each cluster interior nodes
It is in communication with each other with leader cluster node in this cluster.The principle, implementation process and assessment result of the inventive method is described below.
The flow chart of the inventive method is as shown in Fig. 2 principle is as follows：
Step one, calculating LEACH agreements interior joint often take turns energy ezpenditure：
Its operating procedure includes the 1.1st and 1.2 steps, specially：
1.1st step：Calculate in often taking turns, the energy ezpenditure of cluster head node：
Due to base station it is far from sensitive zones, it is believed that this distance be far longer than energy transmission consumption it is critical away from
From, therefore the consumption of energy follows multichannel consumption models.The energy ezpenditure of leader cluster node is mainly used in receiving member node transmission
Data and by the data is activation after polymerization to base station, so the consumption of leader cluster node energy is shown below：
Ei_CH/round=Ei_CH/frame×Nframes/round (2)
Wherein Ei_CH/frameRepresent the energy ezpenditure of every frame of leader cluster node, Ei_CH/roundRepresent the energy that leader cluster node is often taken turns
Amount is consumed, niThe number of nodes that cluster i is included is represented, l represents bit number contained in each packet, EelecRepresent that propagating one compares
Special data institute consumed energy, EDARepresent energy needed for one bit data of polymerization, di_toBSLeader cluster node i is represented to the distance of base station,
εampRepresent and work as d >=d0When radio frequency amplifier transmit 1bit unit square rice square energy for being consumed, d0For the valve for presupposing
Value distance, Nframes/roundRepresent the quantity for often taking turns transmitting data frame.
1.2nd step：Calculate in often taking turns, the energy ezpenditure of non-cluster head node：
Member node is only responsible for passing data to corresponding cluster head node in cluster.It is considered that in cluster member node with
The distance between corresponding cluster head node is relatively short, then the consumption of energy follows Friss free-space models.So cluster
The consumption of interior member node energy is shown below：
Ek_non-CH/round=Ek_non-CH/frame×Nframes/round (4)
Wherein Ek_non-CH/frameRepresent the energy ezpenditure of every frame of member node in cluster, dk_toCHRepresent member node k in cluster
To the distance of cluster head node, εfsRepresent and work as d ＜ d0When the emission amplifier transmission energy that consumed of 1bit unit square rice,
Ek_non-CH/roundRepresent the energy ezpenditure that member node is often taken turns in cluster.
Step 2, calculating LEACH agreements are often taken turns the duration：
On the basis of step one operation, further calculate LEACH agreements and often take turns the duration, its operating procedure includes the
2.1 steps to the 2.3rd step, specially：
2.1st step：Calculate the gross energy that cluster i is consumed in often taking turns：
After the energy ezpenditure that member node is often taken turns in leader cluster node and cluster is drawn, we can be drawn a rotation week
The gross energy that interim cluster i is consumed：
Wherein, Ei_totalRepresent the energy ezpenditure that cluster i often takes turns.
2.2nd step：Calculate the data volume of cluster i transmission in often taking turns：
Can be obtained by formula (5), in a rotational cycle, the data volume of cluster i transmission is：
2.3rd step：Calculate the duration of each wheel：
Assume rbFor bit rate, this is the parameter just set before algorithm starts, then in the time slot for being distributed,
The data of node-node transmission l bits take and areThen one contains niThe cluster of individual node transmits the when that a frame data to be consumed
Between beThen cluster i works the time of a cycle：
The duration that step 3, each cluster of dynamic adjustment are often taken turns：
On the basis of step 2, each cluster according to energy ezpenditure and the difference of cluster interior nodes quantity, often hold for dynamic adjustment by wheel
Continuous time, its operating procedure includes the 3.1st and 3.2 steps, specially：
3.1st step：Further calculate energy ezpenditures of the cluster i in a wheel：
From formula (7), the energy ezpenditure that cluster i often takes turns is：
For the energy ezpenditure between balanced each cluster, when needing the often wheel for dynamically adjusting each cluster according to number of nodes to continue
Between.
3.2nd step：The often wheel duration of each cluster of dynamic adjustment：
Order is set { n when the interstitial content of each cluster of front-wheel1,n2,…,nk, wherein i=1,2 ..., k, k are when front-wheel
Cluster head number.Assume that cluster j is maximum cluster, its contained nodes is nj=max { n1,n2,…,nk, if the nodes of multiple clusters
It is nj, then the conduct maximum cluster that dump energy in cluster is maximum is selected.The initial wheel set of time of maximum cluster is tround, this is institute
There is the fiducial time of cluster reference.Cluster i is n comprising node numberi, its wheel time is ti_round, to make node energy ezpenditure equal
Weighing apparatus, therefore make the average energy consumption of member node in cluster equal, there is following formula：
Formula (8) is brought in formula (9), can be according to fiducial time troundThe often wheel time for drawing the i-th cluster is ti_round, examine
Considering the duration of often taking turns of each cluster in network should be reduced as the dump energy of each cluster is reduced, therefore, the often wheel of maximum cluster j
Duration tj_roundAdjust according to formula (10), similar, the wheel time t of other clustersi_roundAdjust according to formula (11)：
tj_round=tround(Enj_current/Enj_init) (10)
From above formula, different cluster often takes turns the difference that the duration is all quantity with cluster interior nodes and dump energy
And change, doing so can make the ratio that the node energy in network is consumed more uniform in a wheel.But LEACH protocol requirements
Each node selects the cluster cycle consistent, therefore we select the wheel time t of maximum cluster jj_roundThe cluster cycle is selected for each node,
The often wheel duration t that remaining cluster specifies at iti_roundInside carry out data transmission, after end of transmission in the time of regulation,
Can dormancy tj_round-ti_roundTime, to save node energy, until be waken up carry out next round select cluster.
The implementation process of the inventive method is as follows：
Step one, the original LEACH protocol codes of modification：
As shown in Fig. 2 making improvements to former LEACH agreements.After improvement, we can be on network analog platform NS2
Emulation experiment is carried out to improved LEACH algorithms.
LEACH Routing Protocols after improvement one wheel in workflow be：
1. before algorithm starts, is set for t the initial wheel timeround；
2. between each node random selection 0-1 is worth, if selected value is less than some threshold values, then this
Node becomes leader cluster node；After selected leader cluster node, whole network is informed by broadcast；Other nodes in network are according to reception
The signal strength signal intensity of information determines the cluster of subordinate, and is sent to addition information, and this packet contains node ID, node location and node
Dump energy；
3. remaining gross energy and nodes information of the leader cluster node to all member nodes in base station repeats cluster；
4. base station is descending to cluster sequence according to nodes and remaining gross energy according to all cluster information collected,
And elect the cluster for ranking the first as maximum cluster, the cluster number of the maximum cluster of note is j；
5. base station adjusts the epicycle duration of maximum cluster according to the remaining gross energy of maximum cluster using following formula dynamic：
tj_round=tround(Ej_current/Ej_init)
Wherein, troundOn the basis of take turns the time, tj_roundIt is cluster j in the duration of epicycle, Ej_currentFor the residue of cluster j
Gross energy, Ej_initFor the initial total energy of cluster j；
Data transmission period of other clusters in epicycle is adjusted using following formula dynamic：
Wherein, ti_roundFor cluster i epicycle data transmission period, tj_roundIt is cluster j in the duration of epicycle,
Ei_currentFor the remaining gross energy of cluster i, Ei_initFor the initial total energy of cluster i, niFor the nodes that cluster i is included, njFor cluster j bags
The nodes for containing, EelecRepresent and propagate the energy that a bit data is consumed, EDAEnergy needed for one bit data of polymerization is represented,
di_toBSRepresent the distance of the leader cluster node of cluster i to base station, dk_toCHMember node k in cluster is represented to the distance of cluster head node, εamp
Represent and work as d >=d0When radio frequency amplifier transmit 1bit unit square rice square energy for being consumed, d0For the threshold values that presupposes away from
From εfsRepresent and work as d ＜ d0When the radio frequency amplifier transmission energy that consumed of 1bit unit square rice；
6. base station is by ti_roundAnd tj_roundBeam back the leader cluster node of each cluster；
7. the leader cluster node of maximum cluster is in tj_roundTDMA scheduling is carried out in time, is that each member node distributes data in cluster
Transmission time slot；The leader cluster node of other clusters is in ti_roundTDMA scheduling is carried out in time, is that each member node distributes data in cluster
Transmission time slot；
8. in each cluster member node in the time slot that leader cluster node is its distribution to cluster head transmission data, leader cluster node docking
The data for receiving carry out communicating information to base station after data fusion again；
9. each cluster i is through ti_roundAfter time, dormancy tj_round-ti_roundIt is waken up after time；Hereafter the whole network enters new
The cluster of one wheel is set up and stable operation stage, goes to step 2 and restarts, until the remaining node number of the whole network is less than set value
k。
Step 2, the corresponding experiment parameter of setting：
The present invention tests scene：In the range of 100 × 100m, 50,100 or 200 nodes of random distribution, base station position
In the position of (50,175).The primary power of base station is unlimited, and the primary power of ordinary node is 2mJ, and subsequently can not
Supply.Radio reception data consumed energy EelecIt is set to calculating energy needed for 50nJ/bit, data fusion and is set to 5nJ/
Bit, cluster head ratio N/k is 5%, and data package size l is 4000bits, bit rate RbFor 1Mbps, the energy of radio frequency amplifier
εampAnd εfsRespectively 0.0013pJ/bit/m4And 10pJ/bit/m2。
Step 3, operation agreement, analyze its performance：
With reference to Fig. 3, the network lifecycle of LEACH innovatory algorithms under different rotation times is drawn.It can be seen that
In the case of identical network configuration, the quantity of node is different, and the position that the peak value of network lifecycle occurs is just different, and
And the morning that the few peak value of node occurs, the evening that the peak value more than node occurs.This is because increasing with number of nodes, generation contains
The probability of the cluster more than cluster interior nodes will increase, according to set forth herein dynamic adjustment often take turns the algorithm of duration, it should it is suitable
Just establish the cluster time when increasing, to realize that it is uniform that node energy is consumed.It can be seen that peak value respectively appear in 16s,
20s and 26s.
With reference to Fig. 4, in the case of drawing different initial rotation times, the Survival of nodes.As can be seen that
When cluster set of time of just establishing is 20s, node death rate is most slow, even if it can also be seen that the cluster time of just establishing has from figure
Changed, but the time of occurrence difference of first death nodes is not very big, this is because, using the dynamic wheel time
LEACH consultations are often taken turns the duration according to the residue of node and the energy of consumption come dynamic adjustment, after some wheels, are taken turns
Time can be adjusted to level proper under present energy environment, the energy ezpenditure of the balanced node of this meeting, delay first
The generation time of death nodes.
With reference to Fig. 5, the situation of 100 meshed network energy ezpenditures is drawn, it can be seen that establishing originally the cluster time
When being set to 20s, energy ezpenditure it is most slow.And can also find out when network energy is low-down, network can also continue fortune
Row longer period of time, this is because taking dynamic changes the method for often taking turns the time, when energy is reduced to a certain extent, often takes turns
Duration reduced a lot, this results in node energy and can reduce slowly, therefore depleted in network energy
When, moreover it is possible to run longer period of time.
With reference to Fig. 6, drawing in the case of establish at the beginning of the difference cluster time, the comparison of the data packet number that base station receives,
It can be seen that the data packet number that base station receives when the cluster time of just establishing being 20s is most.If often take turns lasting
Between arrange it is long, cluster head node energy consume it is too fast and dead, then at leader cluster node, the data of polymerization will tail off, from
And the data that base station receives will tail off.If it is too short often to take turns the duration, then has excessive energy dissipation and is selecting cluster rank
Section, and in this stage, node never sends data, reduces so as to cause base station to receive data.
The performance of the LEACH algorithms before and after step 4, comparative analysis improvement：
From the simulation result of former LEACH agreements it is found that in the scene of 100 nodes, former LEACH agreements are first
When beginning rotation time is 20s, network life cycle is most long.It is therefore desirable to doing one when it is 20s to promote rotation time to both
Lower performance comparison analysis.Contrasted for convenience, we are referred to as S-LEACH (Static LEACH) and calculate the algorithm before optimization
Method, the algorithm after optimization is referred to as D-LEACH (Dynamic LEACH), and we are mainly the energy of the life cycle to node, node
Death time of data volume, first node and half node that amount consumption, base station receive etc. is analyzed.
Comparison diagram with reference to Fig. 7, S-LEACH and D-LEACH on network lifecycle, it can be seen that D-LEACH algorithms
It is set it is various just establish under the cluster time, network lifecycle all has a larger improvement than S-LEACH algorithm, and
In the case of 100 nodes, both peak values appear at build the cluster time for 20s when.
Comparison diagram with reference to Fig. 8, S-LEACH and D-LEACH in node rate of death, it can be seen that the life of D-LEACH
The life cycle is longer than S-LEACH by 40% or so, and when there is first node death, S-LEACH is in general 200 wheels
Afterwards network is completely dead, but D-LEACH has but used 250 wheels, this is because the often wheel duration of D-LEACH is with cluster
What dump energy and cluster interior nodes number dynamic were adjusted, with the continuous death of node, the number of cluster interior nodes relative can be reduced,
The duration often taken turns also can relative drop, thus can allow node energy reduce it is relatively slow, therefore occur section
D-LEACH can also be continued for some time more than S-LEACH when point is dead.
Comparison diagram with reference to Fig. 9, S-LEACH and D-LEACH in average energy consumption, it is found that the energy of D-LEACH
Amount consumes slower than S-LEACH, and the slope of S-LEACH is substantially constant in whole network life cycle, but D-LEACH exists
510s front slopes are constantly to reduce, and this has been declined due to the energy ezpenditure of node, often taking turns the duration, this certainty
Energy ezpenditure can be reduced, but between 510s to 600s, the energy ezpenditure of D-LEACH is accelerated suddenly, this is because, D-
LEACH in 510s, first node death, and the threshold values of D-LEACH chooses formula based on dump energy, over time
Propulsion, residue energy of node can cause the threshold values of node smaller than relatively low, and node is chosen as the probability of cluster head and just compares
Little, when dead without node, but this consequence is not also it is obvious that when having node dead, can be chosen as
The quantity of leader cluster node is just less, when the elected cluster head of no node in a network, or node are not added in any cluster,
Node all directly can send information to base station, and this process can consume substantial amounts of energy.Therefore energy ezpenditure can be caused to increase
Than very fast.And when 600s, the energy ezpenditure of node can slow down, this is because, the average residual energy comparison of node
It is low, cause the duration of every wheel very short, node often takes turns the energy of consumption just seldom, therefore can also continue longer period of time.
With reference to comparison diagram in terms of the data volume that base station receives of Figure 10, S-LEACH and D-LEACH, from figure in,
The data volume that D-LEACH is received is compared with S-LEACH and remained basically stable, but the growth rate of data volume is smaller, this be because
For in order to allow, node energy is balanced to be consumed D-LEACH, and the often wheel duration containing the few cluster of node will be lacked, transmission
Data volume will be reduced accordingly, this can cause whole network often take turns transmission data total amount it is fewer than S-LEACH, and with when
Between passage, the slope of D-LEACH slowly reduces, and during to about 640s, data volume no longer increases, although network also is continuing to transport
OK, due effect but is not played, therefore is one can consider that in the current situation, the life cycle of D-LEACH is
640s。
With reference to Figure 11, S-LEACH and D-LEACH at first node death time and the aspect of half node death time two
Comparison diagram, it can be seen that first node of D-LEACH dead time is late than S-LEACH a lot, this is because D-
The balanced consumption of node energy of LEACH algorithms, this can significantly postpone first node dead time.It is dead in half node
Under the contrast of time, D-LEACH is also better than S-LEACH, but it has also been discovered that, differ between the HNA and FND of D-LEACH
It is less, this is because due to even energy consumption, occur first node it is dead when, the energy level of other nodes
Also it is decreased a lot, therefore the dead ratio S-LEACH of part of nodes is fast.
In sum, the present invention is better than original LEACH agreements in multinomial performance index.Above-described specific descriptions are right
The purpose of invention, technical scheme and beneficial effect are further described, and be should be understood that and be the foregoing is only this
The specific embodiment of invention, the protection domain being not intended to limit the present invention, it is all within the spirit and principles in the present invention,
Any modification, equivalent substitution and improvements done etc., should be included within the scope of the present invention.
Claims (1)
1. a kind of LEACH rotation time dynamic optimization methods based on energy consumption, it is characterised in that comprise the following steps：
Step one, calculating LEACH agreements interior joint often take turns energy ezpenditure, including herein below：
1.1st step：The energy ezpenditure of cluster head node in often taking turns is calculated according to following formula：
Ei_CH/round=Ei_CH/frame×Nframes/round； (2)
Wherein Ei_CH/frameRepresent the energy ezpenditure of every frame of leader cluster node, Ei_CH/roundRepresent that the energy that leader cluster node is often taken turns disappears
Consumption, niThe number of nodes that cluster i is included is represented, l represents bit number contained in each packet, EelecRepresent and propagate a bit number
According to institute's consumed energy, EDARepresent energy needed for one bit data of polymerization, di_toBSLeader cluster node i is represented to the distance of base station, εamp
Represent and work as d >=d0When radio frequency amplifier transmit 1bit unit square rice square energy for being consumed, d0For the threshold values that presupposes away from
From Nframes/roundRepresent the quantity for often taking turns transmitting data frame；
1.2nd step：The energy ezpenditure of non-cluster head node in often taking turns is calculated according to following formula：
Ek_non-CH/round=Ek_non-CH/frame×Nframes/round； (4)
Wherein Ek_non-CH/frameRepresent the energy ezpenditure of every frame of member node in cluster, dk_toCHMember node k is represented in cluster to cluster
The distance of head node, εfsRepresent and work as d ＜ d0When the emission amplifier transmission energy that consumed of 1bit unit square rice, Ek_non-CH/round
Represent the energy ezpenditure that member node is often taken turns in cluster；
Step 2, calculating LEACH agreements are often taken turns the duration, including herein below：
2.1st step：The gross energy that cluster i is consumed in often taking turns is calculated according to following formula：
Wherein, Ei_totalRepresent the energy ezpenditure that cluster i often takes turns；
2.2nd step：The data volume of cluster i transmission in often taking turns is calculated according to following formula：
2.3rd step：The duration of each wheel is calculated according to following formula：
Wherein rbFor bit rate；
The duration that step 3, each cluster of dynamic adjustment are often taken turns, including herein below：
3.1st step：Further calculate energy ezpenditures of the cluster i in a wheel：
The energy ezpenditure often taken turns by the cluster i of formula (7) is：
3.2nd step：The often wheel duration of each cluster of dynamic adjustment, including herein below：
When the conduct maximum cluster that cluster internal segment points are most, dump energy is maximum is found out in each cluster of front-wheel, cluster j is designated as, cluster j's is every
Wheel duration tj_roundAdjust according to formula (10), the time of other clusters adjusts according to formula (11)：
tj_round=tround(Ej_current/Ej_init)； (10)
Wherein troundOn the basis of take turns the time, Ej_currentFor the remaining gross energy of cluster j, Ej_initFor the initial total energy of cluster j；
Ei_currentFor the remaining gross energy of cluster i, Ei_initFor the initial total energy of cluster i, njFor the nodes that cluster j is included, dj_toBSRepresent
Distance of the leader cluster node of cluster j to base station；
By tj_roundBe set as each node selects cluster cycle, the often wheel duration t that non-maximum cluster specifies at iti_roundInside enter
Row data transfer, after end of transmission in the time of regulation, dormancy tj_round-ti_roundTime is saving node energy, Ran Houyu
Maximum cluster node enters together next round process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410320567.7A CN104093196B (en) | 2014-07-07 | 2014-07-07 | LEACH alternating time dynamic optimization method based on energy consumption |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410320567.7A CN104093196B (en) | 2014-07-07 | 2014-07-07 | LEACH alternating time dynamic optimization method based on energy consumption |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104093196A CN104093196A (en) | 2014-10-08 |
| CN104093196B true CN104093196B (en) | 2017-05-10 |
Family
ID=51640863
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410320567.7A Expired - Fee Related CN104093196B (en) | 2014-07-07 | 2014-07-07 | LEACH alternating time dynamic optimization method based on energy consumption |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104093196B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104378812B (en) * | 2014-11-28 | 2017-09-29 | 北京农业信息技术研究中心 | Farmland self-organizing network regenerative resource node difference topology control method |
| CN108307471B (en) * | 2018-01-12 | 2020-09-25 | 武汉大学 | Energy balance cluster head node selection method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7035240B1 (en) * | 2000-12-27 | 2006-04-25 | Massachusetts Institute Of Technology | Method for low-energy adaptive clustering hierarchy |
| CN102256267A (en) * | 2010-05-19 | 2011-11-23 | 北京兴科迪科技有限公司 | Energy priority node clustering method for wireless sensor network |
| CN102497679A (en) * | 2011-12-20 | 2012-06-13 | 山东大学 | Static clustering algorithm for wireless sensor network |
| CN102547904A (en) * | 2012-02-28 | 2012-07-04 | 山东大学 | Leach protocol-based cluster head election improved algorithm |
| CN103024849A (en) * | 2012-09-27 | 2013-04-03 | 西安电子科技大学 | LEACH (Low-energy Adaptive Clustering Hierarchy)-based wireless sensor network clustering method |
-
2014
- 2014-07-07 CN CN201410320567.7A patent/CN104093196B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7035240B1 (en) * | 2000-12-27 | 2006-04-25 | Massachusetts Institute Of Technology | Method for low-energy adaptive clustering hierarchy |
| CN102256267A (en) * | 2010-05-19 | 2011-11-23 | 北京兴科迪科技有限公司 | Energy priority node clustering method for wireless sensor network |
| CN102497679A (en) * | 2011-12-20 | 2012-06-13 | 山东大学 | Static clustering algorithm for wireless sensor network |
| CN102547904A (en) * | 2012-02-28 | 2012-07-04 | 山东大学 | Leach protocol-based cluster head election improved algorithm |
| CN103024849A (en) * | 2012-09-27 | 2013-04-03 | 西安电子科技大学 | LEACH (Low-energy Adaptive Clustering Hierarchy)-based wireless sensor network clustering method |
Non-Patent Citations (1)
| Title |
|---|
| an optimal solution for round rotation time setting in LEACH;Hongyan Zhang et.al;《International Conference on Wireless Algorithm，Systems，and Applications》;20130810;第366-376页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104093196A (en) | 2014-10-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Junping et al. | A time-based cluster-head selection algorithm for LEACH | |
| Mottaghi et al. | Optimizing LEACH clustering algorithm with mobile sink and rendezvous nodes | |
| CN107529201A (en) | A kind of wireless sensor network data transmission method based on LEACH agreements | |
| CN109673034A (en) | A kind of wireless sensor network cluster routing method that must be searched for based on longicorn | |
| CN106658603A (en) | Wireless sensor network routing energy-saving method with load balancing | |
| CN108900996A (en) | A kind of wireless sensor network data transmission method based on the double-deck fuzzy algorithmic approach | |
| CN104411000A (en) | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network | |
| CN108770036A (en) | Communication means and wireless sensor network Routing Protocol between cluster head | |
| CN105813161A (en) | Clustering routing method of micropower wireless sensor network based on energy difference | |
| CN101835099B (en) | Large-scale sensor network routing method based on cluster and RREP broadcast | |
| CN102231899B (en) | Guassian-declustered routing control method for wireless sensor network | |
| CN104093196B (en) | LEACH alternating time dynamic optimization method based on energy consumption | |
| CN103781166A (en) | Mobile terminal power distribution method in heterogeneous wireless network cooperative communication system | |
| CN107911859A (en) | The life cycle of underwater wireless sensor network based on cross layer design extends method | |
| Miah et al. | Performance analysis of ILEACH and LEACH protocols for wireless sensor networks | |
| CN103619045A (en) | Route establishing method and system of low-consumption lossy network | |
| CN104093184B (en) | A kind of dynamic Adjusted Option of the LEACH rotation times based on energy consumption | |
| Ghneimat et al. | Adaptive, cluster based, sensor network routing protocol | |
| CN108307471B (en) | Energy balance cluster head node selection method | |
| Walia | A survey on reactive routing protocols of the mobile ad hoc networks | |
| CN110177351A (en) | A kind of efficient data transfer method for low duty ratio wireless sensor network | |
| Santo Gitakarma et al. | Designing Wireless Sensor Network Routing on Agriculture Area Using The LEACH Protocol | |
| CN115134887A (en) | Duty ratio wireless sensor network topology control method based on game theory | |
| Sharma et al. | ANN Based Framework for Energy Efficient Routing In Multi-Hop WSNs. | |
| Kaur et al. | Hybrid TB-LEACH Energy Based Multihop Protocol |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170510 |