Qualitative Analysis of Routing Protocols in WSN

Int. J. Advanced Networking and Applications
Volume: 08 Issue: 02 Pages: 3021-3025 (2016) ISSN: 0975-0290
3021
Qualitative Analysis of Routing Protocols in
WSN
Raghunandan.G.H
Department of Telecommunication, BMS Institute of Technology, Bangalore, India
Email: raghunandangh@bmsit.in
Archana.A.R , Rachana Pai, Raksha Hegde, T.N.Srinidhi
Department of Telecommunication, BMS Institute of Technology, Bangalore, India
Email: ararchana90@gmail.com
--------------------------------------------------------------------ABSTRACT-------------------------------------------------------------
Wireless Sensor Network (WSN) is partially distributed autonomous sensors to monitor physical or
environmental conditions such as temperature, pressure etc. and to cooperatively pass their data through the
network to the central location. The technique referred to as multi-hop wireless communications is used by the
WSN’s to communicate. Due to the limited processing power and the finite power accessible to each sensor nodes,
the application of regular routing techniques is not recommended. Hence recent advances in wireless sensor
networks have made the routing protocols more efficient. This paper surveys and compares the advanced routing
protocols. The three main categories discussed here are flat based, hierarchical based and location based. The
paper concludes with open research issues.
Keywords- Flat based, Hierarchical, Location based, Routing techniques, WSN
--------------------------------------------------------------------------------------------------------------------------------------------
Date of submission: Oct 07, 2016 Date of Acceptance: Oct 20, 2016
--------------------------------------------------------------------------------------------------------------------------------------------
I. INTRODUCTION
Micro–sensors development in recent times is due to
microelectronic mechanical systems and low power and
highly integrated digital electronics. MEMS are
equipped with data processing and communication
capabilities. The ambient conditions surrounding the
environment are sensed by the sensory circuits and are
converted into electrical signals. Properties of the
objects located and the events happening in the locality
of the sensor are obtained through the processing of
such electrical signals. The radio transmitter collects the
data sent by the sensor and sends it to a command
centre also known as sink. The interest in the possible
use of huge set of disposable unused sensors has
increased because of the decrease in cost of sensors and
size. Many researchers have been carried out the past
years pointing to the potential of collaboration among
sensors in data collecting and processing. The
management and coordination of the sensing activity
and flow of the data to the sink. A network with
wireless links that is created among the sensors by an
ad-hoc technique is the basic set up for such
collaborative distributed sensors. Sensing over larger
geographical region with greater accuracy is possible by
a Wireless Sensor Network which has hundreds or
thousands of these sensor nodes. Many applications that
require operations which are unattended can be
networked through WSN which possess ability to
communicate by an external base station or directly
among each other.
Fig 1. Wireless sensor Network
Sensor node components with each sensor node
comprising of sensors, processors and transmission
mobilizes forms a schematic diagram which is shown in
figure 1. The sensor nodes gather and route the data to
other base stations which have a mobile node capable of
connecting the sensor network to present
communication setup or to the internet which provides
an access to the reported data to the users or directly to
the other sensors. The sensor node has capability to
base its decision of its mission and information it
currently has and its computing communication, energy
resources.
The deployment of the large number of sensor nodes
leads to the close arrangement of the neighboring
nodes. This helps in lowering the power consumption
by the multi hop communication when compared to the
single hop communication. To make the covert
operation desirable the transmission power must be
maintained at a lower level. The signal propagation
effects experienced in long distance wireless
communication can be effectively overcome by the
Usage of multi-hop communication. The requirement
for the low power consumptions on the sensor nodes is
its main drawback. The power sources used in sensor

