ENERGY-EFFICIENT ROUTING PROTOCOLS IN

WIRELESS SENSOR NETWORKS

Muhammad Khalid Nadeem, Muhammad Waseem, Aqeel Hussain, Kiran Khurshid

Department of Electrical Engineering (DEE)

Army Public College of Management & Sciences (APCOMS)
Rawalpindi, Pakistan
[email protected], [email protected], [email protected]

Abstract- Wireless sensor network (WSN) is a group of power. Routing protocols utilized in Sensor network are
spatially distributed and dedicated sensors that monitors different from additional networks routing protocols.
and records the physical conditions of the surroundings
and organizes the data that is collected at a central
location. In the WSN, many issues are faced but the most Thus solution is to enhance lifespan of sensor network
prominent one is that of energy consumption which is quantity of protocols i.e. LEACH and Power Efficient
faced during design. As each node has a battery and each Gathering in Sensor Information System (PEGASIS) were
battery has limited lifespan. In order to enhance life span introduced and they showed best growth than the
and stability of the wireless sensor network it is very preceding
important to use the battery in efficient way. For this routing protocols but motionless these are used in static
purpose, Clustering based protocols are the best way in sensor nodes only. This paper emphasizes the on hand
order to enhance the network lifespan. Low Energy routing policies in WSN classifies dissimilar routing
Adaptive Clustering Hierarchy (LEACH) protocol is the protocols provides an general idea about energy efficient
first group of clustering protocol for similar WSN having routing protocols i.e LEACH, HEED (Hybrid Energy
the same energy for all nodes. WSN have different energy Efficient Distributed Clustering), Distributed Efficient
phases. Broad classification of energy efficient routing Clustering Approach (DECA) and PEGASIS.
protocols are given by clustering and tree based approach. Classification of routing protocols in WSN are shown:
In this paper, working of heterogeneous protocols and
comparing of different clustering routing protocols for
heterogeneous WSN are explained.

Index Terms— WSN, Problem in WSN, Energy Efficient

Routing Protos.

