Low Energy Adaptive Clustering Hierarchy for Wireless Sensors Network

Sahil Jain1, Anshul Sharma1, Balagopal T.S1, Chandra Mohan B2

1UG Student, SCOPE, VIT University, India
2Associate Professor, SCOPE, VIT University, India

Abstract: A wireless sensor networks (WSN) is made up of microscopic sensor nodes to handle physical or
environmental conditions like temperature, pressure, sound, and humidity. WSN acquires self configuration
strengths as the positions of the individual sensor nodes are not calculated in advance. Routing techniques and
security issues are a great research challenge now days in WSN (Nayak, et al., 2015). Hence, this paper will
accentuate on the WSN’s routing protocol mainly LEACH. Numerous of routing protocols have been suggested
for WSN but hierarchical protocols are the most famous ones. Therefore, in this paper we propose energy based
optimization and gives clustered based architecture. The results of the proposed LEACH protocols provide
optimal results for WSN.
Keywords: Wireless Sensor Networks, Routing, Leach, Cluster, Energy Efficient

1. Introduction
Wireless device networks were first used for military applications in the tertiary of honor inspection but now a
day these networks are employed in certain industrial and shopper operations such as process observation and
management, machine health observation etc. In computer science and telecommunications, wireless device
networks such as IPSN, SenSys, and EWSN are a dynamic inventory area for many diverse workshops and
conferences organized every year. In this paper we will analyze all the features about LEACH protocol such as
various phases of LEACH, various attacks on LEACH protocol, pros and cons of LEACH and moreover this
paper will also give an overview for other existing routing protocols like AODV, DSDV, DSR etc. In the figure
0 we can see how WSN connects to the user. (Nayak, et al., 2015)

Figure 0 WSN Connecting to User

A number of security issues are there in WSN which need to be analyzed very carefully thus we need to make
an acceptable security mechanisms and overcome security issues that arise within the device atmosphere.
However, coming up with new security protocols and mechanisms is strained by the capabilities of the device
nodes. This section discusses the constraints that complicate the safety style and readying in device networks.
It’s vital to know the strained capabilities of device nodes if you want to develop correct security that balances
exacting security performance against device nodes' limitations (Sangulagi, et al., 2011). Sensor networks may
be deployed in remote or hostile environments like battlefields. In these cases, the nodes cannot be shielded
from physical attacks, since anyone may have access to the placement wherever they're deployed. A human may
capture a device node or perhaps introduce his own malicious nodes within the network. If the latter is that the
case, the advisors aim is to trick the network into exceptive his nodes as legitimates.
Most of the time, deploying a device network during a hostile environment is done by random distribution, i.e.
from an airplane. Therefore, it's tough to understand the topology of device networks a priori. In these things,
it's arduous to store varied secret writing keys on nodes so as to ascertain secret writing among a bunch of
neighbors, since the neighborhood cannot be identified a priori.
The power restrictions of device nodes area unit raised attributable to their tiny physical size and lack of wires.
Since the absence of wires ends up in lack of a relentless power provide, not several power choices exist. .
However, as a result of a device network contains tons of to thousands of nodes, and because typically WSN
area unit deployed in remote or hostile environments, it is difficult to exchange or recharge batteries (Bechkit et
al., 2012). In the case of process power, computations area unit coupled with the offered quantity of power. As
we will perceive, since there's a restricted quantity of power, computations area unit strained additionally. The
restricted capability for storage affects the storage of crypto logical keys moreover per the secret writing theme
used, every device node may have to understand variety of keys for every alternative node within the network to
secure communication, and so store the keys within the nodes’ space for storing.

2. Need of Routing Protocols in WSN

Taking under consideration the reduced capabilities of sensors, the communication with the sink may well be at
the start planned while not a routing protocol. With this premise, the flooding rule stands out because the
simplest answer. During this rule, the transmitter broadcasts the information that area unit consecutively
retransmitted so as to create them make the meant destination (He, et al., 2014). However, its simplicity brings
concerning important drawbacks. Firstly, an implosion is detected as a result of nodes redundantly receives
multiple copies of constant information message. Then, because the event is also detected by many nodes within
the affected space, multiple information messages containing similar data area unit introduced into the network.
Moreover, the nodes don't take under consideration their resources to limit their functionalities.
Due to the deficiencies of the previous methods, routing protocols become necessary in wireless sensing
element networks. None the less, the inclusion of a routing protocol during a wireless sensing element network
isn't a trivial task. One among the most limitations is that the identification of nodes. Since wireless sensing
element networks area unit shaped by a big range of nodes, the manual assignation of distinctive identifiers
becomes impossible. (He, et al., 2014) The employment of doubtless distinctive symbol like the raincoat
(Medium Access Control) address or the GPS coordinates isn't suggested because it forces a big payload within
the messages. However, this downside is definitely overcome in wireless sensing element networks since an IP
address isn't needed to spot the destination node of a selected packet. In fact, attribute-based addressing fits
higher with the specificities of wireless sensing element networks. During this case, an attribute like node
location and sensing element sort is employed to spot the ultimate destination.

