Routing Techniques in Wireless Sensor Networks: A Survey J. Al-Karaki, A. E. Kamal
Routing Techniques in Wireless Sensor Networks: A Survey J. Al-Karaki, A. E. Kamal
Networks: A Survey
J. Al-Karaki, A. E. Kamal
From UMASS
MANET-Inspired WSN Application:
Environmental
From UMASS
MANET-Inspired WSN Application: Future
Health
Circulatory Net
General Properties (1)
Mainly for Information Collection
Single Owner
Up to Hundreds of Thousands of Nodes
Disposable Nodes
Cheap Nodes
Security Concerns
General Properties (2)
Bounded Directed Stream (from/to Sink)
Somewhat Limited Computation Capability
Sensor Unit
ADC – Analog Digital Converter
CPU – Central Processing Unit
Power Unit
Communication Unit
General Architecture (2)
General Requirements (1)
Varying Network Size
Inexpensive Nodes Equipment
Long Lifetime (Power)
Load-Balancing
Self-Organization
Re-tasking and Querying Capability
General Requirements (2)
Sensible Data Aggregation
Consolidation of Redundant Data
Application Awareness
Tradeoff
Communication for Computation
Possible Mobility
Some WSN Routing challenges and
design issues
Node deployment
Manual deployment
Sensors are manually deployed
Data is routed through predetermined path
Random deployment
Optimal clustering is necessary to allow
connectivity & energy-efficiency
Multi-hop routing
Some WSN Routing challenges and
design issues (contd)
Fault tolerance
Some sensors may fail due to lack of power,
physical damage, or environmental
interference
Adjust transmission power, change sensing
rate, reroute packets through regions with
more power
Some WSN Routing challenges and
design issues (contd)
Network dynamics
Mobile nodes
Mobile events, e.g., target tracking
If WSN is to sense a fixed event,
networks can work in a reactive manner
A lot of applications require periodic reporting
Some WSN Routing challenges and
design issues (contd)
Connectivity
High density high connectivity
Some sensors may die after consuming
their battery power
Connectivity depends on possibly random
deployment
Routing challenges and design issues
(contd)
Data routing methods
Application-specific
Time-driven: Periodic monitoring
Event-driven: Respond to sudden changes
Query-driven: Respond to queries
Hybrid
Routing challenges and design issues
(contd)
Transmission media
Wireless channel
Limited bandwidth: 1 – 100Kbps
Using MAC (Link Layer)
Contention-free, e.g., TDMA (Time Division
Multiple Access) or CDMA (Code Division
Multiple Access)
Contention-based, e.g., CSMA (Carrier Sense
Multiple Access), MACA (Multiple Access with
Collision Avoidance), or 802.11
Putting all together: Motivation
Reactive
Proactive
18
Routing Protocols in WSNs
I. Flat
II. Hierarchical
III. Location-based (excluded for
CSE4PND)
IV. QoS-based (excluded for CSE4PND)
I. Flat routing
Flat routing by conventional
Flooding, but …
Too much waste
Implosion & Overlap
Use in a limited scope, if
necessary
That is, unsuitable for most
WSNs
Flat routing by data-centric
routing
No globally unique ID
Naming based on data
attributes
That is, individual nodes are
unimportant
Egs: SPIN, Directed
Diffusion, ...
Sensor Protocol for Information via Negotiation
SPIN
n Data centric and proactive (getting ready
Protocol Highlights
SPIN
Broadcast - limited scale –
Main Drawbacks
n
every node handles O(n) messages
n Data is updated throughout network –
unnecessary in many cases
n Network (power) lifetime - good
n High degree nodes = High power needs
Sensor Protocol for Information via Negotiation
SPIN
Main Procedures
SPIN
Node with data
Illustrations
ADV
SPIN
Node with data
Illustrations
REQ
SPIN
DATA Node with data
Illustrations
SPIN
Node with data
Illustrations
ADV
SPIN
Node with data
Illustrations
Already
has data
(or dead)
REQ
SPIN
Node with data
Illustrations
DATA
Pros
Each node only needs to know its one-hop
neighbors
Significantly reduce energy consumption compared
to flooding
Cons
Data advertisement cannot guarantee the delivery
of data
If the node interested in the data are far from the
source, data will not be delivered
Not good for applications requiring reliable data delivery,
e.g., intrusion detection
Directed Diffusion: Main Features
data centric and reactive (Sink looking for named
data; constructing a path to named data when
required)
broadcast by a node (sink)
Query reaches relevant sensor sources
This sets up exploratory gradients (forward
paths)
Once data is available in a Source
it is sent Back via Reinforced Path
Failing Links / nodes are being gradually
bypassed
Directed Diffusion: Motivating Example
Sink
Directed Diffusion: Data Propagation
Multipath routing
Consider each gradient’s link quality
Select the preferred path/route
(reinforcement) for forwarding data.
Gradient
Source Data
forward
path
Sink
Directed Diffusion: Reinforcement
Source Data -
Reinforcement
Request-
Reinforcement
Sink
Directed Diffusion: Negative
Reinforcement (path maintenance)
Explicitly degrade the path by re-sending interest with lower
data rate.
Time out: Without periodic reinforcement, a gradient will be
torn down
Gradient
Source Data
Reinforcement
Sink
Directed Diffusion: Summary of the
protocol
Directed Diffusion
LATITUDE_KEY LE 120
SENSOR EQ MOVEMENT
Source INTENSITY GE 0.6
CONFIDENCE GE 0.7
INTERVAL IS 10
EXPIRE_TIME IS 100
Sink
Directed Diffusion
SENSOR EQ MOVEMENT
INTENSITY GE 0.7
Source 3. addFilter (FilAttrVec, FilterCallback)
InterestAttrVec
CLASS_KEY EQ INTEREST_CLASS
LONGITUDE_KEY IS 35
LATITUDE_KEY IS 110
SENSOR IS MOVEMENT
Sink
Directed Diffusion
1. Interests Setting up
DD (contd) gradients (Path
Discovery)
Illustrations
Source
Sink
Interest = Query/Request
Gradient = Forward path
Directed Diffusion
DD (cont)
2. Sending data
…(Data Forward)
Illustrations
Source
4. h = publish (SensedAttrVec)
5. send (h, SensedAttrVec)
SensedAttrVec Sink
CLASS_KEY IS DATA_CLASS
LONGITUDE_KEY IS 35
LATITUDE_KEY IS 110
SENSOR IS MOVEMENT
INTENSITY IS 0.8
CONFIDENCE IS 0.7
Low rate event
Directed Diffusion
DD (cont)
Illustrations
Sink
CLASS_KEY IS INTEREST_CLASS
LONGITUDE_KEY GE 10
LONGITUDE_KEY LE 50
LATITUDE_KEY GE 100
Source LATITUDE_KEY LE 120
SENSOR EQ MOVEMENT
INTENSITY GE 0.6
CONFIDENCE GE 0.7
INTERVAL IS 1
EXPIRE_TIME IS 90
Sink
Source
Sink
Recovering
from node failure
Low rate event
Reinforcement
High rate event
Directed Diffusion
Source
Sink
Stable path
Low rate event
High rate event
Directed Diffusion
DD: Broken link
Illustrations
Source
Sink
Recovering
from link failure
Low rate event
Reinforcement
High rate event
Directed Diffusion
DD: Path Recovery from a broken
link
Illustrations
Source
Sink
Stable path
Clustering
Cluster-Heads elect themselves –
by “Random Round-Robin” or
Power-Based Probability
Low Energy Adaptive Clustering Hierarchy
LEACH: Routing
Works in Rounds (cluster periods): each round/cluster
Main Procedures
period (h = 0, 1, 2, … ) with
Set-Up (Shorter h) and Steady-State (Longer h)
Set-Up Phase - subdivided:
h = 0: Advertisement (I am a Cluster-Head)
h = 1: Cluster Set-Up (I am in your Cluster)
h =2: Schedule Creation (This is your slot)
Steady-State Phase:
h = 3, …: Data Transmission using TDMA (Time
Division Multiple Access)
Low Energy Adaptive Clustering Hierarchy
LEACH
Every node uses the same channel
Main Procedures
Pros
Distributed, no global knowledge required
Energy saving due to aggregation by CHs
Shortcomings
LEACH assumes all nodes can transmit with enough power
to reach BS if necessary (e.g., elected as CHs)
Each node should support both TDMA & CDMA
LEACH (summary)
Cluster-based protocol
Each node randomly decides to become a cluster head (CH)
CH chooses the code to be used in its cluster
CH broadcasts Adv; Each node decides to which cluster it
belongs based on the received signal strength of Adv
Nodes can sleep when it’s not their turn to transmit
CH compresses data received from the nodes in the cluster and
sends the aggregated data to BS (Base Station/ Sink)
CH is rotated randomly
Threshold sensitive Energy Efficient Sensor
Network (TEEN)
Optimal No Yes No No
Route
Network Good Good V Good Excellent
Lifetime