I. INTRODUCTION
WSN is essentially used to examine surroundings. In
WSNs, sensor every sensor knob collects data and pass it Fig: 1. WSN Routing Protocols
along to the gateway sensor node to be transferred to base
station for processing. This survey paper is organized as under: In this segment we
describe a variety of routing protocols; segment III provides
There are many types of WSNs that are mentioned in . general idea of connected work in this field and segment IV
converse a variety of problems and confront in routing protocols.
WSN are used in numerous applications, like health Network separation which is caused by the energy problem in
examining, environment monitoring, industrial power WSNs and irregular energy utilization are regarded as
demanding challenges in WSNs and hence will disturbs
units, armed applications and also in the dissimilar
the lifetime network of WSNs in routing protocols. So,
computing situations. As the whole sensor nodes are increasing network lifespan in WSNs has received very
batteries power-driven devices, energy utilization of nodes important considerations. In past recent years, energy-
through communication or response of packets affect the efficient routing algorithms have been suggested to increase the
lifespan of the whole network. lifetime network of WSNs.
Many data forwarding techniques uses clustering schemes to
It is proved that node needs greater power to send out data reduce and balance energy utilization via data gathering and
rather than getting as WSN knob has restricted energy and journal selection of different nodes as the CH.
remembrance so the main aim is to save the energy to
optimize the lifespan of sensor network. That’s why in
WSN energy efficient routing is primary due to restricted
LEACH is regarded as a significant clustering protocol that has The routing of data to the nodes is accomplished by the
been suggested for WSNs. In this protocol, all cluster heads geographical position of the nodes. Nodes are only recognized
transmit their gathered data to the sink directly. by their position. The position details of the individual nodes is
achieved by the less power GPS receivers lodge in the nodes.
Energy-efficient QoS (Quality of Service)-aware Geographical Some of the major protocols lying under the Location based
Routing (EQGR) protocol for WSNs which enhances network routing scheme are
lifetime up-to maximum and uses most favorable cost function 1. Greedy approach
to elect the best neighbor node. 2. Compass routing
3. DREAM
Hybrid Multi-Hop routing (HYMH) protocol which joined flat 4. GPSR
and hierarchical multi-hop routing algorithms with data 5. GEAR
gathering scheme in order to enhance energy utilization and
improve the lifespan of WSNs. In such protos that we have mentioned above one and two
follows the single way technique and other three follows the
The authors had made known a novel sleep-scheduling approach immerse mechanism.
called VBS (Virtual Backbone Scheduling). VBS uses over run
backbones which works alternately to enhance the network
1. Greedy approach:
lifetime. In this work, only backbones sends data forward and In greedy routing, source sends the message to the node closest
the remaining nodes turn their radios off so that they can to to destination. Only neighbors adjacent to destination are
conserve and save energy. The backbone-node election is in a observed, otherwise forwarding fails. Greedy localized routing
revolving scheme that stables the energy utilization of all nodes. does not assures delivery, since a packet can be confined in a
local minimum .
We can conclude that by taking significant parameters such as
node's reused energy, path's hop count and stabilizing data 2. Compass Routing
transmission between multiple paths into account can In this method source node estimate the path price i.e distance
exceptionally enhance the network lifespan. from basis to target through different transitional nodes and
lastly transmits packet to the path that has less cost in terms of
energy preservation.
II. ROUTING MANIFESTATION 3. DREAM (A distance Routing Effect
Algorithm for Mobility)
DREAM protocol is the protocol in which node location
All the suggested protocols will lies below any of the
information is used from GPS systems to communicate.
following three classes: A) Direct approach B) Location based
DREAM is a part provident and part reactive protocol in
routing C) Attribute based routing.
which the source node sends the data packet in the
direction of the destination node by particular flooding .
A. DIRECT APPROACH
4. GPSR (Greedy Perimeter Stateless Routing)
The customized edition of greedy-face-greedy process is the
Greedy perimeter stateless routing.
5. GEAR (Geographic & Energy Aware
Routing)
Our Geographic and Energy Aware Routing (GEAR) technique
uses energy aware and geographically informed neighbor
selection commonsense rule to route a packet towards the quarry
region. Within a region, it uses a recurrent geographic
forwarding technique to propagate the packet. Although the
energy balancing design of GEAR is provoked by sensor net
applications, our protocol is commonly applicable to ad-hoc
Fig: 2. Routing Protocols networks .
The easy inundation kind routing protocols lies under the
shortest approach. It is quite easy in design but not power C. HIERARCHICAL BASED ROUTING
efficient protocol. In the Location based knob are inscribed by PROTOCOL
their position. Position is attained either throughout signal power
of nodes also it can be achieved from side to side GPS (Global In WSN, hierarchical clustering has been explored in several
Positioning System) recipients in the network. Following research projects in the recent past few years from various
category several nodes should go to snooze mode if they aren’t perspectives. This is such communication protocol that provides
taking part in current work so energy is preserved and lifespan of energy efficiency that sensors can fully use in reporting there
sensor network enhanced. sensed information to the sink. In this portion, we shall illustrate
Instead of gathering information in WSN from all the nodes the an example of layered protocol having many clusters of sensors
application needs the data only from such nodes that appeases its in a network. Every cluster or clump is handled by a particular
aim and this information collecting technique is extensively node which is a cluster head (CH) and is liable for coordinating.
called as the data centric technique. For data centric technique
the best examples are Direct Diffusion DD and Rumour Routing.

B. LOCATION BASED ROUTING

 and issue meet data is gathered and delivered to base station. If
base station does not show concern in individual events then its
achievement lessens which is fair for less event network if
number of events gets increased then the price of upholding
table gets increased. So it is fair enough for less event network
only.

IV. ENERGY EFFICIENCT

