You are on page 1of 7

Leach Protocol- A Survey

Lakhan Solanki, Rahul Kumar


School Of Computer Science Engineering
VIT University, Vellore, Tamil Nadu
Gmail: lakhansolanki0@gmail.com , rk3639110@gmail.com

Abstract—As of late, there has been a developing sensors is regularly impractical. A steady number of energy-
enthusiasm for remote sensor systems. In WSNs sensor effective routing techniques have been introduced and
established for WSN, based upon their utilization and
nodes lifetime is the most basic parameter. Grouping of
architecture. Introducing a routing technique is loaded with
sensors, that is, a process called Clustering assumes a key
challenges, basically because of restricted power, low transfer
part of any wireless sensor network (WSN). Consummation
speed, low computational power, improper addressing schema,
of WSN can be enhanced by remodeling entire network
computational overheads and self-association of the sensor
into clusters of different size. Performance is identified as a
hubs. Any sensor node includes four fundamental
measure of energy and energy expended in any WSN. On
segments[10] : a sensing unit, a processing unit, a
the off chance that a WSN expends less power implies that
the energy put away in the sensor node (SN) has been kept communication unit, and a power unit as in figure 1.
up for a longer time. Clusters make various leveled
(hierarchy) WSN, which assimilate proficient usage of
limited assets of sensor nodes resulting in a prolonged
lifetime of the network. While scheming the WSN, limiting
energy dissipation and prolonging network lifetime are
primary issues in the plan of uses and conventions for
sensor networks. To reduce the overhead due to global
communication and randomized rotation of cluster head,
LEACH adapts the formation of the distributed cluster
and local processing.

Keywords—wireless sensor network(WSN), clustering,


LEACH, energy dissipation, network lifetime, randomized
rotation. Fig 1: Sensor Node Structure [1]

I. INTRODUCTION The entire system can be separated into a number of clusters,


this process is known as clustering. For every cluster, there is
Wireless Sensor Network is an extraordinary sort of non-
one sensor node which is opted as Cluster Head (CH) and
framework systems suitable for remote communication having
whatever remains of the hubs operate as Cluster Members
a sizable amount of low-cost sensor nodes with constrained
(CM)[3]. CH gathers the information from each individual
power and multi-utilitarian ability[1].These sensors are node among its members and aggregation of gathered data is
conveyed over an extensive territory with at least one Base carried out by each CH to remove redundant data and then
Station (BS). WSN has wide application conceivable information is sent to the BS. The energy consumed by CH is
outcomes, for example, temperature, weight, dampness and always greater than cluster member, to balance this, the
living space observing, debacle administration, military workload of the cluster is dispersed among all the nodes in a
observation, security reconnaissance and some more. WSNs wireless sensor network. This method can be stated as cluster
are not unified one as no static framework exists. WSN gives head rotation. There are two types of clustering, depending on
adaptability of including or excluding sensor nodes in the
the selection of Cluster Head. First one is static clustering,
system. In many situations, sensor nodes are arbitrarily
another dynamic clustering. In static clustering, there is no
conveyed with restricted battery control. The choice of routing
change in the cluster head until it is alive. But in dynamic
protocol is a primary issue for the productive conveyance of
clustering, the selection of cluster head takes place in every
detected information from its origin to the BS. The clustering
round depending on the energy they have. There are two
protocol utilized as a part of these kinds of systems ought to
guarantee least energy consumption as battery substitution in phases of clustering. They are clustering set up and clustering
maintenance. During the cluster set up phase, the nodes the node which are at some distance from base station. This
present in that group do not move from one location to another situation leads to the depletion of energy to the node closer to
location. Reorganization of the clusters is done periodically base station . As the energy level of that node reaches zero, a
due to the mobile nature of the node present in that cluster. hole is created near to base station. Due to this newly created
Whenever reorganization of cluster process is going on, it is gap, system gets divided into two parts. Because of this exter-
not possible for the network to rely on the cluster nal nodes become ineffective to find any way to transmit in-
organization[11]. CHs are the pioneer of a cluster. The major formation to base station. Opposite to that, the internal nodes
requirement of cluster head is to monitor activities inside the which have some amount of residual energy left are still able
cluster. These tasks incorporate yet not restricted to to exchange information with the base station.
information conglomeration and establishing the transmission
schedule for the cluster. G. Load balancing
II. GOALS OF CLUSTERING
In WSNs, to prolong the network’s lifetime, balancing of load
Some of the goals of clustering routing protocol are: is needed. Inside the cluster, sensor nodes are distributed to
create second level of hierarchy[6].
A. Less energy Consumption
III. LEACH
Energy is saved by performing data conglomeration which re- Various routing techniques have been projected for WSN like
sults in low transmission cost of data from node to BS. Utiliz- LEACH, HEED, PEGASIS, K- means and number of alterna-
ing clustering, sensors which are performing long-distance tives. Yet, the most realized among these are various leveled
communication tasks, their number can be lowered. In cluster- conventions, such as LEACH and PEGASIS. The main reason
ing, transmission of information is carried out by the CHs in to use this Hierarchical protocol is to reduce the consumption
such a way that it should cut down the consumption of energy of energy by aggregating data which leads to reduce transmis-
[2]. sion cost to the Base Station. LEACH is taken into account be-
cause it is the preferred routing protocol that use cluster-based
B. Data Aggregation
routing which minimizes energy dissipation.
CH gathers the information from each individual node among
its members and aggregation of gathered data is carried out by Low Energy Adaptive Clustering Hierarchy (LEACH) proto-
each CH to remove redundant data. col is a TDMA based Medium Access Control (MAC) proto-
col. By using this protocol, lifespan of WSNs can be improved
C. Scalability by attenuating the consumption of energy required for con-
struction and maintenance of CHs[3]. The operation of
At every node, the measure of the size of the stored routing ta- LEACH protocol consists of several rounds with two phases in
ble can be lessened by limiting the route set up using this each: Set-up Phase and Steady Phase[13].
topology. When contrasted with other existing routing meth-
ods, this is more adaptable to function in the situation. The fundamental objective of set-up stage is to create a cluster
and elect the CH by picking the sensor node with most ex-
D. Network lifetime maximization treme energy. The duration of Steady stage is longer than the
set-up stage. In this stage, CH gathers the information from
System lifetime is the term which can't be disregarded in
WSNs on the grounds that sensor hubs are prompted in the each individual node among its members and transmit it to BS.
supply of energy, the data transfer capacity of transmission.
Based on the strength of received signal the formation of cluster
begins.
E. Connectivity Guarantee
Set-Up Stage Steady Stage
To acknowledge if the information is conveyed effectively or
Time Slot 1 Time Slot 2 Time Slot 3
not to BS, is guaranteed by the availability of sensor node to
next lop of its own. In the event that the hubs can't interact
with each other than the information can't be exchanged to the
BSs[1].