3022
nodes are irreplaceable and are limited in number.
Therefore, power conservation should be primarily
focused in order to achieve high quality of service
(QoS). To prolong the network lifetime the nodes must
have inbuilt trade-off mechanisms. This results in the
reduction of transmission delay. Many researches are
progressing towards these developments. In this paper,
survey of protocols and algorithms are proposed for
sensor networks. This paper helps in understanding the
current research issues in this field. This paper also
contains the following: In section2, a brief overview on
the various design issues and routing challenges are
discussed. Three types of protocols and their categories
are summarized in section3.
Fig 2. Components of Sensor Nodes
II. DESIGN ISSUES AND ROUTING
TECHNIQUES.
Various design constraints and architectures are
taken into consideration for sensor networks based on
their applications. The routing protocols perform very
similar to the architecture modeling. Therefore, in this
section we look into the architectural issues and throw
light on their implications.
2.1 Hardware resources limitation: Sensor nodes can
perform limited computational functionalities, as they
have limited processing, storage capacities and energy
capacities. The design of software development and
network protocols for sensor networks face many
challenges offered by hardware constraints along with
considering the energy constraints in sensor nodes. It
also considers the processing and storage capacities of
sensor nodes.
2.2 Node Deployment: One of the most fundamental
issues to be solved in WSNs is Node Deployment. The
complexity of problems in WSNs such as routing, data
fusion, communication etc. can be overcome by the
proper node deployment scheme. This also helps in
reducing the power consumption thereby extending the
life span of WSNs. The node deployments are either
deterministic or random for large scale WSNs. The
parameters with which the performance is measured are
the distance coverage, energy consumption and
message transfer delay.
2.3 Quality of service: Time constraint applications are
bounded by another condition that is bounded latency
for data delivery. In order to extend the total network
lifetime and reduce energy dissipation in the nodes
which are caused when the energy gets depleted, the
network may have to be required to reduce the quality
of the results. This majorly comes into picture in some
of the applications where the data from the moment it is
sensed should be delivered within a certain period of
time otherwise the data will be useless. Hence to
capture this requirement energy efficient routing
protocols are required.
2.4 Adaptability: A node may fail, join, or move in
sensor network which would result in changes in
network topology and node density. It is necessary that
the network protocols designed for sensor networks
should be adaptive to such density and topology
changes.
2.5 Fault tolerance: Sensor nodes are suffered to
failures due to harsh deployment environments and
unattended operations. So the sensor nodes should be
fault tolerant. Sensors have the abilities of self
calibrating, self-testing, self-repairing and self-
recovering.
2.6 Scalability: The number sensor nodes in sensor
networks are in the order of tens, hundreds, or
thousands hence the network protocols designed for
sensor networks should be scalable to different network
sizes.
III. CLASSIFICATION OF ROUTING
PROTOCOLS:
In many different ways we can classify the routing
algorithms for WSNs which is having a large design
space. In general, the classification of routing technique
in WSNs is divided into flat-based routing, hierarchical-
based routing and location-based routing depending on
the network structure.
The first category considered is flat-based or the data-
centric routing protocols. Node centric communication
is not commonly used communication type in WSNs.
Therefore, data centric routing protocols are designed
for WSNs. Flat based routing protocols distribute
information as needed to any router that can be reached
or receive information. Here each router node routinely
collects and distributes routing information with its
neighboring routers. The entire participating node
addressed by flat routing protocol performs an equal
role in the overall routing mechanism.
The next category is hierarchical-based or cluster based
routing protocols. A hierarchical routing protocol
allows an administrator to make best use of his fast
powerful routers in the backbone and the slower, lower
energy routers may be used for network access at the
edge of the network. Some hierarchical routing
protocols also perform route aggregation to reduce the
number of routes advertised. The cluster based routing

3023
protocols are more advantageous for WSN due to the
higher energy utilization rate and being more scalable.
The last category is the location-based routing protocol.
This type of protocol is used for energy efficiency in
WSNs. The distance between neighboring nodes can be
estimated by incoming signal strength. By exchanging
information between neighbors relative coordinates of
neighboring nodes can be obtained. We can determine
the location of the nodes directly by communicating
with a satellite, using GPS (Global Positioning System)
if small low power GPS receivers are present in the
nodes. Few location-based schemes demand that nodes
should go to sleep when there is no activity in order to
save energy. More the number of inactive nodes more is
the energy saved. By using this type routing
performance can be improved.
IV. COMPARISION OF ROUTING
PROTOCOLS:
In this paper we have compared routing protocols
according to their design characteristics which is shown
in the table below.
4.1 Flat based routing.
 SPIN: Sensor Protocols for Information via
Negotiation.
 Directed diffusion.
 Rumor routing.
 GBR: Gradient Based Routing.
 MCFA: Minimum Cost Forwarding
Algorithm.
 CADR: Constrained Anisotropic Diffusion
Routing.
 COUGAR
 ACQUIRE: ACquire QUery forwarding In