3. Existing Routing Protocols

3.1 Ad hoc On-Demand Distance Vector (AODV)
AODV is a routing protocol for mobile ad hoc networks and other wireless ad hoc networks. This protocol
establishes routes between nodes only if they are requested by source nodes. AODV is therefore considered as
an on-demand protocol and does not create any additional traffic for communication along links. It supports
unicast and multicast routing. The routes are maintained as long as they are needed by the sources. They also
form trees to connect multicast group members. (Li, et al., 2012) AODV uses sequence numbers to keep routes
fresh. They initiate on their own and are loop-free, besides scaling to numerous mobile nodes. In AODV,
network nodes that need connections broadcast a request for connection. The remaining nodes forward the
message and record the node that requested a connection. Thus, they create a series of temporary routes back to
the requesting node. A node that receives such messages and has a route to the destination node, send a
backward message through the temporary routes to the requesting node. The node that started the request takes
the route with the least number of hops through other nodes. The entries that are not used in routing tables are
recycled after some time. If a link fails, the routing error is sent back to the transmitting node and the process is
repeated.

3.2 Destination-Sequenced Distance Vector (DSDV)

DSDV is a table-driven routing protocol for ad hoc mobile networks. Each entry in the routing table has a
sequence number, the sequence numbers are generally even if a link is present; else, an odd number is used. The
number is created by the destination, and the emitter has to send out the next update with this number. Routing
information is shared to nodes by sending full dumps irregularly and smaller incremental updates more
regularly. (Ahmed, et al., 2016)
Selection of route: If a router obtains new information, then it uses the recent sequence number. If the sequence
number is the same as the one already present in the table, the route with the superior metric is used. Entries
which are not updated for a while are known as Stale Entries. Such entries as well as the routes using those
nodes as next hops are deleted.
Merits: The availability of routes to all destinations in network refers that there is limited delay in setting up the
route. The approach of incremental update with sequence number labels marks the existing wired network
protocols adaptable to ad hoc wireless networks. Therefore, all available wired network protocol can be useful
to ad hoc wireless networks with less modification. Demerits: DSDV needs frequent updates of its routing
tables, which requires power and some amount of bandwidth even when the network is idle. Whenever the
topology of the network changes, a new sequence number is needed before the network re-converges; thus,
DSDV is not effective for highly dynamic or large-scale networks. (Ahmed, et al., 2016)
3.3 Dynamic Source Routing (DSR)
DSR is a routing protocol for wireless mesh networks. It is same as AODV in that it forms a route on-demand
when a transmitting node requests one. However, it uses source routing in place of depending on the routing
table at each intermediate device. Finding source route needs collecting the address of every device between the
source and destination during route discovery. (Li, et al., 2012, pp. 609-614) The accumulated path information
is cached by nodes processing the route discovery packets. The learned paths are used to route packets. To
accomplish source routing, the routed packets which have the address of each device will traverse. This may
result in high overhead for long paths or large addresses. To avoid using source routing, DSR optionally defines
a flow id option that allows packets to be sent on a hop-by-hop basis.
This protocol is based on source routing, where all the routing information is continuously updated at mobile
nodes. It has only two major phases which are Route Discovery and Route Maintenance. Route Reply would
only happen if the message has reached the destination node. To return the Route Reply, the destination node
must have a route to the source node. If the route is in the Destination Node's route cache, the route would be
used. Otherwise, the node will reverse the route based on the route record in the Route Request message header.
In the situation of wrong transmission, the Route Maintenance Phase is started whereby the Route Error packets
are created at a node. The erroneous hop will be removed from the node's route cache; all routes containing the
hop are removed at that point. (Liu, et al., 2015, pp. 281-286)
Again, the Route Discovery Phase is initiated to determine a possible route. DSR is an on-demand protocol
designed to restrict the bandwidth used by control packets in ad hoc wireless networks by eliminating the
periodic table-update messages required in the table-driven approach. The major difference between this and
other on-demand routing protocols is that it is beacon-less and hence does not require periodic hello packet
transmissions, which are used by a node to inform its neighbors of its presence. The basic concept of this
protocol is same as any other on-demand routing protocol—to create a route by flooding Route Request packets
in the network during the route construction phase. The destination node, on receiving a Route Request packet,
responds by sending a Route Reply packet back to the source, which carries the route traversed by the Route
Request packet received. (Li, et al., 2012, pp. 609-614)
3.4 The Wireless Routing Protocol (WRP)
The WRP is a proactive unicast routing protocol for mobile ad hoc networks. It is a table-based distance-vector
routing protocol. Each node in the network maintains a Distance table, a Routing table, a Link-Cost table and a
Message Retransmission list. The Distance table of a node contains the distance of each destination node via
each neighbor of the node. The Routing table of a node x contains the distance of each destination node from
node x, the predecessor and the successor of node x on this path. It also incorporates a tag to recognize if the
entry is a simple path, a loop or invalid. (Liu, et al., 2011, pp. 132-140) Storing predecessor and successor in the
table is important in detecting loops and avoiding counting-to-infinity problems. The Link-Cost table
incorporates cost of link to each neighbor of the node and the number of timeouts since an error-free message
was received from that neighbor.
The Message Retransmission list (MRL) contains information to let a node know which of its neighbor has not
acknowledged its update message and to retransmit update message to that neighbor. Nodes exchange routing
tables with their neighbours using update messages regularly likewise on link changes. The nodes present on the
response list of update message (formed using MRL) are required to acknowledge the receipt of update
message. If there is no change in routing table since last update, the node is required to send an idle Hello
message to ensure connection. On receiving an update message, the node changes its distance table and looks
for better routes using new information. Any new route so found is relayed back to the original nodes so that
they can update their tables (El Ghazi, et al., 2016). The node also updates its routing table if the new path is
better than the existing path. On receiving an acknowledgement, the node updates its MRL. An exclusive
feature of this algorithm is that it checks the consistency of all its neighbours every time it encounters a change
in link of any of its neighbours. Consistency check in this manner helps remove looping situations in a better
way and also has fast convergence.
3.5 Global State Routing
GSR is similar to DSDV. In this protocol or algorithm, each node preserves a Neighbour list, a Topology table,
a Next Hop table and a Distance table. Neighbour list of a node contains the list of its neighbours. For every
destination node, the Topology table incorporates the link state information as recorded by the destination and
the timestamp of the information. For each destination, the Next Hop table contains the next hop to which the
packets must be forwarded. The Distance table contains the shortest distance to each destination node. The
routing messages are formed on a link modification. On receiving a routing message, the node updates its
Topology table if the sequence number of the message is newer than the sequence number stored in the table.
After this the node redesigns its routing table and broadcasts the data to its neighbours ( X.-M, et al.,2012).
4. Proposed Protocol “LEACH”
Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is a Time Division Multiple Access (TDMA)
based MAC protocol. The principal aim of this protocol is to improve the lifespan of wireless sensor networks
by lowering the energy consumption required to create and maintain Cluster Heads. The operation of LEACH
protocol consists of several rounds with two phases in each. Set-up Phase and Steady Phase as shown in Figure1
(Liu, et al., 2011, pp. 132-140) In the Set-up phase the main goal is to make cluster and select the cluster head
for each of the cluster by choosing the sensor node with maximum energy. Steady Phase which is comparatively
longer in duration than the set-up deals mainly with the aggregation of data at the cluster heads and transmission
of aggregated data to the Base station.
As described earlier the operation of LEACH consists of several rounds with two phases in each round.
Working of LEACH starts with the formation of clusters based on the received signal strength.

