Taxonomy of Routing Protocols in Wireless Sensor

Networks: A Survey

Presentation by: Harmanpreet Singh

Research Scholar, CSE

SLIET, Longowal

1
Outline

Introduction
Challenges in WSNs
Categorization based on Network Structure
Flat based Routing Protocols
Hierarchical based Routing Protocols
Location based Routing Protocols
Comparison
Conclusion
2
Introduction

Advances in Wireless communications

and micro-electro-mechanical systems
(MEMS)

Wireless Sensor Network(WSN)

Sensor nodes and Sink nodes

Applications

ZigBee standards (802.15.4)

Components

Architecture

3
Challenges in WSNs

Deployment of nodes
Conservation of energy
Fault tolerance
Scalability
Quality of service
Topology maintenance

4
 Taxonomy- Network Structure
based Categorization

Routing
Protocols

Hierarchical Location
Flat based
based based
Routing
Routing Routing

Block Chain
Negotiation Diffusion Data centric Grid Cluster Flooding Virtual Area Optimal
Cluster Cluster
based based based based based based Path based
based based

5
Flat based Routing Protocol

Same functionality throughout network

Query based data transmission

Classical Routing techniques

• Flooding

• Gossiping

Implosion and Overlap problem

6
Negotiation based Routing- SPIN

SPIN(Sensor protocol for information via

negotiation)
Topological changes are localized - Each node
needs to know only its neighbors
SPIN halves the redundant data in comparison to
flooding
Cannot guarantee data delivery
SPIN NOT good for applications that need reliable
data delivery

7
Negotiation based Routing- SPIN

SPIN(Sensor protocol for information via

negotiation):

8
Diffusion based Routing-Directed Diffusion

Directed Diffusion
– Uses a naming scheme for the data to save energy
– Attribute-value pairs for data and queries on-demand (Interests)
– Interests are broadcasted by the sink (query) to its neighbors
(caching), which can do in-network aggregation
– Gradients = reply links to an interest (path establishment)

Energy saving and delay done with caching

No need for global addressing (neighbor-to-neighbor

mechanism)

Cannot be used for continuous data delivery or event-

driven applications

9
Diffusion based Routing-Energy Aware Routing

Energy-aware Routing
–Occasional use of a set of sub-optimal paths
–Multiple paths used with certain probability
–Increase of the total lifetime of the network
–Hinders the ability for recovering from node
failure
–Requires address mechanism Complicate
setup

10
Diffusion based Routing-Rumor Routing

Rumor Routing
–Variation of Directed Diffusion
–Flood the events instead of the queries
–Creation of an event  generation of a long live
packet travel through the network (agent)
–Nodes save the event in a local table
–When a node receives query  checks its table
and returns source – destination path

11
Data centric protocols- COUGAR

COUGAR
– Views the network as a huge distributed database.
– Declarative queries to abstract query processing from network layer functions.
– Introduces a new query layer.
– Leader node performs data aggregation and transmits to the sink.

Disadvantages
– Additional query layer brings overhead in terms of energy consumption and
storage
– In network data computation requires synchronization (i.e. wait for all data before
sending data)
– Dynamically maintenance of leader nodes to prevent failure

12
Data centric protocols- ACQUIRE

ACtive QUery forwarding In sensoR nEtworks

(ACQUIRE)
–Views network as a distributed database
–Node receiving a query from the sink tries to respond
partially and then forwards packet to a neighbor
–Use of pre-cached information
–After the query is answered, result is returned to the sink by
using the reverse path or the shortest path
–If cache information is not up to date  node gathers
information from neighbors within look ahead of d hops

13
Hierarchical based Routing

The main aim of hierarchical

routing is to efficiently
maintain the energy
consumption of sensor
nodes
–by involving them in multi-
hop communication within
a particular cluster
–by performing data
aggregation and fusion in
order to decrease the
number of transmitted
14 messages to the sink
Block Cluster based- LEACH

LEACH – Low-Energy Adaptive Clustering Hierarchy

– One of the first hierarchical routing protocols
– Forms clusters of the sensor nodes based on received signal strength
– Local cluster heads route the information of the cluster to the sink
– Cluster heads change randomly over time  balance energy dissipation
– Data processing & aggregation done by cluster head

Advantages
– Completely distributed
– No global knowledge of the network
– Increases the lifetime of the network

Disadvantages
– Uses single-hop routing within cluster not applicable to networks in
large regions
– Dynamic clustering brings extra overhead (advertisements, etc)
15
Block Cluster based- TEEN and APTEEN

Threshold sensitive Energy Efficient sensor Network protocol (TEEN)

– Good for time-critical applications
– Hierarchical along with a data-centric approach
– Hierarchical grouping: Close nodes form clusters and this process goes on the second level until
sink is reached
– Cluster headers broadcast:
 Hard Threshold
 Soft Threshold
– Not good for applications that need periodic reports

Adaptive Threshold TEEN (APTEEN)

– Captures both periodic data collection and reacting to time-critical events
– APTEEN supports queries:
 Historical -Analyze past data values
 One-Time –Take a snapshot of the current network view
 Persistent monitor an event for a period of time

16
Grid Cluster based-PANEL

Position based aggregator node election

protocol (PANEL)

The whole network is divided into number of geographical

clusters

For each cluster; a reference point is calculated in reference

to the bottom left corner of cluster

That node is selected as CH which is closest to the

reference point

Transmission can be intra-cluster or inter-cluster.

PANEL has the advantage to support asynchronous

applications also

special hardware and software for implementation

17
Grid Cluster based-TTDD

Two tier data dissemination (TTDD)

Grid like structure is established similar to PANEL

Whenever a data is required by sink, whole network is queried using flooding

process until query message reaches the source node