sensoR nEtworks.
4.2 Hierarchical based routing.
 LEACH: Low Energy Adaptive Clustering
Hierarchy.
 TEEN: Threshold Sensitive Energy Efficient
sensor Network.
APTEEN: Adaptive Periodic Threshold
Sensitive Energy Efficient sensor Network.
 PEGASIS: The Power-Efficient Gathering in
Sensor Information Systems.
 MECN: Minimum Energy Communication
Network. SMECN: Small Minimum
Energy Communication Network.
 SOP: Self Organizing Protocol
 HPAR: Hierarchical Power Aware Routing.
 VGA: Virtual Grid Architecture Routing.
 TTDD: Two-Tier Data Communication.
4.3 Location based routing.
 GAF: Geographic Adaptive Fidelity.
 GEAR: Geographic and Energy Aware
Routing.
 SPAN
 GOAFR: The Greedy Other Adaptive Face
Routing.
ROUTING
PROTOCOLS
CLASSIFICATION MOBILITY POWER
USAGE
DATA
AGGREGATION
QoS STATE
COMPLEXITY
SCALABILITY QUERY
BASED
SPIN Flat Possible Limited Yes No Low Limited Yes
Directed
Diffusion
Flat Limited Limited Yes No Low Limited Yes
Rumor
Routing
Flat Very Limited N/A Yes No Low Good Yes
GBR Flat Limited N/A Yes No Low Limited Yes
MCFA Flat No N/A No No Low Good No
CADR Flat No Limited Yes No Low Limited No

3024
COUGAR Flat No Limited Yes No Low Limited Yes
ACQUIRE Flat Limited N/A Yes No Low Limited Yes
LEACH Hierarchical Fixed BS Maximu
m
Yes No CHs Good No
TEEN &
APTEEN
Hierarchical Fixed BS Maximu
m
Yes No CHs Good No
PEGASIS Hierarchical Fixed BS Maximu
m
No No Low Good No
MECN &
SMECN
Hierarchical No Maximu
m
No No Low Low No
SOP Hierarchical No N/A No No Low Low No
HPAR Hierarchical No N/A No No Low Good No
VGA Hierarchical No N/A Yes No CHs Good No
TTDD Hierarchical Yes Limited No No Moderate Low Possible
GAF Location Limited Limited No No Low Good No
GEAR Location Limited Limited No No Low Limited No
SPAN Location Limited N/A Yes No Low Limited No
GOAFR Location No N/A No No Low Good No
Table 1: Comparison of routing protocols based on their design characteristics
V. RESEARCH ISSUES AND FUTURE
WORKS:
The common problem faced by wireless sensor
networks (WSNs) is energy. When a sensor is drained
out, it can no longer be able to achieve its goal unless
the energy source is replaced. In WSN future works in
routing techniques focuses on different direction which
share the common aim of extending the network
lifetime.
Some of them are:
 Designing more secured and more effective
routing techniques.
 Achieving the density of the sensor nodes.
 To work on accomplishing redundancy and
to employ fault tolerance in an effective
way.
 Reducing delay time and improving energy
efficiency.
 Synchronization of time and location.
 Further work includes research in the
integration of sensor networks using internet
i.e. with wired networks.
VI. CONCLUSION
In recent years routing in sensor networks has
drawn huge attention and introduced new
challenges compared to classic data routing in
wired networks. We have given an extensive
survey on data routing in sensor networks and
categorized the techniques into three main
classification namely flat based, hierarchical-based
and location based in this paper. Even though
many of these routing techniques look favorable,
still they have many complications that required to
be solved in sensor networks. We promoted those
complications and defined some future work issues
in this concern.
REFERENCES
[1]. Ms. Reshma Jayesh Rasal, Dr. Shyamrao V.
Gumaste, Prof. Gajanan S. Deokate, “Survey on
different routing issues and design challenges in WSN”
IJSEAS volume-1, Issue-4, July 2015, ISSN:2395-
3470.
[2]. Manasa.C, Raghunandan.G.H, “A comparative
survey on routing protocols in wireless sensor
networks” 2014.
[3]. Kemal Akkayya, Mohamed Younis, “A survey on
routing protocols on wireless sensor networks in Ad
Hoc Networks 3, 2005, 325-349.
[4]. Ming Liu, Jiannong Cao, Guihai Chen, Xiaomin
Wang, “An Energy-Aware routing protocols in wireless
sensor networks”, Sensors 2009, volume-9, pp. 445-
462.