Figure 1 Phases of LEACH

The first phase of LEACH is Set-up phase and it has three fundamental steps.
1. Cluster Head advertisement 2. Cluster setup 3. Creation of Transmission Schedule
During the first step cluster head sends the advertisement packet to inform the cluster nodes that they have
become a cluster head on the basis of the following formula given in figure 2.
Let x be any random number between 0 and 1. Where n is the given node, p is the probability, r is the current
round, G is the set of nodes that were not cluster heads in the previous round, T(n) is the Threshold.

Figure 2 Formula for Becoming Cluster Head

The node becomes cluster head for the current round if the number is less than threshold T(n). Once the node is
elected as a cluster head it cannot become cluster head again until all the nodes of the cluster have become
cluster head once. This helps in balancing the energy consumption. In the second step, the non cluster head
nodes receive the cluster head advertisement and then send join request to the cluster head informing that they
are the members of the cluster under that cluster head as shown in Figure 3. These non cluster head nodes saves
a lot of energy by turning off their transmitter all the time and turn it ON only when they have something to
transmit to the cluster head. In the third step, each of the selected cluster head generates a transmission schedule
for the member nodes of their cluster. TDMA schedule is created according to the number of nodes in the
cluster. Each node then transmits its data in the allocated time schedule. (Niu, et al., 2016, pp. 1985-1990)

