A Survey on Leach and Hierarchical-Leach based protocol

[1]
Jagpreetsingh, [2]SandeepakBhandari,[3]JaspreetKaur

CT Institute of Technology & Research

Greater Kailash, G.T Road,
Maqsudan
Jalandhar, www.ctgroup.in

Abstract-Advances in technology, today wireless sensor network. Wireless sensor

wireless sensor network play a very important
role in technology. A wireless sensor network is
a wireless network that contains a collection of
nodes. These sensor nodes communicate over a
wireless medium such as infrared, Bluetooth
etc. The issue in wireless sensor network is
sensor nodes, sensor nodes are battery
operated, small in size and they carry limited
resources and having limited battery. To
enhance the battery power of sensor nodes
researches design various protocol such as flat,
hierarchical and location aware protocol. In
this paper we discuss a survey on Hierarchical
routing protocol such as LEACH (low energy
adaptive clustering hierarchy). In this paper we
define various LEACH protocol based on
selection of cluster head, reduce energy
consumption etc.
Keywords- Introduction, LEACH, and
Hierarchical-Leach based routing protocol.
I. INTRODUCTION
Wireless Sensor Networks (WSNs) have been
widely considered as one of the most important
technologies for the twenty-first
century.Awireless sensor network is a type of
wireless network. A wireless sensor network is
a wireless network that made up of a number of
sensors node and at least with one base station.
In wireless network a collection of nodes
organized in a cooperative network. Energy
saving is the crucial issue in designing the
wireless sensor networks. In order to maximize
the lifetime of sensor nodes, it is preferable to
distribute the energy dissipated throughout the
network has two types-structured and
unstructured. In structured wireless sensor
network, the all sensor nodes are deployed in
pre designed manner. In unstructured a
collection of sensor nodes deployed in adhoc
manner into a region. Once deployed, the
network is absent unattended perform
monitoring and reporting functions. The benefit
of structure wireless sensor network is that
some nodes can be deployed with lower
network maintenance and management cost.
Fewer nodes can be deployed at specific
locations to provide coverage while ad hoc
deployment can have uncovered regions.
Sensor nodes are collecting data about
environment, after collecting it they process it
and then transmit to the base station. Base
station provides an interface between user and
internet. Basic characteristic of the wireless
sensor network are limited energy, dynamic
network topology, lower power, node failure,
mobility of the nodes, short-range broadcast
communication, multi-hop routing and large
scale of deployment. Energy consumption and
network life time has been considered as the
major issues in wireless sensor network
(WSN). In wireless sensor networks the size
and cost of the sensor nodes may vary from
micro to macro and from one to few hundred
dollars respectively. Battery power decides
whether the sensor nodes sense for long time or
for short time even the battery cannot be
recharged or replaced.Sensor nodes carry
limited power resources that are irreplaceable
therefore; there is a need to design an energy
efficient technique to increase the life of
wireless sensor networks. Wireless sensor
networks follow some approaches for
improving the lifetime of battery like energy-
aware technique, multi-hop routing and density
control technique but these approaches still
need to be improved. On the basis of network
structure, routing protocol are divided into
three parts: flat routing protocol, Hierarchical
routing protocol and location aware. In flat all
the nodes have same rules i.e sensing the
environment and sending the data to the base
station. So it has very low network lifetime. In
hierarchical the low energy nodes sense the
environment and high energy nodes used to
send the data to the base station. Location
based routing can be used in networks where
sensor nodes are able to determine their
position using a variety of localization system
and algorithm.
II. LEACH
Clustering- Clustering is an useful technique
to reduce the energy
consumption.Cluster analysis or clustering is
the task of grouping a set of objects in such a
way that objects in the same group are more
similar (in some sense) to each other than to
those in other groups. Naturally, grouping
sensor nodes into clusters have been widely
adopted by researcher to satisfy the network
objective, for achieving high energy efficiency
and prolonging the network lifetime. There are
two type of clustering that use in WSN such as
static and dynamic.
In static, once the cluster is made we cannot
change it by any operation and in dynamic;
once the cluster is made we can change it
through some operation and depend on
situation.
In this paper we explain dynamic clustering i.e
hierarchical-leach based routing protocols.
LEACH(low-energy adaptive clustering
hierarchy) protocol-The LEACH (Low-
Energy Adaptive Clustering Hierarchy), an
architecture for remote micro sensor networks
that combines the ideas of energy-efficient
cluster-based routing and media access together
with application-specific data aggregation to
achieve good performance in terms of system
lifetime, latency, and application- perceived
quality. LEACHuses a clustering architecture,
where the nodes in the cluster send their data to
a local cluster-head. This node is responsible
for receiving all the data from nodes within the
cluster and aggregating this data into a smaller
set of information that describes the events the
nodes are sensing. Thus the cluster-head node
takes a number of data signals and reduces the
actual data (total number of bits) while
maintaining the effective data (information
content). The cluster-head node must then send
the aggregate data set to the end-user. LEACH
is a self-organizing, adaptive clustering
protocol that uses randomization to distribute
the energy load evenly among the sensors in the
network. In LEACH, the nodes organize
themselves into local clusters, with one node
acting as the local base station or cluster-head.
If the clusterheads were chosen a priori and
fixed throughout the system lifetime, as in
conventional clustering algorithms, it is easy to
see that the unlucky sensors chosen to be
cluster-heads would die quickly, ending the
useful lifetime of all nodes belonging to those
clusters. Thus LEACH includes randomized
rotation of the high-energy cluster-head
position such that it rotates among the various
sensors in order to not drain the battery of a
single sensor.The goal of LEACH is to lower
the energy consumption required to create and
maintain clusters in order to improve the life
time of a wireless sensor network. LEACH is a
hierarchical protocol in which most nodes
transmit to cluster heads, and the cluster heads
aggregate and compress the data and forward it
to the base station (sink).Each node uses a
stochastic algorithm(these algorithms
incrementally alter inconsistent value
assignments to all the variables) at each round
to determine whether it will become a cluster
head in this round. In addition, LEACH
performs local data fusion to compress the
amount of data being sent from the clusters to
the base station, further reducing energy
dissipation and enhancing system lifetime.Once
all the nodes are organized into clusters, each
cluster-head creates a TDMA schedule for the
nodes in its cluster. This allows the radio
components of each non-cluster-head node to
be turned off at all times except during its
transmit time, thus minimizing the energy
dissipated in the individual sensors. Once the
cluster-head has all the data from the nodes in
its cluster, the cluster-head node aggregates the
data and then transmits the compressed data to
the base station.
The operation of LEACH is broken up into
rounds, where each round begins with
aAdvertisement phase, a set-up phase, when the
clusters are organized, followed by a steady-
state phase, when data transfers to the base
station occur.
Advertisement phase-when clusters are being
created, each node decides whetheror not to
become a cluster-head for the current round.
This decision is based on the suggested
percentage
of cluster heads for the network(Nodes that
have been cluster heads cannot become cluster
heads again for P rounds, where P is the
desired percentage of cluster heads. Thereafter,
each node has a 1/P probability of becoming a
cluster head in each round).Once the cluster
head is elected for the current round then
cluster-head node broadcasts an
advertisementmessage (ADV). This message
containing the node's ID and a header that
distinguishes thismessage as an announcement
message. However, this message must be
broadcast to reach all of the nodes in the
network.
Set-up phase- After each node has decided to
which cluster it belongs,it must inform the
cluster-head node that it will be a member of
the cluster. Each node transmits a join-request
message (Join-REQ)back to the chosen cluster-
head.This message isagain a short message,
consisting of the node's ID, the cluster-head's
ID, and a header. The cluster-head node sets up
a TDMA schedule and transmits this schedule
to the nodes in the cluster. This ensures that
there are no collisions among data messages
and also allows the radio components of each
non-cluster-head node to be turned off at all
times except during their transmit time, thus
minimizing the energy dissipated by the
individual sensors. After the TDMA schedule is
known by all nodes in the cluster, the set-up
phase is complete and the steady-state
operation (data transmission) can begin.
Steady-state phase- In steady-state phase
data transfers to the base station. The steady-
state operation is broken into frames, where
nodes send their datato the cluster-head at
most once per frame during their allocated
transmission slot. Each slotin which a node
transmits data is constant, so the time for a
frame of data transfer depends on the
number of nodes in the cluster. To reduce
energy dissipation, each non-cluster-head
node uses power control to set the amount of
transmits power based on the received
strength of the cluster-head advertisement.
III. Hierarchical-Leach based
routing protocols
 Lifetime enhancement and Load
