CN104093184A - LEACH alternating time dynamic regulation scheme based on energy consumption - Google Patents

LEACH alternating time dynamic regulation scheme based on energy consumption Download PDF

Info

Publication number
CN104093184A
CN104093184A CN201410320566.2A CN201410320566A CN104093184A CN 104093184 A CN104093184 A CN 104093184A CN 201410320566 A CN201410320566 A CN 201410320566A CN 104093184 A CN104093184 A CN 104093184A
Authority
CN
China
Prior art keywords
bunch
round
node
energy
time
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.)
Granted
Application number
CN201410320566.2A
Other languages
Chinese (zh)
Other versions
CN104093184B (en
Inventor
礼欣
李遵光
张鸿雁
樊秀梅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Institute of Technology BIT
Original Assignee
Beijing Institute of Technology BIT
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Institute of Technology BIT filed Critical Beijing Institute of Technology BIT
Priority to CN201410320566.2A priority Critical patent/CN104093184B/en
Publication of CN104093184A publication Critical patent/CN104093184A/en
Application granted granted Critical
Publication of CN104093184B publication Critical patent/CN104093184B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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 invention relates to an alternating time dynamic regulation scheme based on an LEACH protocol and belongs to the technical field of the wireless sensor network. The scheme includes the following steps that after clusters are formed, a cluster header node collects the position and residual energy information of all member nodes in the clusters, and the information is reported to a base station after being fused; the base station selects the largest cluster according to the information of each cluster, and adjusts the time of duration of the turn and the data transmission time of other clusters according to the residual energy of the largest cluster. By applying the alternating time dynamic regulation scheme based on the LEACH protocol 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

A kind of LEACH rotation time based on energy consumption is dynamically adjusted scheme
Technical field
The present invention relates to a kind of Leach rotation time based on energy consumption and dynamically adjust scheme, belong to wireless sensor network technology field.
Background technology
The life cycle that extends network is important problem in a radio sensing network.A lot of scholars have also proposed the life cycle that a lot of energy-efficient agreements extend radio sensing network.At present, the equilibrium that realizes energy by network cluster dividing realizes and extends the focus direction that network lifecycle is research with this.LEACH algorithm is the most popular energy-efficient communication protocol based on sub-clustering being proposed by people such as Heinzelman, and agreement is by carrying out sub-clustering and balancing energy being loaded to the consumption that reduces gross energy in network in each bunch to node.In order to ensure the equilibrium consumption of energy, LEACH periodically selects at random node to serve as a bunch head in all nodes.LEACH agreement realizes with " wheel ".Each is taken turns and comprises: establishment stage and stable operation stage.Establishment stage will complete the selection of leader cluster node, bunch forming process adding of the broadcast of leader cluster node, non-leader cluster node and leader cluster node for bunch in the TDMA scheduling process of member's distribution T DMA time slot; In stable operation stage, bunch head is accepted from its member's message and the data after polymerization is sent to base station.Yet many parameters of LEACH can affect the performance of agreement, these parameters have to be optimized, as, threshold values, bunch number etc.Therefore the parameter that, many scholars are devoted to optimize LEACH improves the performance of LEACH.Although a lot of people have done different optimization to LEACH, each takes turns the but few people's research of lasting time LEACH.Each length of taking turns the duration is very crucial for the whole performance of network.If the time is oversize, bunch head is just for a long time in active state so, and the energy of leader cluster node will very fast being exhausted; If the time is too short, the selection of bunch head too frequently causes too much energy dissipation at a bunch establishment stage, because this one-phase is can not send data.
Summary of the invention
The object of the invention is the defect existing in order to overcome prior art, proposed a kind of Leach rotation time dynamic optimization algorithm based on energy consumption.
Thought of the present invention is according to the difference of bunch interior nodes quantity and energy consumption, adjusts dynamically every duration of taking turns, and with this, optimizes the choosing bunch cycle of LEACH, the energy consumption between balance node, the life cycle of prolongation network.
The object of the invention is to be achieved through the following technical solutions:
The rotation time of the LEACH agreement based on energy consumption is dynamically adjusted a scheme, comprises following content:
(1) interior each node of net possesses the ability of the own position of perception and dump energy;
(2) after bunch formation, leader cluster node collect bunch in position and the dump energy information of all member node;
(3) leader cluster node is to dump energy or residue gross energy and the nodes information of all member node in base station report bunch;
(4) base station is according to all bunches of information collecting, descending to a bunch sequence according to nodes and residue gross energy, and bunch elects maximum bunch as by what rank the first, maximum bunch of note bunch number be j;
(5) base station is used following formula dynamically to adjust the epicycle duration of maximum bunch according to the residue gross energy of maximum bunch:
t j_round＝t round(E j_current/E j_init)
Wherein, t roundfor reference wheel time, t j_roundfor the duration of bunch j in epicycle, E j_currentfor the residue gross energy of bunch j, E j_initinitial gross energy for bunch j;
Use following formula dynamically to adjust other bunch at the data transmission period of epicycle:
t i _ round = E elec · n j + E DA · n j + ϵ amp d j _ toBS 4 + Σ k = 1 n j - 1 ( E elec + ϵ fs d k _ toCH 2 ) E elec · n i + E DA · n i + ϵ amp d i _ toBS 4 + Σ k = 1 n i - 1 ( E elec + ϵ fs d k _ toCH 2 ) · ( E i _ current E i _ init ) · ( n i n j ) 2 · t j _ round
Wherein, t i_roundfor the data transmission period of bunch i in epicycle, t j_roundfor the duration of bunch j in epicycle, E i_currentfor the residue gross energy of bunch i, E i_initfor the initial gross energy of bunch i, n ifor the nodes that bunch i comprises, n jfor the nodes that bunch j comprises, E elecrepresent to propagate the energy that a Bit data consumes, E dArepresent polymerization one Bit data institute energy requirement, d i_toBSthe leader cluster node of representative bunch i is to the distance of base station, d k_toCHin representative bunch, member node k is to the distance of a bunch node, ε amprepresent as d>=d 0time radio frequency amplifier transmission 1bit unit square rice square energy consuming, d 0for the threshold values distance presupposing, ε fsrepresent as d < d 0time the radio frequency amplifier transmission 1bit unit square rice energy that consumes;
(6) base station is by t i_roundand t j_roundbeam back the leader cluster node of each bunch;
(7) leader cluster node of maximum bunch is at t j_roundeach member node distribute data transmission time slot in time being bunch, the leader cluster node of other bunch is at t i_roundeach member node distribute data transmission time slot in time being bunch;
(8) in the time slot that in each bunch, member node is its distribution at leader cluster node, to bunch head transmission data, leader cluster node carries out sending information to base station again after data fusion to the data that receive;
(9) each bunch of i is at process t i_roundafter time, dormancy t j_round-t i_roundafter time, be waken up, after this whole network enters bunch foundation and the stable operation stage of a new round, restarts dynamic the adjustment and stable operation process of wheel time of a new round after bunch formation from step (two).
Beneficial effect
Contrast traditional LEACH agreement, the present invention program is the energy consumption of balanced net interior nodes effectively, extends the quantity that network life cycle and base station receive packets of information; And this scheme is applicable to fixing all basic LEACH agreement and the improved protocol thereof of wheel time proposing at present, applied widely.
Accompanying drawing explanation
Fig. 1 is LEACH agreement topology diagram.
Fig. 2 is improved LEACH algorithm flow chart.
Fig. 3 is in the scene of 50,100,200 nodes, the comparison diagram of the situation lower life cycle of different rotation times.
Fig. 4 is under different rotation times, the comparison diagram of the node life span of 100 node scenes.
Fig. 5 is under different rotation times, the comparison diagram of the rate of energy dissipation of 100 node scenes.
Fig. 6 is under different rotation times, and the base station of 100 node scenes receives the comparison diagram of data volume.
Fig. 7 is rotation time while being 20s, the comparison diagram of the LEACH algorithm before and after improving in network life cycle.
Fig. 8 is rotation time while being 20s, the comparison diagram of the LEACH algorithm before and after improving in node life span.
Fig. 9 is rotation time while being 20s, the comparison diagram of the LEACH algorithm before and after improving in node average energy consumption.
Figure 10 is rotation time while being 20s, and the LEACH algorithm before and after improving receives the comparison diagram in data volume in base station.
Figure 11 is rotation time while being 20s, and the LEACH algorithm before and after improving is at first node death time and the comparison diagram of half node on the death time.
Embodiment
Below in conjunction with drawings and Examples, the present invention will be further described.
As shown in Figure 1, each leader cluster node intercoms with base station LEACH agreement topological diagram of the present invention mutually, and each bunch of interior nodes communicated by letter mutually with leader cluster node in this bunch.Introduce implementation process of the present invention and assessment result below.
Step 1, according to the present invention program, revise original LEACH protocol code:
As shown in Figure 2, former LEACH agreement is made improvements.After improvement, we can carry out emulation experiment to improved LEACH algorithm on network analog platform NS2.
The workflow of LEACH Routing Protocol after improvement in one takes turns is:
1., before algorithm starts, it is t that the initial wheel time is set round;
2. each node is selected a value between 0-1 at random, if selected value is less than some threshold values, this node becomes leader cluster node so; After selected leader cluster node, by broadcast, inform whole network; Other nodes in network according to the signal strength signal intensity that receives information determine subordinate bunch, and add information to its transmission, this packets of information is containing node ID, node location and residue energy of node;
3. leader cluster node is to residue gross energy and the nodes information of all member node in base station report bunch;
4. base station is according to all bunches of information collecting, descending to a bunch sequence according to nodes and residue gross energy, and bunch elects maximum bunch as by what rank the first, maximum bunch of note bunch number be j;
5. base station is used following formula dynamically to adjust the epicycle duration of maximum bunch according to the residue gross energy of maximum bunch:
t j_round＝t round(E j_current/E j_init)
Wherein, t roundfor reference wheel time, t j_roundfor the duration of bunch j in epicycle, E j_currentfor the residue gross energy of bunch j, E j_initinitial gross energy for bunch j;
Use following formula dynamically to adjust other bunch at the data transmission period of epicycle:
t i _ round = E elec &CenterDot; n j + E DA &CenterDot; n j + &epsiv; amp d j _ toBS 4 + &Sigma; k = 1 n j - 1 ( E elec + &epsiv; fs d k _ toCH 2 ) E elec &CenterDot; n i + E DA &CenterDot; n i + &epsiv; amp d i _ toBS 4 + &Sigma; k = 1 n i - 1 ( E elec + &epsiv; fs d k _ toCH 2 ) &CenterDot; ( E i _ current E i _ init ) &CenterDot; ( n i n j ) 2 &CenterDot; t j _ round
Wherein, t i_roundfor the data transmission period of bunch i in epicycle, t j_roundfor the duration of bunch j in epicycle, E i_currentfor the residue gross energy of bunch i, E i_initfor the initial gross energy of bunch i, n ifor the nodes that bunch i comprises, n jfor the nodes that bunch j comprises, E elecrepresent to propagate the energy that a Bit data consumes, E dArepresent polymerization one Bit data institute energy requirement, d i_toBSthe leader cluster node of representative bunch i is to the distance of base station, d k_toCHin representative bunch, member node k is to the distance of a bunch node, ε amprepresent as d>=d 0time radio frequency amplifier transmission 1bit unit square rice square energy consuming, d 0for the threshold values distance presupposing, ε fsrepresent as d < d 0time the radio frequency amplifier transmission 1bit unit square rice energy that consumes;
6. base station is by t i_roundand t j_roundbeam back the leader cluster node of each bunch;
7. the leader cluster node of maximum bunch is at t j_roundin time, carry out TDMA scheduling, for bunch in each member node distribute data transmission time slot; The leader cluster node of other bunch is at t i_roundin time, carry out TDMA scheduling, for bunch in each member node distribute data transmission time slot;
8. in the time slot that in each bunch, member node is its distribution at leader cluster node, to bunch head transmission data, leader cluster node carries out sending information to base station again after data fusion to the data that receive;
9. each bunch of i is at process t i_roundafter time, dormancy t j_round-t i_roundafter time, be waken up; After this whole network enters bunch foundation and the stable operation stage of a new round, forwards step 2 to and restarts, until the residue node number of the whole network is less than set value k.
Step 2, corresponding experiment parameter is set:
The present invention tests scene: in the scope of 100 * 100m, and 50,100 or 200 nodes of random distribution, base station is positioned at the position of (50,175).The primary power of base station is unlimited, and the primary power of ordinary node is 2mJ, and follow-up can not supply.Radio reception data consumes ENERGY E elecbe set to 50nJ/bit, the required calculating energy of data fusion is set to 5nJ/bit, and a bunch ratio N/k is 5%, and data package size l is 4000bits, bit rate R bfor 1Mbps, the energy ε of radio frequency amplifier ampand ε fsbe respectively 0.0013pJ/bit/m 4and 10pJ/bit/m 2.
Step 3, operation agreement, analyze its performance:
With reference to Fig. 3, draw the network lifecycle of LEACH improvement algorithm under different rotation times.As can be seen from the figure, in the situation that 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 few peak value of node morning of occurring, the evening that the peak value that node is many occurs.This is because along with the increasing of number of nodes, produce containing bunch interior nodes many bunch probability will increase, according to the every algorithm of taking turns the duration of dynamic adjustment in this paper, should suitably increase and just establish a bunch time, even to realize node energy consumption.As can be seen from the figure, peak value appears at respectively 16s, 20s and 26s.
With reference to Fig. 4, draw in the situation of different initial rotation times the existence situation of nodes.Can find out, when bunch set of time of just establishing is 20s, the dead speed of node is the slowest, from figure, also can find out, even if just establish, bunch time changes to some extent, but the time of occurrence of first dead node differs and is not very large, this be because, adopt the LEACH consultation of dynamic wheel time dynamically to adjust every wheel the duration according to the energy of the residue of node and consumption, after some wheel, the wheel time can be adjusted to level proper under current energy environment, and this understands the energy consumption of balanced node, has delayed the generation time of first dead node.
With reference to Fig. 5, draw the situation that 100 meshed network energy consume, as can be seen from the figure, when bunch set of time of establishing is originally 20s, it is the slowest that energy consumes.And can also find out when network energy is low-down, network can also continue longer a period of time of operation, this is because taked the every method of taking turns the time of dynamic change, when energy reduces to a certain degree, every duration of taking turns has reduced a lot, this just causes node energy can reduce slowly, therefore, in network energy approach exhaustion, can also move longer a period of time.
With reference to Fig. 6, draw in the situation that difference is just established bunch time, the comparison of the data packet number that base station receives, as can be seen from the figure, the data packet number that base station receives when bunch time of just establishing is 20s is maximum.If every, take turns long that the duration arranges, a bunch node energy consumes too fast and dead, leader cluster node place so, and the data of polymerization will tail off, thus the data that receive base station will tail off.If it is too short every, to take turns the duration, have so too much energy dissipation in the choosing bunch stage, and in this one-phase, node can not send data, thereby cause base station to receive that data reduce.
The performance of the LEACH algorithm before and after step 4, comparative analysis improve:
From the simulation result of former LEACH agreement, can find, in the scene of 100 nodes, former LEACH agreement is when initial rotation time is 20s, and network life cycle is the longest.Therefore be necessary both, when impelling rotation time to be 20s, to do performance comparison analysis.In order conveniently to contrast, we are called S-LEACH (Static LEACH) algorithm the algorithm before optimizing, the algorithm after optimization be called D-LEACH (Dynamic LEACH) we be mainly life cycle to node, node energy consumption, the death time of data volume, first node and half node that base station receives etc. analyze.
With reference to Fig. 7, S-LEACH and the D-LEACH comparison diagram on network lifecycle, can find out, D-LEACH algorithm is set various just establishing under bunch time, network lifecycle all has larger improvement than S-LEACH algorithm, and the in the situation that of 100 nodes, both peak values all appear at bunch time of building when being 20s.
With reference to Fig. 8, S-LEACH and the D-LEACH comparison diagram in node rate of death, can find out, the life cycle of D-LEACH is than long 40% left and right of S-LEACH, and when there is first node death, S-LEACH general 200 take turns after network completely dead, but D-LEACH has but used 250 to take turns, this be because D-LEACH every take turns the duration along with bunch in dump energy and the dynamically adjustment of bunch interior nodes number, continuous death along with node, the number of bunch interior nodes can reduce relatively, every duration of taking turns also can decline relatively, so just can allow relatively slow that the energy of node reduces, therefore when there is node death, D-LEACH can also continue for some time than S-LEACH more.
With reference to Fig. 9, S-LEACH and the D-LEACH comparison diagram in average energy consumption, can find, it is slow that the energy consumption rate S-LEACH of D-LEACH wants, the slope of S-LEACH is substantially constant in whole network life cycle, but D-LEACH is constantly to reduce at 510s front slope, this is due to the energy consumption along with node, often take turns the duration and decline to some extent, this will inevitably fall low-energy-consumption, but at 510s between 600s, the energy consumption of D-LEACH is accelerated suddenly, this be because, D-LEACH is when 510s, first node is dead, and the threshold values of D-LEACH is chosen formula based on dump energy, propelling along with the time, residue energy of node can be lower, cause the threshold values of node smaller, it is just smaller that node is chosen as the probability of bunch head, when there is no node death, this consequence is not also clearly, but when having node death, can be chosen as the quantity of leader cluster node just still less, in a network, do not have node to be elected to bunch head, or node does not join in any bunch, node all can directly send information to base station, this process can consume a large amount of energy.The ratio that therefore can cause energy consumption to increase is very fast.And in 600s, the energy consumption of node can slow down, this be because, the average residual energy comparison of node is low, causes every duration of taking turns very short, the energy that node is every takes turns consumption just seldom, therefore can also continue to grow a period of time.
With reference to Figure 10, comparison diagram aspect the data volume that S-LEACH and D-LEACH receive in base station, known in figure, the data volume that D-LEACH receives is compared and is remained basically stable with S-LEACH, but the growth rate of data volume is smaller, this be because, in order to allow, node energy is balanced to be consumed D-LEACH, containing node few bunch often take turns the duration and will lack, the data volume sending will correspondingly reduce, this can cause the every data total amount of taking turns transmission of whole network fewer than S-LEACH, and As time goes on, the slope of D-LEACH slowly reduces, during to about 640s, data volume no longer increases, although network is also continuing operation, but do not play due effect, therefore we can think under present case, the life cycle of D-LEACH is 640s.
With reference to Figure 11, S-LEACH and D-LEACH are at the comparison diagram aspect first node death time and half node death time two, can find out, the time of first node death of D-LEACH is late more a lot of than S-LEACH, this be because the equilibrium of D-LEACH algorithm the consumption of node energy, this can postpone the time of first node death greatly.Under the contrast of half node death time, D-LEACH is also better than S-LEACH, but also can find, what between the HNA of D-LEACH and FND, differ is less, this is because due to even energy consumption, when there is first node death, the energy level of other nodes has also reduced a lot, so the ratio S-LEACH of part of nodes death is fast.
In sum, the present invention is better than the former fixing LEACH agreement of time of taking turns in multinomial performance index.
Above-described specific descriptions; object, technical scheme and beneficial effect to invention further describe; institute is understood that; the foregoing is only specific embodiments of the invention; the protection range being not intended to limit the present invention; within the spirit and principles in the present invention all, any modification of making, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.

Claims (1)

1. the rotation time based on LEACH agreement is dynamically adjusted a scheme, it is characterized in that, comprises following content:
(1) interior each node of net possesses the ability of the own position of perception and dump energy;
(2) after bunch formation, leader cluster node collect bunch in position and the dump energy information of all member node;
(3) leader cluster node is to dump energy or residue gross energy and the nodes information of all member node in base station report bunch;
(4) base station is according to all bunches of information collecting, descending to a bunch sequence according to nodes and residue gross energy, and bunch elects maximum bunch as by what rank the first, maximum bunch of note bunch number be j;
(5) base station is used following formula dynamically to adjust the epicycle duration of maximum bunch according to the residue gross energy of maximum bunch:
t j_round＝t round(E j_current/E j_init)
Wherein, t roundfor reference wheel time, t j_roundfor the duration of bunch j in epicycle, E j_currentfor the residue gross energy of bunch j, E j_initinitial gross energy for bunch j;
Use following formula dynamically to adjust other bunch at the data transmission period of epicycle:
t i _ round = E elec &CenterDot; n j + E DA &CenterDot; n j + &epsiv; amp d j _ toBS 4 + &Sigma; k = 1 n j - 1 ( E elec + &epsiv; fs d k _ toCH 2 ) E elec &CenterDot; n i + E DA &CenterDot; n i + &epsiv; amp d i _ toBS 4 + &Sigma; k = 1 n i - 1 ( E elec + &epsiv; fs d k _ toCH 2 ) &CenterDot; ( E i _ current E i _ init ) &CenterDot; ( n i n j ) 2 &CenterDot; t j _ round Wherein, t i_roundfor the data transmission period of bunch i in epicycle, t j_roundfor the duration of bunch j in epicycle, E i_currentfor the residue gross energy of bunch i, E i_initfor the initial gross energy of bunch i, n ifor the nodes that bunch i comprises, n jfor the nodes that bunch j comprises, E elecrepresent to propagate the energy that a Bit data consumes, E dArepresent polymerization one Bit data institute energy requirement, d i_toBSthe leader cluster node of representative bunch i is to the distance of base station, d k_toCHin representative bunch, member node k is to the distance of a bunch node, ε amprepresent as d>=d 0time radio frequency amplifier transmission 1bit unit square rice square energy consuming, d 0for the threshold values distance presupposing, ε fsrepresent as d < d 0time the radio frequency amplifier transmission 1bit unit square rice energy that consumes;
(6) base station is by t i_roundand t j_roundbeam back the leader cluster node of each bunch;
(7) leader cluster node of maximum bunch is at t j_roundeach member node distribute data transmission time slot in time being bunch, the leader cluster node of other bunch is at t i_roundeach member node distribute data transmission time slot in time being bunch;
(8) in the time slot that in each bunch, member node is its distribution at leader cluster node, to bunch head transmission data, leader cluster node carries out sending information to base station again after data fusion to the data that receive;
(9) each bunch of i is at process t i_roundafter time, dormancy t j_round-t i_roundafter time, be waken up, after this whole network enters bunch foundation and the stable operation stage of a new round, restarts dynamic the adjustment and stable operation process of wheel time of a new round after bunch formation from step (two).
CN201410320566.2A 2014-07-07 2014-07-07 A kind of dynamic Adjusted Option of the LEACH rotation times based on energy consumption Active CN104093184B (en)

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 true CN104093184A (en) 2014-10-08
CN104093184B 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)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104378812A (en) * 2014-11-28 2015-02-25 北京农业信息技术研究中心 Differentiated topology control method of renewable energy source nodes of farmland self-organizing network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050122231A1 (en) * 2003-12-08 2005-06-09 The Regents Of The University Of California Power efficient wireless system for sensor network
CN102036308A (en) * 2010-12-09 2011-04-27 江南大学 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

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050122231A1 (en) * 2003-12-08 2005-06-09 The Regents Of The University Of California Power efficient wireless system for sensor network
CN102036308A (en) * 2010-12-09 2011-04-27 江南大学 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

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
HONGYAN ZHANG 等: "An optimal solution for round rotation time setting in LEACH", 《INTERNATIONAL CONFERENCE ON WIRELESS ALGORITHMS,SYSTEMS AND APPLICATIONS》 *
程宏斌 等: "基于非竞争式簇首轮转得WSNs分簇优化方法", 《计算机测量与控制》 *
蒋晓鸣: "《电子科技大学硕士学位论文》", 31 December 2008 *
马玉刚 等: "基于LEACH的无线传感器网络节能算法", 《计算机应用》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104378812A (en) * 2014-11-28 2015-02-25 北京农业信息技术研究中心 Differentiated topology control method of renewable energy source nodes of farmland self-organizing network
CN104378812B (en) * 2014-11-28 2017-09-29 北京农业信息技术研究中心 Farmland self-organizing network regenerative resource node difference topology control method