Figure 3 Cluster Formation

The second phase of LEACH is the Steady phase during which the cluster nodes send their data to the cluster
head. The member sensors in each cluster communicate only with the cluster head via a single hop
transmission. The cluster head then aggregates all the acquired data and forwards this data to the base station
either directly or via another cluster head along with the static route defined in the source code as shown below
in Figure 4. After the certain predefined time, which is decided beforehand, the network again goes back to the
Set-up Phase. (Niu, et al., 2016, pp. 1985-1990)

Figure 4 Steady Phase of Leach

5. Conclusion

The proposed LEACH protocol has many advantages such as the Cluster Heads aggregates the whole data
which results in reduced traffic in the entire network, As there is a single hop routing from nodes to cluster head
it results in saving energy, It increases the lifetime of the sensor network, In this, location information of the
nodes to make the cluster is not needed, LEACH is completely distributed as it does not require any control
information from the base station as well as no global knowledge of the network is needed. (Nayak, et al., 2015)

6. References

1. Nayak, S.P., Rai, S.C., Pradhan, S.K.,“MERA: A Multi-clustered Energy Efficient Routing Algorithm in
WSN”, 14th International Conference on Information Technology, ICIT 2015, pp. 37-42.
2. Sangulagi, P., Sutagundar, A.V., Manvi, S.S.,“Agent based information aggregation and routing in WSN”,
2011 Communications in Computer and Information Science,Vol.142, pp. 449-451.
3. He, J., Zhou, B., Liu, R ,“Analysis of typical secure routing protocols in WSN”, 2014 International Journal
of Security and its Applications , pp. 51-60.
4. Li, H., Wang, Y, “An Unequal clustering routing algorithm in WSN based on node location and residual
energy”, Advances in Information Sciences and Service Sciences 2012, pp. 37-43.
5. Bechkit, W., Koudil, M., Challal, Y., Souici, B., Benatchba, K, “A new weighted shortest path tree for
convergecast traffic routing in WSN”, Proceedings - IEEE Symposium on Computers and Communications
2012 , pp. 187-192.
6. Ahmed, R.Z., Biradar, R.C., “Energy aware routing in WSN for pest detection in coffee plantation”
International Conference on Advances in Computing, Communications and Informatics, ICACCI 2016, pp.
398-403.
7. Liu, C., Fang, D., Chen, X., (...), Xu, G., Chen, H., “LSVS: Bringing Layer Slicing and Virtual Sinks to
Geographic Opportunistic Routing in Strip WSNs”,IEEE 5th International Conference on Big Data and Cloud
Computing, BDCloud 2015, pp. 281-286.
8. Li, Y., Zhu, M., Qu, H., Wang, N., Song, Y., “Improved minimum hop routing protocol in WSN”, 13th ACIS
International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed
Computing, SNPD 2012, pp. 609-614.
9. El Ghazi, A., Ahiod, B., “Random waypoint impact on bio-inspired routing protocols in WSN”, 7th
International Conference on Sciences of Electronics, Technologies of Information and Telecommunications,
SETIT 2016 , pp. 326-331.
10. X.-M., Mao, K.-J., Wang, Z.-L., Chen, Q.-Z., “Design of energy-distance based cluster routing protocol in
WSN”, JiefangjunLigongDaxueXuebao/Journal of PLA University of Science and Technology (Natural Science
Edition) 2012, pp. 393-397.
11. Liu, X.-C., Yuan, D.-S., Liang, P.-Y., Zhang, X.-Y., “Performance analysis of cost function based energy-
efficient routing protocol in WSN” , TongxinXuebao/Journal on Communications 2011, pp. 132-140.
12. Niu, Y.-G., Chen, W.-G., “A grid-based energy-aware and congestion-aware routing algorithm in WSN”,
KongzhiyuJuece/Control and Decision 2016, pp. 1985-1990.