3025
[5]. Raghunandan.G.H, “A comparative analysis of
routing techniques for wireless sensor networks”,
Proceedings of the national conference on innovations
in emerging technology, IEEE conference, pp. 17-22
Feb 2011.
[6]. J. Heidemann, D. Estrin, “Geography informed
energy conservation for ad-hoc routing”, Proceedings
ACM/IEEE MobiCom’01, Rome, Italy, July 2001,
pp.70-84.
[7]. S.K. Singh, M.P. Singh, D.K. Singh, “A survey of
energy efficient hierarchical cluster-based routing in
wireless sensor networks”, International Journal of
Advanced Networking and Application (IJANA), sept-
Oct 2010, vol. 02, issue 02, pp. 570-580.
[8]. J. Kulik, W. R. Heinzelman, and H. Balakrishnan:
Negotiation-Based Protocols for Disseminating
Information in Wireless Sensor Networks, Wireless
Networks, vol. 8, pp. 169–85 (2002).
[9]. W. Heinzelman, J. Kulik, and H. Balakrishnan:
Adaptive Protocols for Information Dissemination in
Wireless Sensor Networks, Proc. 5th ACM/IEEE
Mobicom, Seattle, WA, pp. 174–85 (Aug. 1999).
[10]. Jamal N, Al-Karaki, Ahmed E. Kamal,
“Techniques in wireless sensor networks: A Survey.
[11]. D. Braginsky, D. Estrin, “Rumour Routing
algorithm for sensor networks”, Proceedings- The first
Workshop of sensor networks and applications.
[12]. C. Schurgers, M. B. Srivastava, “Energy efficient
routing in wireless sensor networks in the MILCOM
Proceedings on communications for network centric
operations, Creating the Information force, McLean,
VA (2001).
[13]. F. Ye, A. Chen, S. Liu, L. Zhang, “A Scalable
solution to minimum cost forwarding in large sensor
networks”, Proceedings of the tenth International
Conference on Computer Communications and
Networks (ICCCN).
[14]. M. Chu, H. Haussecker, F. Zhao, “Scalable
information driven sensor querying and routing for ad-
hoc Heterogeneous sensor networks, the international
Journal of high performance computing applications,
Vol-16, No. 3, August 2002.
[15] Y. Yao and J. Gehrke: The cougar approach to in
network query processing in sensor networks, in
SIGMOD Record(September 2002).
[16]. N. Sadagopan et al, “The ACQUIRE mechanism
for efficient querying in sensor networks”, in the
Proceedings of the First International Workshop on
protocols in wireless sensor networks.
[17]. A. Manjeshwar, D. P Agarwal, “TEEN: A
routing protocol for enhanced efficiency in wireless
sensor networks”, First International workshop on
parallel and distributed computing issues in
wireless networks and mobile computing, April
2001.
[18]. Raghunandan.G.H, Narendra. K, Varun V, “A
Comparitive Analysis of energy efficient routing
protocols in WSN”, Springer, Volume no.248, pp.399,
2014
Authors Biographies:
Raghunandan G.H received B.E
degree in Electronics and
Communication Engineering from
Visvesvaraya Technological
University. He did his M.Tech in
the field of Digital Electronics and communication
from Visvesvaraya Technological University,
Belgaum. He is currently working as Assistant
Professor in Department of Telecommunication at
BMS Institute of Technology and Management,
Bengaluru. His areas of interest are Wireless Ad-Hoc
and Sensor Networks. He has published 15 papers at
International conferences and 8 papers in International
journals.
Archana A.R is pursuing B.E
degree in Telecommunication from
University. Her area of interest
includes wireless communication
and networking.
Rachana Pai is pursuing B.E
and networking.
Raksha Hegde is pursuing B.E
and networking.
T N Srinidhi is pursuing B.E
includes WSN.

Qualitative Analysis of Routing Protocols in WSN

More Related Content

What's hot (19)

Viewers also liked (20)

Similar to Qualitative Analysis of Routing Protocols in WSN (20)

More from Eswar Publications (20)

Recently uploaded (20)

Qualitative Analysis of Routing Protocols in WSN