balancing- SNs are small in size so they
carry limited resources. SNs operated on
battery power since they small in size thats
why it have a limited battery power. To
enhance the battery power of authors define
various protocol.
VR-Leach- Variable round-Leach, In this
protocol CH is selected according to the
situation of SN. Lifetime of the network is
enhanced by using VR-Leach. In the initial
step, nodes having energy less than the
average are selected and only those nodes
are allowed to participate in the CH
selection which has energy greater than the
average energy.
B-Leach- Balanced- Leach, It removes the
problem of fluctuation of the number of CH
and considered the residual energy of nodes
as the parameter for CH selection. In this
scheme, in the first round CH is selected
based upon the LEACH protocol and in the
second phase node residual energy is
considered for CH selection.
N-Leach- It improves the selection process of
CH. N-Leach take the advantage of residual
energy of nodes. The CH used the distance
from the BS to avoid many CHs to
communicate directly with the BS.
ER-Leach- Efficient routing-Leach, In this
protocol, author focused on the data, as BS
is to get the data from environment. In
which data can be aggregated by nodes
rather than directly send to the BS. Author
enhances the selection of CH during first
phase and use alternative CH when the
underlying CH dies. For load balancing
author use the zone routing protocol.
Energy & Multi-hop Leach- In energy
leach author improve the selection of CH
using some parameter like by gather nodes
that have high residual energy. To improve
the communication among the CH and BS,
multi-hop protocol has been proposed.
Leach-D- Leach- Density distribution of
node protocol, here author focused on
energy load balancing by making an
prediction in the threshold function that
defined by the fixed radius of region of
deployment of sensor nodes. In which CH
decides its cluster radius according to their
distance from the BS. Major component
used in the threshold is the connectivity
density. Non-cluster node join the cluster
according to the energy of CH and the
distance from CH. CH uses a multi-hop
routing to transmit the data. It was observed
that Leach-D reduces the entire network
energy consumption.
EDL- energy and distance Leach, In which
author uses the concept of energy and
distance of nodes. In which CH distribute in
actual region so it avoid unnecessary energy
loss. In steady-state phase, single hop
communication model is used among CH
and BS.
 TL-Leach- Two level hierarchy Leach, In