Also Published As

Publication number Publication date
CN104093184B (en) 2017-08-25

Similar Documents

Publication Publication Date Title
Junping et al. A time-based cluster-head selection algorithm for LEACH
Sharma et al. Optimal energy management policies for energy harvesting sensor nodes
CN107529201A (en) A kind of wireless sensor network data transmission method based on LEACH agreements
Liu et al. A distributed routing algorithm for data collection in low-duty-cycle wireless sensor networks
Li et al. Double cluster based energy efficient routing protocol for wireless sensor network
CN103796273A (en) Energy-balanced clustering routing strategy for wireless sensor networks
Zahedi An efficient clustering method using weighting coefficients in homogeneous wireless sensor networks
CN105472685A (en) Wireless sensor network routing energy saving method based on particle swarm
Shi et al. Adding duty cycle only in connected dominating sets for energy efficient and fast data collection
Li et al. Uneven Clustering Routing Algorithm Based on Optimal Clustering for Wireless Sensor Networks.
Deng et al. Early wake-up ahead node for fast code dissemination in wireless sensor networks
CN104093196A (en) LEACH alternating time dynamic optimization method based on energy consumption
CN104093184A (en) LEACH alternating time dynamic regulation scheme based on energy consumption
Guo et al. A cluster-based algorithm for energy-efficient routing in wireless sensor networks
Ghneimat et al. Adaptive, cluster based, sensor network routing protocol
CN104010339A (en) WSN clustering method based on packet loss probability measurement
Luan et al. An improved routing algorithm on LEACH by combining node degree and residual energy for WSNs
CN108307471B (en) Energy balance cluster head node selection method
Wang et al. An improved stable election based routing protocol with mobile sink for wireless sensor networks
Gautam et al. Dynamic clustering and distance aware routing protocol for wireless sensor networks
CN105959991A (en) Energy optimization routing method based on equivalent line model
Zhong et al. Time delay based clustering in wireless sensor networks
Zu-jue et al. A gaf algorithm of dislocated grid for wireless sensor network
Kaur et al. Hybrid TB-LEACH Energy Based Multihop Protocol
Bagchi et al. Hierarchical Neighbor Graphs: A Topology Control Mechanism for Data Collection in Heterogeneous Wireless Sensor Networks.

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