Greedy geographical forwarding method is used by source to propagate the data to

other dissemination nodes.

The message ends, when it reaches the node which is closest to the reference point.
The process continues until the boundary of WSN is reached

TTDD is best suitable for the applications which are event driven but not for
applications requiring continuous information.

18
Chain Cluster based-PEGASIS

Power-Efficient Gathering in Sensor Information Systems (PEGASIS)

The WS nodes are organized in the form of a chain for the transmission and
aggregation of the data.

The formation of chain can be centralized or distributed depending upon the

application.

The formation of chain starts from the farthest node from sink and its closest
neighbor is selected as next node in the chain and so on.

The end node must be the sink and the node before sink acts as a leader of the node.

Operations like data processing and aggregation are done by leader node.

However, PEGASIS is not suitable for the networks with dynamic or time varying
topology.

19
Chain Cluster based-CCS

Concentric Clustering Scheme (CCS)

Extension of PEGASIS

Choose BS effectively.

WSN is divided into number of concentric circles around the BS, each
representing different cluster levels

Circular track which is closest to the BS is assigned level-1 and so on.

Each cluster have one CH and CHs of different levels communicate with
each other to transmit data from one level to another and ultimately to BS

20
Location based Routing Protocols

Locations based routing (LBR) protocols use the location of

WS nodes for the transmission of data
Not dependent on the addressing scheme used by WSN.
In most cases location information is needed in order to
calculate the distance between two particular nodes so that
energy consumption can be estimated.

21
Flooding restriction based

Distance based flooding restriction

• Location of target node unknown

• Location Aided Routing (LAR) protocol

Angle based flooding restriction

• When direction of target node is known.

• Guarantees transmission

Rectangle based flooding restriction

• Rectangular region created using source and target as two opposite vertices

• To increase accuracy, a circular region is extended at these vertices.

22
Virtual area partition based-GAF

Geographic Adaptive Fidelity (GAF)

Whole WSN is subdivided into number of virtual partitions
also called grids
Any two nodes belonging to the adjacent grids can
communicate with each other
Only one node with highest energy in each grid is in active
state which performs all the data processing and transmissions
There are three transition states for the nodes in a grid: active,
discovery and sleep state

23
Virtual area partition based-GROUP

Grid Clustering Routing Protocol (GROUP)

WSN is divided into clusters and one node from cluster is selected as
CH.

CH receives the queries from all nodes in its cluster and forwards
them to the respective destination node using the location
information.

Each node has its own location information and also location
information of all WS nodes in cluster is known to CH.

GROUP has some limitations; it assumes that all WS nodes are

stationary and are able to adjust the power consumption of
transceiver.
24
Optimal path choice based-GPSR

Greedy Perimeter Stateless Routing (GPSR)

GPSR adopts the greedy forwarding algorithm for routing the
data packets
Data packet is send to the next closest neighbour node
If there is no neighbour node, perimeter forwarding algorithm
is used.
The unavailability of the next node is called as the route hole
problem
This algorithm draws a planar graph to solve this problem of
finding the next node.
25
Optimal path choice based-GEAR

Geographic and Energy Aware Routing (GEAR)

Each node keeps the information of itself and neighbours location and energy left

To select the next node, two costs are calculated: learned cost and estimated cost.

The estimated cost is used to find the next node which is closest to the target region
using two factors, residual energy and its distance to the destination.

Learned cost is used when no neighbour node is closer to destination.

After reaching the target region, the information is transmitted using restricted
flooding methods and recursive geographic forwarding.

This approach is better suitable for the applications where the nodes are densely
deployed.

26
Comparison
Routing Data Query
Classification Mobility Power usage Localization Scalability
protocols aggregation based
Flat/
SPIN Yes Limited Yes No Limited Yes
Negotiation based
Flat/
DD Limited Limited Yes Yes Limited Yes
Diffusion based
Flat/
RR No N/A Yes No Good Yes
Diffusion based
Flat/
COUGAR No Limited Yes No Limited Yes
Data Centric
Flat/
ACQUIRE Limited N/A Yes No Limited Yes
Data Centric
Hierarchical/
LEACH Fixed BS Maximum Yes Yes Good No
Block based
Hierarchical/
TEEN Fixed BS Maximum Yes Yes Good No
Block based
Hierarchical/
PANEL Yes Limited No Yes Low No
Grid based
Hierarchical/
TTDD Yes Limited No No Low No
Grid based
Hierarchical/
PEGASIS Fixed BS Maximum No Yes Good No
Chain based
Hierarchical/
CCS Fixed BS Maximum No Yes Good No
Chain based
Location based/
GAF Limited Limited No No Good No
Area partition
Location based/
GRID No Limited No Yes Good Yes
Area partition
Location based/
GPSR Limited Limited No No Limited No
Optimal Path
Location based/
GEAR Limited Limited No No Limited No
Optimal Path

27
An Illustration

The implementation of WSN and selection of routing protocols is application

dependent.

• Consider an example of tornado monitoring; one way is to sense the

tornado from sky using small airplanes.

• Another way is to deploy a sensor grid on ground and to report data

when tornado passes through sensor grid.

• Also, one can think of deploying lightweight sensors inside the tornado.

Different topology constraints.

28
Conclusion

WSNs hold a promising future in various civil and military

applications like environmental monitoring, security surveillance,
border protection and healthcare.

Since the architecture of the network is application dependent so

proper routing technique must be followed which should ensure the
longer lifetime and energy efficiency.

In this paper, network structure based routing protocols are

discussed on the basis of their topology. Further, comparison of
these protocols is done using important performance metrics.

We hope that the taxonomy presented in this paper can help the
researchers and designer for selecting an appropriate routing
protocol for specific application.

29
 THANKS

30