which author uses random rotation of CHs.
Two level hierarchies allow distributing the
energy load among the sensor nodes in the
network especially when the density of
network is higher. It consist four phases-
Advertisement phase, Cluster setup phase,
Schedule creation and data transmission.
Energy Efficiency- Sensor nodes are
battery operated so the energy efficiency
play an important role in CH selection. Non-
cluster head node send the data to CH and
CH aggregate the data and send data to the
Base station. Through this more energy is
saved and network lifetime increased.
Leach-C- Centralized Leach, The main work
of Leach-C protocol was to combine the
energy efficient clustering and routing for
application-specific data aggregation to
increase the network lifetime.
DE-Leach- DE-Leach improved the selection
of CH throughout the network using some
simple and fast search features. It avoids
the blind nodes to increase the lifetime of
network.
ID-Leach- Identification Leach, ID-Leach
provide a unique identification number to
each node. Using these ID base station send
data to a particular node so the network
lifetime is increased and the battery power
of all nodes is saved because when BS send
data to a particular node all other nodes do
not work and in sleeping state.
Leach-ER- Ensuring reliable data delivery
Leach, In this author worked on the concept
of selection of CH based on their energy
efficiency and reliability. More energy
consume in packet reception so the author
reduce the communication between CH and
CMs within cluster, which reduce energy
consumption of the network to prolong the
lifetime of the network.
TB-Leach- Time based cluster head
selection Leach, Inwhich author improved
the selection of CH that based on time
interval. In network, each node has a
particular time interval. Selection of CH is
done based upon the shortest time interval.
In the beginning, each node produces a
random timer. Based on these times node
will become a CH for a current round/phase.
Prolonging a lifetime of network- By
reducing the energy consumption authors
proposed a different protocol to enhance the
lifetime of network.