ROUTING
Figure: 3. Cluster-based Hierarchical Model Efficiency of energy is significant in WSN as it
straightforwardly changes the lifespan of whole network, it is
In the above Figure 3, a hierarchical approach ruptures the proven that in wireless network broadcast of data consumes
network into the layers of cluster. Nodes are assembled into more energy than data processing. An overview on energy
clusters with a CH having the liability of routing from the cluster efficient based routing in WSN carry the following broad
to the additional CHs or BS. Data moves from an inferior cluster categorization of accession. They are,
layer to a superior cluster layer. Though, it hops between the  Clustering access/approach
nodes, it covers maximum distances as it hops between two  Tree based access/approach
different layers. This makes the data to reach faster to the BS.
Clustering facilitate intrinsic optimization abilities at the CHs. .
A. Clustering techniques
It is a big step in efficient energy routing. In this technique the
nodes that contains an excess energy i.e. node with better energy
III. DATA CENTRIC ROUTING can be helpful to route data and transmits the information
In location supportive routing node is elected on the support of whereas the least energy nodes can be used for expectation
address of same node but in case of data centric nodes are purposes only i.e. to enhance the lifespan of networks. Its
partitioned on the support of their functioning. Data is asked via advantages are scalability, hoarding transmission bandwidth in
enquiries, attribute-based identification is compulsory to identify between the clusters, abstaining unnecessary message
the characteristics of data. A few number of the protocols that transmission among the sensor nodes and trustworthy
centric routing follows are: communication. For this scheme network is split into sub-units
 Directed diffusion inside every unit of the cluster head is authorized(node with
 SPIN better energy) each additional node in unit transfers data after
 Rumour routing realizing to a cluster head that will supplementary transmits to
BS (base station). Some routing protocols that are energy
1. Directed Diffusion efficient based on clustering techniques are LEACH, HEED,
Direct Diffusion (DD) is a routing protocol, which allows DECA.
transmission between sink and source nodes in casual and mesh
topology networks. This routing protocol is established on a 1. LEACH
data-centric access, where intermediate nodes can corporate data Low Energy Adaptive Clustering Hierarchy (LEACH) uses
and send it to a sink node. In this the network is branched into randomization to allot the load of the energy between the sensors
small collection and the DD protocol is executed at the in network. It considers that BS is hooked and situated away
application layer, confirming reduced energy cost, maintains from the nodes of the sensor that are compatible and energy
delay and data delivery rate . strained. Here, cluster-head (CH) acts as the regional base
station. LEACH randomly revolves CH that are in high energy
2. SPIN so that the activities are equitably shared between the sensors
SPIN is a data centric routing protocol which sends data to that drains the power of the battery equally. LEACH also fulfill
neighbor nodes but it does not assures the reliable data the data mixture, i.e. confining data when given data is
transmission. If one or more nodes in the way of communication transmitted from the clusters to the BS consequently shortening
get perished then data transmission through those nodes gets the dissipation of energy and strengthening lifetime of the
blocked and data won't be delivered to the destination. As well system.
as If node does not have concern in data then that node will not
transmit data too. So there is a demand of increasing the
accuracy of SPIN Protocol .

3. Rumour routing
It presumes fractional links in among source and destination. It’s
use is where quantity of events are in less number than that of
objections i.e. for less communications only. It upholds table of
event-table in hoard of node. When individual event happens
node provokes agent packet on the support of that individual
event and agent find the way from one neighbor to other and on
the other side base station BS i.e. base station send issue for a
individual event , agent select arbitrary way when both the agent
 functions well enough. The PEGASIS protocol attains between
100-300% advancements when 1%, 20%, 50% and 100% of
nodes die correlated to the LEACH protocol.

V. COMPARISON OF ROUTING
PROTOCOLS OF WSN
Let’s have a look on detailed comparison of WSN routing
protocols.
Fig 5. Table of Performance

Protocol Categor Mobility Power Scalabi Over Traffic Qos

