CN104093184B - A kind of dynamic Adjusted Option of the LEACH rotation times based on energy consumption - Google Patents
A kind of dynamic Adjusted Option of the LEACH rotation times based on energy consumption Download PDFInfo
- Publication number
- CN104093184B CN104093184B CN201410320566.2A CN201410320566A CN104093184B CN 104093184 B CN104093184 B CN 104093184B CN 201410320566 A CN201410320566 A CN 201410320566A CN 104093184 B CN104093184 B CN 104093184B
- Authority
- CN
- China
- Prior art keywords
- cluster
- node
- energy
- round
- leach
- 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
-
- 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 present invention relates to a kind of dynamic Adjusted Option of rotation time based on LEACH agreements, belong to wireless sensor network technology field.The program includes following content：After cluster is formed, leader cluster node collects the position of all member nodes and dump energy information in cluster, and will be returned after information fusion to base station；Base station maximum cluster is chosen, and the duration of the wheel and the data transmission period of other clusters are adjusted according to the dump energy of maximum cluster according to the information of each cluster.Using the dynamic Adjusted Option of rotation time of the LEACH agreements proposed by the present invention based on energy consumption in LEACH agreements, it can effectively optimize and select energy expenditure between cluster cycle, balance nodes, extension network life cycle.
Description
Technical field
The present invention relates to a kind of dynamic Adjusted Option of Leach rotation times based on energy consumption, belong to wireless sensor network
Technical field.
Background technology
The problem of extension Network morals are important in a radio sensing network.Many scholars it is also proposed a lot
Energy-efficient agreement extends the life cycle of radio sensing network.At present, the equilibrium of energy is realized by network cluster dividing
Realize that extension network lifecycle is the focus direction of research with this.LEACH algorithms are proposed most by Heinzelman et al.
The popular energy-efficient communication protocol based on sub-clustering, agreement is by carrying out sub-clustering to node and loading to balancing energy respectively
The consumption of gross energy in network is reduced in individual cluster.In order to ensure the equilibrium consumption of energy, 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 round includes：Establishment stage and stably
Operation phase.Establishment stage will complete the selection of leader cluster node, the broadcasting of leader cluster node, the cluster of the addition of non-leader cluster node is 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
Data after polymerization are simultaneously sent to base station by the message from its member.However, LEACH many parameters can influence agreement
Performance, these parameters have to be optimized, e.g., threshold value, number of cluster etc..Therefore, many scholars are devoted to optimize LEACH's
Parameter improves LEACH performance.Although many people have done different optimizations to LEACH, LEACH each round it is lasting when
Between but few people study.The length of each round duration is very crucial for the whole performance of network.If the time is too
Long, then cluster head is just in active state for a long time, 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 wheels based on energy consumption
Change time dynamic optimization algorithm.
Idea of the invention is that according to cluster interior nodes quantity and the difference of energy expenditure, dynamic adjustment often take turns it is lasting when
Between, optimize the LEACH energy expenditure selected between cluster cycle, balance nodes with this, extend the life cycle of network.
The purpose of the present invention is achieved through the following technical solutions：
A kind of dynamic Adjusted Option of the rotation time of LEACH agreements based on energy consumption, including herein below：
(1) each node possesses the ability for perceiving oneself position and dump energy in net；
(2) after cluster is formed, leader cluster node collects the position of all member nodes and dump energy information in cluster；
(3) the leader cluster node dump energy of all member nodes or remaining gross energy and nodes into base station repeats cluster
Information；
(4) base station is descending to cluster row according to nodes and remaining gross energy according to all cluster information being collected into
Sequence, and elect the cluster ranked the first as maximum cluster, the cluster number of the maximum cluster of note is j；
(5) base station dynamically adjusts the epicycle duration of maximum cluster according to the remaining gross energy of maximum cluster using following formula：
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 cluster j residue
Gross energy, Ej_initFor cluster j initial total energy；
Data transmission period of other clusters in epicycle is dynamically adjusted using following formula：
Wherein, ti_roundIt is cluster i in the data transmission period of epicycle, tj_roundIt is cluster j in the duration of epicycle,
Ei_currentFor cluster i remaining gross energy, Ei_initFor cluster i initial total energy, niThe nodes included for cluster i, njFor cluster j bags
The nodes contained, EelecRepresent to propagate the energy that a bit data is consumed, EDAEnergy needed for one bit data of polymerization is represented,
di_toBSCluster i leader cluster node is represented to the distance of base station, dk_toCHMember node k is represented in cluster to the distance of cluster head node, εamp
Represent to work as d >=d0When radio frequency amplifier transmission 1bit unit squares rice square energy consumed, d0For the threshold value that presupposes away from
From εfsRepresent to work as d ＜ d0When the energy that is consumed of radio frequency amplifier transmission 1bit unit squares rice；
(6) base station is by ti_roundAnd tj_roundBeam back the leader cluster node of each cluster；
(7) leader cluster node of maximum cluster is in tj_roundIt is each member node distribution data transmission slots in cluster in time, its
The leader cluster node of its cluster is in ti_roundIt is each member node distribution data transmission slots in cluster in time；
(8) member node transmits data, leader cluster node pair in the time slot that leader cluster node is its distribution to cluster head in each cluster
The data received communicate information to base station again after carrying out data fusion；
(9) each cluster i is passing through ti_roundAfter time, dormancy tj_round-ti_roundIt is waken up after time, hereafter the whole network enters
The cluster of a new round is set up and stable operation stage, and the wheel time that cluster restarts a new round after being formed from step (2) dynamically adjusts
With stable operation process.
Beneficial effect
The traditional LEACH agreements of contrast, the present invention program can effectively balanced net interior nodes energy expenditure, extend net
Network life cycle and the quantity of base station receive information bag；Moreover, the program is applied to the institute that the wheel time is fixed proposed at present
There are basic LEACH agreements and its improved protocol, it is applied widely.
Brief description of the drawings
Fig. 1 is LEACH agreement topology diagrams.
Fig. 2 is improved LEACH algorithm flow charts.
Fig. 3 is 50,100, in the scene of 200 nodes, the comparison figure of life cycle in the case of different rotation times.
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 that under different rotation times, the base station of 100 node scenes receives the comparison diagram of data volume.
Fig. 7 is rotation time when being 20s, comparison diagram of the LEACH algorithms before and after improving in network life cycle.
Fig. 8 is rotation time when being 20s, comparison diagram of the LEACH algorithms before and after improving in node life span.
Fig. 9 is rotation time when being 20s, comparison diagram of the LEACH algorithms before and after improving in node average energy consumption.
Figure 10 is rotation time when being 20s, and the LEACH algorithms before and after improving receive the comparison diagram in data volume in base station.
Figure 11 is rotation time when being 20s, and the LEACH algorithms before and after improving are in first node death time and a half-section
Comparison diagram on the point death time.
Embodiment
The present invention will be further described with reference to the accompanying drawings and examples.
The LEACH agreements topological diagram of the present invention is 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 implementation process and assessment result of the present invention is described below.
Step 1: changing original LEACH protocol codes according to the present invention program：
As shown in Fig. 2 being made improvements to former LEACH agreements.After improvement, we can be on network analog platform NS2
Emulation experiment is carried out to improved LEACH algorithms.
Workflow during LEACH Routing Protocols after improvement are taken turns one is：
Before 1. algorithm starts, it is t to set the initial wheel timeround；
2. a value between each node random selection 0-1, if selected value is less than some threshold value, then this
Node turns into leader cluster node；After selected leader cluster node, whole network is informed by broadcast；Other nodes in network are according to reception
The signal intensity of information determines the cluster of subordinate, and is sent to add information, and this packet contains node ID, node location and section
Point dump energy；
3. the remaining gross energy from all member nodes to base station repeats cluster and nodes information of leader cluster node；
4. base station is according to all cluster information being collected into, descending to cluster sequence according to nodes and remaining gross energy,
And elect the cluster ranked the first as maximum cluster, the cluster number of the maximum cluster of note is j；
5. base station dynamically adjusts the epicycle duration of maximum cluster according to the remaining gross energy of maximum cluster using following formula：
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 cluster j residue
Gross energy, Ej_initFor cluster j initial total energy；
Data transmission period of other clusters in epicycle is dynamically adjusted using following formula：
Wherein, ti_roundIt is cluster i in the data transmission period of epicycle, tj_roundIt is cluster j in the duration of epicycle,
Ei_currentFor cluster i remaining gross energy, Ei_initFor cluster i initial total energy, niThe nodes included for cluster i, njFor cluster j bags
The nodes contained, EelecRepresent to propagate the energy that a bit data is consumed, EDAEnergy needed for one bit data of polymerization is represented,
di_toBSCluster i leader cluster node is represented to the distance of base station, dk_toCHMember node k is represented in cluster to the distance of cluster head node, εamp
Represent to work as d >=d0When radio frequency amplifier transmission 1bit unit squares rice square energy consumed, d0For the threshold value presupposed
Distance, εfsRepresent to work as d ＜ d0When the energy that is consumed of radio frequency amplifier transmission 1bit unit squares 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 each member node distribution data in cluster
Transmission time slot；The leader cluster node of other clusters is in ti_roundTDMA scheduling is carried out in time, is each member node distribution data in cluster
Transmission time slot；
8. member node to cluster head in the time slot of its distribution in leader cluster node to transmit data in each cluster, leader cluster node is docked
The data received communicate information to base station again after carrying out data fusion；
9. each cluster i is passing 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, is gone to step 2 and is restarted, until the remaining node number of the whole network is less than set value
k。
Step 2: setting corresponding experiment parameter：
The present invention tests scene：In the range of 100 × 100m, random distribution 50,100 or 200 nodes, base station position
Position in (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 EelecCalculating energy is set to 5nJ/ needed for being set to 50nJ/bit, data fusion
Bit, cluster head ratio N/k are 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, analyzes its performance：
Reference picture 3, draws the network lifecycle of LEACH innovatory algorithms under different rotation times.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 the morning that the few peak value of node occurs, the evening that the peak value more than node occurs.Because increasing with number of nodes, produces
The probability of cluster more than interior nodes containing cluster will increase, according to set forth herein dynamic adjustment often take turns the duration algorithm, it should
Appropriate increase is just established the cluster time, to realize that node energy consumption is uniform.It can be seen that peak value respectively appear in 16s,
20s and 26s.
Reference picture 4, in the case of drawing different initial rotation times, the Survival of nodes.As can be seen that
When just establishing cluster set of time for 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, because, the time is taken turns using dynamic
LEACH consultations often take turns the duration according to the residue of node and the energy of consumption dynamically to adjust, and after some wheels, take turns
Time can be adjusted to level proper under present energy environment, the energy expenditure of the balanced node of this meeting, delay first
The generation time of death nodes.
Reference picture 5, draws the situation of 100 meshed network energy expenditures, it can be seen that establishing originally the cluster time
When being set to 20s, energy expenditure 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, 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 reduced slowly, therefore depleted in network energy
When, moreover it is possible to run longer period of time.
Reference picture 6, in the case of drawing the cluster time of establishing at the beginning of the difference, the comparison for the data packet number that base station is received,
It can be seen that the data packet number that base station is received when the cluster time of just establishing is 20s is most.If often take turns lasting
Between set it is long, cluster head node energy consumption 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 is received will tail off.If often the wheel duration is too short, then has excessive energy dissipation and is selecting cluster rank
Section, and in this stage, node never sends data, so as to cause base station to receive data reduction.
Step 4: comparative analysis improves the performance of front and rear LEACH algorithms：
From the simulation result of former LEACH agreements it can be 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, when it is 20s to promote rotation time, do one to both
Lower performance comparison analysis.Contrasted for convenience, the algorithm before optimization is referred to as S-LEACH (Static LEACH) and calculated by we
Method, the algorithm after optimization be referred to as D-LEACH (Dynamic LEACH) we mainly to the life cycle of node, the energy of node
Death time of data volume, first node and half node that amount consumption, base station are received etc. is analyzed.
The comparison diagram of reference picture 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.
The comparison figure of reference picture 8, S-LEACH and D-LEACH in node rate of death, it can be seen that D-LEACH life
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
Network is completely dead afterwards, but D-LEACH has but used 250 wheels, because the D-LEACH often wheel duration is with cluster
What dump energy and cluster interior nodes number were dynamically 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, can thus allow node energy reduce it is relatively slow, therefore saving
D-LEACH can also be continued for some time more than S-LEACH when point is dead.
The comparison diagram of reference picture 9, S-LEACH and D-LEACH in average energy consumption, it is found that D-LEACH energy
Amount consumption is slower than S-LEACH, and S-LEACH slope is substantially constant in whole network life cycle, but D-LEACH exists
510s front slopes are constantly reduced, and this is due to the energy expenditure with node, often take turns the duration declined, this certainty
Energy expenditure can be reduced, but between 510s to 600s, D-LEACH energy expenditure is accelerated suddenly, because, D-
LEACH is in 510s, first node death, and it is based on dump energy, over time that D-LEACH threshold value, which chooses formula,
Propulsion, residue energy of node can cause the threshold value of node smaller, the probability that node is chosen as cluster head just compares than relatively low
Small, when no node is dead, this consequence is not also it is obvious that still when having node dead, can be chosen as
The quantity of leader cluster node is just less, when not having node to be elected to cluster head in a network, or node is 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 expenditure can be caused increased
Than very fast.And when 600s, the energy expenditure of node can slow down, because, the average residual energy comparison of node
It is low, cause the duration of every wheel very short, the energy that node often takes turns consumption is just seldom, therefore can also continue longer period of time.
Comparison figure in terms of the data volume that reference picture 10, S-LEACH and D-LEACH are received in base station, in figure,
The data volume that D-LEACH is received is compared with S-LEACH to remain basically stable, but the growth rate of data volume is smaller, this be because
For D-LEACH is in order to allow node energy equilibrium to consume, and the often wheel duration of few cluster containing 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, D-LEACH slope slowly reduces, and during to about 640s, data volume no longer increases, although network is also continuing
Operation, but due effect is not played, therefore one can consider that in the current situation, D-LEACH life cycle is
640s。
Reference picture 11, S-LEACH and D-LEACH are in first node death time and the aspect of half node death time two
Comparison figure, it can be seen that D-LEACH first node dead time is late than S-LEACH a lot, because D-
The balanced consumption of node energy of LEACH algorithms, this can postpone first node dead time significantly.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, differed between D-LEACH HNA and FND
It is less 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 summary, the LEACH agreements that the present invention is fixed in multinomial performance index better than the former wheel time.
Above-described to specifically describe, purpose, technical scheme and beneficial effect to invention have been carried out further specifically
It is bright, it should be understood that the specific embodiment that the foregoing is only the present invention, the protection model being not intended to limit the present invention
Enclose, within the spirit and principles of the invention, any modification, equivalent substitution and improvements done etc. should be included in the present invention
Protection domain within.
Claims (1)
1. a kind of dynamic Adjusted Option of the rotation time based on LEACH agreements, it is characterised in that including herein below：
(1) each node possesses the ability for perceiving oneself position and dump energy in net；
(2) after cluster is formed, leader cluster node collects the position of all member nodes and dump energy information in cluster；
(3) the leader cluster node dump energy of all member nodes or remaining gross energy and nodes information into base station repeats cluster；
(4) base station is descending to cluster sequence according to nodes and remaining gross energy according to all cluster information being collected into, and
Elect the cluster ranked the first as maximum cluster, the cluster number of the maximum cluster of note is j；
(5) base station dynamically adjusts the epicycle duration of maximum cluster according to the remaining gross energy of maximum cluster using following formula：
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 cluster j remaining total energy
Amount, Ej_initFor cluster j initial total energy；
Data transmission period of other clusters in epicycle is dynamically adjusted using following formula：
Wherein, ti_roundIt is cluster i in the data transmission period of epicycle, tj_roundIt is cluster j in the duration of epicycle, Ei_currentFor cluster i
Remaining gross energy, Ei_initFor cluster i initial total energy, niThe nodes included for cluster i, njThe nodes included for cluster j,
EelecRepresent to propagate the energy that a bit data is consumed, EDARepresent energy, d needed for one bit data of polymerizationi_toBSRepresent cluster i
Leader cluster node to the distance of base station, dk_toCHMember node k is represented in cluster to the distance of cluster head node, εampRepresent to work as d >=d0
When radio frequency amplifier transmission 1bit unit squares rice square energy consumed, d0For the threshold distance presupposed, εfsRepresent
As d ＜ d0When the energy that is consumed of radio frequency amplifier transmission 1bit unit squares rice；
(6) base station is by ti_roundAnd tj_roundBeam back the leader cluster node of each cluster；
(7) leader cluster node of maximum cluster is in tj_roundIt is each member node distribution data transmission slots, other clusters in cluster in time
Leader cluster node in ti_roundIt is each member node distribution data transmission slots in cluster in time；
(8) member node to cluster head in the time slot of its distribution in leader cluster node to transmit data in each cluster, and leader cluster node is to receiving
To data carry out data fusion after communicate information to base station again；
(9) each cluster i is passing through ti_roundAfter time, dormancy tj_round-ti_roundIt is waken up after time, hereafter the whole network enters new one
The cluster of wheel is set up and stable operation stage, and the wheel time that cluster restarts a new round after being formed from step (2) dynamically adjusts and steady
Determine running.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410320566.2A CN104093184B (en) | 2014-07-07 | 2014-07-07 | A kind of dynamic Adjusted Option of the LEACH rotation times based on energy consumption |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410320566.2A CN104093184B (en) | 2014-07-07 | 2014-07-07 | A kind of dynamic Adjusted Option of the LEACH rotation times based on energy consumption |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104093184A CN104093184A (en) | 2014-10-08 |
| CN104093184B true CN104093184B (en) | 2017-08-25 |
Family
ID=51640851
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410320566.2A Active CN104093184B (en) | 2014-07-07 | 2014-07-07 | A kind of dynamic Adjusted Option of the LEACH rotation times based on energy consumption |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104093184B (en) |
Families Citing this family (1)
| 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 |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7738413B2 (en) * | 2003-12-08 | 2010-06-15 | The Regents Of The University Of California | Minimizing power consumption in a wireless system for a sensor networks using time slots for nodes |
| CN102036308B (en) * | 2010-12-09 | 2013-04-17 | 江南大学 | Energy balancing wireless sensor network clustering method |
| CN102802175A (en) * | 2012-02-24 | 2012-11-28 | 东北电力大学 | Energy-consumption-based routing optimization algorithm for wireless sensor network |
-
2014
- 2014-07-07 CN CN201410320566.2A patent/CN104093184B/en active Active
Non-Patent Citations (1)
| Title |
|---|
| An optimal solution for round rotation time setting in LEACH;Hongyan Zhang 等;《International conference on wireless algorithms,systems and applications》;20131231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104093184A (en) | 2014-10-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Junping et al. | A time-based cluster-head selection algorithm for LEACH | |
| CN104936230B (en) | One kind being based on the desired balancing energy of wireless sensor network routing optimization method of cluster head | |
| CN101267391A (en) | Wireless sensor network topology control method based on non-uniform sections | |
| CN101835099B (en) | Large-scale sensor network routing method based on cluster and RREP broadcast | |
| 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 | |
| CN104411000A (en) | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network | |
| Ahvar et al. | FEAR: A fuzzy-based energy-aware routing protocol for wireless sensor networks | |
| CN102231899A (en) | Guassian-declustered routing control method for wireless sensor network | |
| CN103781166A (en) | Mobile terminal power distribution method in heterogeneous wireless network cooperative communication system | |
| CN104093196B (en) | LEACH alternating time dynamic optimization method based on energy consumption | |
| 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 | |
| Guo et al. | A cluster-based algorithm for energy-efficient routing in wireless sensor networks | |
| CN108307471B (en) | Energy balance cluster head node selection method | |
| Walia | A survey on reactive routing protocols of the mobile ad hoc networks | |
| Dutta et al. | Energy aware modified PEGASIS through packet transmission in wireless sensor network | |
| Hossan et al. | Distance and energy aware extended LEACH using secondary cluster head for wireless sensor networks | |
| Wang et al. | Study and improvement on leach protocol in wsns | |
| Wang et al. | Energy-efficient clustering rumor routing protocol for wireless sensor networks | |
| Kaur et al. | Hybrid TB-LEACH Energy Based Multihop Protocol | |
| Hnini et al. | Effect of a Node's Death on Behavior of the LEACH Protocol and its Descendants | |
| Fouchal et al. | A battery recovery aware routing protocol for Wireless Sensor Networks | |
| Alapati et al. | An Efficient Power Reduction Mode in Mobile Ad hoc Networks to Reduce the Power Consumption Levels for Improving the QoS | |
| Chourse et al. | A review on energy efficient of clustering-based routing protocol in wireless sensor network |
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 |