MR-Leach- Multi-hop routing Leach, In
which author used the multi-hop concept to
reduce the energy consumption. By reducing
the distance of CH to CH and CH to BS author
show the better result as compared to others.
It works on three phases-
a) Cluster formation at the lowest level
b) Cluster discovery at different levels by BS
c) Scheduling
W-Leach- weighted Leach, In which author
used the concept of weight of nodes. CH is
selected based on the weight of sensor nodes.
Sensor node weight is calculated by sensor
density and their energy and remaining energy.
Leach-SC- Selective cluster Leach, This
protocol is the modified version of LEACH in
terms of distance based clustering. In which
CH are selected on the basis of distance i.e
between BS. Node thats in center and near of
BS are selected as CH. Selected CH, transmit
their ID and local position to the nearest CH
NCH).
Conclusion- Inthis paper we explain all about
LEACH protocol and their types depend on
some parameter or factor. Author define many
protocol to enhance the network lifetime and
battery power of node but still there is need to
define some modified version of protocol to
enhance the battery power of nodes. In future,
we can use relay nodes by replacing sensor
nodes. Relay nodes in expensive as compared
to sensor nodes and carry all resources that are
needed to transmit the data with high power.
References
[1] M.Bani and A.Ijjeh,A survey on LEACH
based energy aware protocol for wireless sensor
networks, in journal of communication Vol.8,
NO.3, MARCH 2013.
[2] X.Song and J.Wang,A Hierarchical routing
protocol based on AFSO algorithm for WSN,
in international conference on computer design
and application, 2010.
[3] K.Chong, M.Gaber and S.Loke,Energu-
aware data processing techniques for WSN: A
review, in TLDKS 3, LNCS 6790, pp. 117-
137, 2011, springer-verlag berlin Heidelberg
2011.
[4] J.Shan, L.Dong, Y.Gao,Research on
improved LEACH protocol of wireless sensor
networks, in PRZEGLAD
ELEKTROTECHICZNY, ISSN 0033-2097,
R.89 NR 1b/2013.
[5] Z.Peng and X.Li, The improvement and
simulation of LEACH protocol for WSNS, in
978-1-4244-6055-7/10/$26.00 2010 IEEE.
[6] M.Tong and M.Tang; LEACH-B:An
improved LEACH protocol for wireless sensor
network, in 978-1-4244-3709-2/10/$25.00
2010 IEEE.
[7] B.Heinzelman, H.Blakrishnana and
P.Chandrakasan, An application-specific
protocol architecture for wireless microsensor
networks, in IEEE transaction on wireless
communication , VOL.1, NO.4, October 2002.
[8] N.Israr and I.Awan, Multihop clustering
algorithm for Load balancing in wireless sensor
networks, in I.J of simulation VOL.8, NO.1,
ISSN 1473-840X.
[9] F.Akyildizet. Al , A survey on Sensor
networks, in IEEE communication magazine
2002, 0163-6804/02/$17.00.
[10] Y.Liu, Y.Zhao and Y.Jia,Multi-layer
clustering routing algorithm for wireless
vehicular sensor networks, in IET
th
communication on 8 march 2009.