y Usage lity Head
SPIN Data Feasible Finite Finite Least Least Lea
Centric -st
CADR No Finite Finite Least Averag Lea
e -st
MBC Feasible Finite Fair Least Least Lea
Hierarchi -st
LEACH -cal Fixed Maxim Fair Exces Excessi Lea
al sive ve -st
Figure: 4. PEGASIS Fixed Maxim Fair Least Least Lea
al -st
Low Energy Adaptive Clustering Hierarchy (LEACH) MECN Location No Maxim Least Avera Least Lea
Based al ge -st
2. HEED GEAR Finite Finite Finite Avera
ge
Averag
e
Lea
-st
To beat the drawback of LEACH protocol i.e. arbitrary choice of SAR QoS No Excessi Finite Exces Excessi Exc
CH, it isn’t equitably allocated amongst every node in Based ve sive ve essi
ve
least/worst condition it may inconstantly selects only an assured SPEED No Least Finite Least Excessi Exc
node since CH which will lessens it’s lifespan and energy of ve essi
ve
network thus to beat this problem Hybrid Energy Efficient
Distributed Clustering Protocol (HEED) was introduced which
elects those CHs that are base on both vestigial energy level and VI. ISSUES AND FUTURE SCOPE
communication price. As HEED supports variant sensor knobs
Emax may alter for dissimilar nodes according to it’s In wireless communication a very interesting aspect in sensor
performance including scope. In this every node contribute its network is routing. This paper compiled latest study in data
energy intensity and expenditure of communication with BS routing to preserve energy of sensor network and categorized the
over Emax level, CHs are chosen with lofty Emax and less cost approaches into main three classes i.e. direct approach, attribute
of communication. based approach and location-based approach. The above table
sums up the different protocols in this survey paper. Data
aggregation is an open issue in the routing protocols sensor
3. DECA
networks in terms of power preserving and traffic development.
DECA is an enhanced Distributed Efficient Clustering
Protocols, that names data and inquiry the nodes that are based
Approach. The fundamental dissimilarity among HEED and
on some qualities of data are classified as a data-centric based.
DECA is that how the nodes gets the accord and the score
Lots of researchers go after this criterion in order to shun the
estimation. Primarily new procedure is used for computation of
transparency of assembling clusters and the utilization of
remaining energy.
particular nodes etc. Though, the naming system like attribute-
value pairs may not be enough for complicated inquiries, and
B. Tree Based Approach they are typically reliant upon the application. Efficient
One more technique is that of tree based. In such technique customary naming techniques are one of the most fascinating
network is pretended as tree like system in which leaves knob upcoming research path correlated to this class.
operate like a resource nodes and root node acts as a BS. Much routing protocols pursue the criterion in which the sensor
Resource nodes sense data and then transmits every transitional network is unified with the wired network i.e. to monitor the
node accumulated data. Power-Efficient Gathering in Sensor applications needs data which is gathered by nodes of the sensor
Information Systems (PEGASIS) is the best example of such and is transferred to the server for advance examination. While,
kind of technique. the appeals should be made to the BS from user via Internet. As
the routing needs of every environment are distinct, more
1. PEGASIS research is compulsory for supervising such kind of conditions.
For gathering application in sensor networks PEGASIS plays an In case of cluster based routing protocols the election of CH is
ideal role. The main idea in PEGASIS is to make a chain an objection since frequently such nodes are elected as a CH that
amongst the sensor nodes in order to make each node able to have less energy intensity. A CH functions data aggregation and
receive and transmit to a nearest neighbor. Collected data transmits it to the BS on favor of the nodes inside its cluster. The
proceeds from node to node, get fused, and finally a nominated aspects disturbing cluster design and CH communication are
node transmits to the BS. Nodes take turns in transmitting to the open issues for upcoming research.
BS so that the moderate energy spent by every node per round is
decreased. Constructing a chain to reduce the overall length is
similar to the moving salesman problem, which is known to be
incurable. However, with the Radio Communication energy
criterion, a simple chain built with a GREEDY approach
 VII. CONCLUSION

In this paper, a detailed analysis on different clustering protocols

for WSNs has been provided with the application of energy as a
major issue. Scheming energy efficient protocol is very
significant. Due to the deficient energy resources of sensors,
energy efficiency is one of the main challenges in the formation
of protocols for WSNs. Many clustering protocols for enhancing
the lifespan of WSNs has been presented in this paper and it can
be concluded that introducing the discrepancy in WSNs results
in the optimization of the lifespan of sensor networks. The life
time of the network in CH-Leach shows major extension
compared to Leach and DEEC protocols. The main aim of this
work were to design and implement a protocol which enhance
exiting protocols in order extend the Life Time of Network. Our
protocol offers significant reductions of energy consumption and
prolongs network lifetime hugely. Also the produced clusters
exhibit several appealing characteristics. This approach can be
applicable in the designing of many types of sensor network
protocols requiring scalability, enhanced network lifespan, fault
easiness, and load balancing.

REFERENCES