F. Avoidance of energy holes

Multi-hop routing is used to deliver data to Base stations. The


node nearer to the base station transfers larger amount of Advertisement Cluster Set-Up Transmission
Schedule
packets as compared to the number of packets transferred by
Fig. 2 operation of LEACH (time-line)
The algorithmic rule for LEACH protocol is as follows: IV. Comparison of different Hierarchical routing protocol: -
The Set-up phase mainly consists of three fundamental steps.
1. Cluster Head advertisement Method Characteristics Conclusions
2. Cluster setup phase Comparison of 1. Analysis of 1. Network lifetime
3. Creation of Transmission Schedule LEACH and LEACH and is increased in
Initially, the advertisement packet is sent by cluster head to
LEACH-N LEACH – N LEACH – N to
inform all the cluster nodes in the network that they have been
protocol protocol based on 2900 rounds
declared as cluster head based on the accompanying
minimum distance whereas it was only
formula[12]: and more residual 2200 rounds in
energy is done. LEACH.
2. Proposal of
multi hop routing 2. Nodes were more
protocol with active in LEACH-
(1) LEACH to N.
minimize energy
Where, x is a random number
consumption of 3.Energy
0≤x≤1 n is the present node
sensor nodes. dissipation was low
P is the probability
3. The difference in LEACH-N as
r is the current round
between LEACH compare to
G is set of nodes
and LEACH-N LEACH.[1]
And, T(n) is the Threshold.
was that, the
If the random number x, chosen by the node n has a value LEACH-N
lesser than threshold T(n). Then for that particular round r, the algorithm check
out for the
node n becomes cluster head. Once the node is chosen as a
difference of
cluster head it will not be elected as a CH again until the point
remaining energy
that every one of the nodes of set G has been elected as CH
after each round to
once. Above rule is use to balance the consumption of energy elect the node as
during transmission. CH.
Comparison of 1. HEED uses 1. if the cluster
Secondly, after receiving cluster head advertisement packet LEACH and residual energy as have high power
those nodes which are not CH, send join request to the CH primary parameter level, it is used for
HEED(Hybrid
saying that for this particular round they are individuals from and node degree,
Energy Efficient inter-cluster
the cluster. These nodes remain inactive all the time by distance to communication and
Distributing)
keeping its transmitter off and the transmitter is turned on only neighbors are used if it level of power
when it has something to transfer to BS, thus reduces the extra as secondary is low, it endorses
energy dissipation [1]. parameter. an increment in
2. clustering spatial use.
In the third step, a transmission schedule (TDMA) is created process is split-ed 2. uniform cluster
by each of the chosen cluster head for the member nodes of into no. of head distribution,
their cluster. The priority of this TDMA schedule is decided iteration. and load balancing.
according to the total number of nodes in the cluster. Every 3. in every 3. forced cluster
node at that point transfers its information in the dispensed iteration, node that head may not have
time plan. has not been any member
elected as CH, associated with
The steady state is the next stage of LEACH operation amid doubles its them
which the member nodes transmit its information to their own probability to 4. sometimes, more
CH. The communication between the member sensors in each become CH. CHs get formed
cluster and its cluster head takes place via a single hop than expectation,
this results in
transmission. Conglomeration of gathered data is carried out
unbalanced energy
by each CH to remove redundant data and this data is consumption.[2]
forwarded to the BS either sraightforwardly or through
Improved LEACH 1.Proposed energy 1. Solves the issue
another CH alongside the static route. After the certain when probability of
impact factor and
predefined time, that is set previously, the system once more each node to be
distance impact
backpedals to the Set-up section. factor to overcome selected as cluster
the drawback of head is same.
LEACH protocol. 2. Solves the issue
2. Multi hop when energy CHs. uniform
routing of cluster consumption is 3.Require conveyance of
head was more if cluster head knowledge of CHs when
proposed. is far away from the distance between contrasted with
sensor node. CH and base LEACH.
3. Achieves the station. 2. Not suitable for
balance of network large range
flow. communication-
4. Extend the more energy
lifecycle of consumption.[6]
network.[3] LEACH-F 1. Centralized 1. once the fixed
PEGASIS 1. Instead of 1. It is different ( Fixed number of approach number of cluster is
(Power Efficient forming cluster, from LEACH in a cluster Low 2. There is no re- formed, through out
Gathering in this algorithm is way that it uses Energy Adaptive clustering phase in the network they
Sensor based on only one node for Clustering this algorithm. are maintained.
Information formation of chain transmission of data Hierarchy) 2. difficult to add or
System) of sensor nodes. to sink. remove a node.
2. In the chain, 2. It reduces the 3. node can’t adjust
next node collects volume of data their behavior on
data of its own transmitted through dying.[7]
previous node. The the chain due to TL-LEACH 1. uses two level 1. CHs which are
next node sends its aggregation and far away from BS
(Two Level Low of hierarchy.
own data along redundancy die early, this
Energy Adaptive 2. CH at level 1
with collected data checking. algorithm increases
Clustering collects data form
to next ring. 3. Within the all the sensor efficiency of CH by
Hierarchy)
3. To forestall network, energy nodes, aggregates using two level of
early passing of load is distributed it and transfers it Hierarchy.
sensor hub, all uniformly. [4] to CH at level 2. 2. CH at level-2
hubs are chosen as 3. now, CH at acting as relay node
a pioneer level 2 transmits between CH at
progressively. data to base level-1 and BS,
DEEC 1. Cluster Head are 1. As compare to station. reduces
(Distributed picked by the HEED or LEACH,
transmission
Energy Efficient likelihood in the this protocol
view of the performs well in energy.[8]
Clustering)
proportion multilevel wireless V-LEACH 1. idea is 1. reduces the
between energy of network. (Vice Cluster Head somewhat similar selection of new
sensor node to Low Energy to TL-LEACH. CH when any CH
2. At every election
average energy of Adaptive 2. If CH dies, vice dies because in that
round, it does not
wireless sensor Clustering CH takes the role case Vice CH
require the
network. Hierarchy ) of CH and transmits data to
knowledge of
2. The sensor with transmits data to BS.
energy.[5]
more starting and BS, without 2. In TL-LEACH, if
leftover energy hampering the data CH at level 2 dies
have high transmission. ,transmission of
possibility to end data to BS stops.
up as a CH. This issue has been
overcome in
EECS 1. Based on 1. Clustering is V-LEACH.[9]
( Energy Efficient leftover energy, a processed by Conclusion
Clustering steady number of dynamically sizing For prolong lifetime of the network, effective utilization of
Scheme) sensors rival each the WSN
other to be chosen energy in system is one of the principal issue in WSNs.
depending upon the
LEACH has been found as one of the most energy efficient
as CH. distance between
protocols used in WSN. Till now, various LEACH protocols
2. This process cluster and BS.
produces a near This results in low have been implemented. In this survey, different Hierarchy
uniform communication protocol has been discussed with its characteristic and these
distribution of overhead and
protocols are also compared to LEACH protocol. However, for 10. J.Zheng and A.Jamalipour, Wireless Sensor
every protocol there are some advantages and disadvantages. Networks: A Networking Perspective, Institute of
Many more advance protocols are required to satisfy the Electrical and Electronics Engineers, 2009.
various constraints emerging due to different factors like cost, 11. Stefano Basagni, “Distributed Clustering for Ad Hoc
scalability, environment, fault tolerance,change in topology,
Networks” , International Journal of Computer
and power utilization for acknowledgement of sensor
Applications-2010-pp. 1
networks. It is finished up from given review that for drawing
out system lifetime of WSN, there is have to investigate more 12. Amrinder Kaur, Sunil Saini,” Simulation of Low
working, advance, solid and proficient conventions in future. Energy Adaptive Clustering Hierarchy Protocol for
Wireless Sensor Network,” International Journal of
Advanced Research in Computer Science and
References Software Engineering, Volume 3, Issue7, July 2013.
13. Yuh Ren Tsai, “Coverage Preserving Routing
1. Sunita Parashar and Poonam Sharma “Perforrmane
Protocols for Randomly Distributed Wireless Sensor
Comparison Of LEACH and LEACH-N proocol by
Networks”, IEEE Transactions on Wireless
MATLAB” , International Journal Of Advanced
Communications, Volume 6- No. 4 (April 2007).
Research in Computer Science, vol.3,No.4, August
14. Jian-guang Jia, Zun-wen He, Jing-ming Kuang, and
2012
Cun-xiang Chen, “An Energy-efficient Adaptive
2. Ossama Younis and Sonia Fahmy. 2004. Distributed
Clustering Routing Algorithm for Wireless Sensor
Clustering in Ad-hoc Sensor Networks: A
Networks,” in Proc. of Cross Strait Quad-Regional
Hybrid,EnergyEfficient Approach. In Proceedings of Radio Science and Wireless Technology Conference
IEEE INFOCOM, Hong Kong, an extended version
(CSQRWC), 2011 , vol.2, p-964-969, 26-30 July
appeared in IEEE Transactions on Mobile
2011.
Computing, 3(4)
15. Kevin L. Mills, A brief survey of self- organization
3. Jianguo SHAN and Lei DONG “Research on
in wireless sensor networks, Wireless
Improved LEACH Protocol of Wireless Sensor
Communications and Mobile Computing, Wirel.
Networks”
Commun. Mob. Comput. 2007; 7:823–834 Published
4. S. Lindsey, C. Raghavendra. 2002. PEGASIS: Power
online 10 May 2007 in Wiley InterScience
Efficient Gathering in Sensor Information Systems.
DOI:10.1002/wcm.499
IEEE Aerospace Conference Proceedings, Vol. 3, 9-
16. O.Younis and S. Fahmy, HEED A hybrid energy-
16 pp. 11251130. efficient, distributed clustering approach for ad hoc
5. Q. Li, Z. Qingxin, and W. Mingwen. 2006. Design of sensor networks, IEEE Trans. Mobile Computing,
a distributed energy efficient clustering algorithm
vol. 3, no. 4, pp. 660–669, 2004.
for heterogeneous wireless sensor networks.
Computer Communications, vol. 29, pp. 2230-7.
6. M. Ye, C. Li, G. Chen, J. Wu. 2005. EECS: an energy
efficient cluster scheme in wireless sensor networks.
In IEEE International Workshop on Strategies for
Energy Efficiency in Ad Hoc and Sensor Networks
(IEEE IWSEEASN-2005), Phoenix, Arizona, April 7–
9.
7. P.Manimala and R.Senthamil selvi, “A Survey on
Leach-Energy Based Routing Protocol,”
International Journal of Emerging Technology and
Advanced Engineering (IJETAE), vol.3, issue 12, pp.
657-660, December 2013.
8. R.Kaur, D.Sharma, and N.Kaur, “Comparative
Analysis Of Leach And Its Descendant Protocols In
Wireless Sensor Network,” International Journal of
P2P Network Trends and Technology (IJPNTT), vol.
3, issue 1, pp. 51-55, 2013.
9. Y.Lu, D.Zhang, Y.Chen, X.Liu, and P.Zong,
“Improvement of LEACH in Wireless Sensor
Networks based on Balanced Energy Strategy,” in
Proc. of the IEEE, International Conference on
Information and Automation (ICIA), Shenyang,
China, pp.111,115, 6-8 June.2012.

You might also like