Data Transmission and

Routing

Dr. Monir Hossen

ECE, KUET

Department of Electronics and Communication Engineering, KUET

Why do we need Aggregation?
• Sensor networks – It is an Event-based Systems
– Redundancy is common in the event data
• Example Query:
– What is the maximum temperature in area A between
10am and 11am?
• Individual sensor readings are of limit use
• Forwarding raw information too expensive
– Scarce energy
– Scarce bandwidth
• Solution
– Combine the data coming from different sources
• Eliminate redundancy
• Minimize the number of transmissions

Department of Electronics and Communication Engineering, KUET L-10 2

What is Data Aggregation Process
Aggregation collects data from several sensors
and calculates a smaller message that
summarizes the important information from a
group of sensors.
Aggregation is helpful as it reduces the amount
of traffic on a network.
– This helps prolong battery life
– Can provide less processing needs
 Drawbacks of Aggregation
• More computation for internal nodes
• More delays in getting from edge node to Central
Node.
• Not as useful when full data is needed.
Department of Electronics and Communication Engineering, KUET 3
 Data Aggregation and Flow States
Partial Aggregates flow up
the tree during an Epoch
A node transitions through
following states
 Receive partial records
from children
 Process aggregates by
combining own
information
 Deliver updated partial
record to the parent

Department of Electronics and Communication Engineering, KUET 4

 Sensor Network Storage -
Mechanism (1/2)
 Centralized Storage
 Central server
 Ample power
 Sufficient storage
 Single point of failure
 Fast Query processing
 High communication
 Meager Networks
 Infrequent events
 Low Data Transfer
 Scalability problems

Department of Electronics and Communication Engineering, KUET 5

 Sensor Network Storage -
Mechanism (2/2)
 Distributed Storage
 Storage at each node
 Local computation
 Scalable
 Dense Networks
 Frequent events
 High Data Transfer
 Slower Query processing
 Flooding
 Distributed Indexing
 Drill-down querying

Department of Electronics and Communication Engineering, KUET 6

 External and Local Storages

 External storage (ES): The data sensed are

transmitted to an external (centralized) host for
storage.
Not energy-efficient.

 Local storage (LS): The data collected are stored

locally in the sensor node itself.
More energy-efficient than ES.

Department of Electronics and Communication Engineering, KUET 7

 Data-centric Storage (DCS)

 In DCS, the event data are stored based on their event

type and at some special ‘‘home nodes’’.
 The home nodes may not be the original location of
the data collected.
 Therefore, in DCS, a query can be routed to the
corresponding home nodes according to the data
type.

This approach can be energy efficient and it is easy to

realize load balancing.

Department of Electronics and Communication Engineering, KUET 8

 Provenance-aware Data Storage
(PADS)
 PADS emphasizes the necessity of being able to
query the provenance (origin) of data for certain
applications.
 The event data are stored locally in PADS, while
the index or pointer of the data is stored in some
‘‘home hosts,’’ as in DCS.

Therefore, PADS realizes the advantages of both the

LS and DCS.

Department of Electronics and Communication Engineering, KUET 9

 Multi-Resolution Storage (MRS)
 In MRS, data are decomposed
and classified into 3 levels:
 Level 0 for raw data,
 Level 1 for finer data,
 Level 2 for the coarsest data.
 Data of different levels will be
stored for different durations:
 The level 2 data will be stored
for the longest term.
 Raw data will be stored for
the shortest.
 The MRS is actually a
differentiated storage scheme; it
realizes better load balancing and oConstruct data summaries
incurs lower overhead. oHierarchy construction
Department of Electronics and Communication Engineering, KUET L-11 10
 Neighbor Discovery (1/2)
 The sensor nodes are placed randomly over the area of
interest, and their first step is to detect their immediate
neighbors, i.e., the nodes with which they have direct
wireless communication.
 Although sensor nodes are static, topology changes still
take place, due to the following factors:
o Loss of local synchronization due to accumulated clock
drifts.
o Disruption of wireless connectivity between adjacent nodes
by a temporary event, such as a passing car or animal, a dust
storm, rain or fog.
o The ongoing addition of new nodes in some networks to
compensate for nodes that do not function any more.
 We distinguish between the neighbor discovery in the initial
phase and the ongoing topology maintenance at the
operation phase.
Department of Electronics and Communication Engineering, KUET 11
 Neighbor Discovery (2/2)
a b c
a and c
discover each
other

•Every time a node wakes up, it

broadcasts HELLO. Only a
b sends HELLO node that is already in awake up
message, which is condition can hear this message
heard by no one
and establish connections.
•Node a receives HELLO from
node c. Hence, they discover
each other.
•However, a and b do not know
about b and vise versa.
Department of Electronics and Communication Engineering, KUET 12
 Energy Model of WSN (1/2)
 Energy consumption in WSN depends on the states of a
node:
Transmitting mode
 Active state
 Sleep State Receiving mode
 Distance to be sensed /transmitted
 No of bits to be sensed /transmitted
 Energy of transmitting and receiving l bit data over a distance
d is:
Etx (l , d )  lE c  led s Where , e  e1 s  2, d  d cr

Erx (l , d )  lEc e2 s  4, d  d cr

 Ec= Base energy to run transmitter and receiver circuits, dcr =

crossover distance, e is the typical energy per bit.

Department of Electronics and Communication Engineering, KUET 13

 Energy Model of WSN (2/2)
 Total Energy required for transmitting l bit data over
a distance d from source i to destination j is:
Ei , j (l , d )  Etx (l , d )  Erx (l , d )
 The optimal distance between the relay nodes (dm) is:

a1
dm  s where, a1  2 Ec , a2  e
a2 ( s  1)

 So the optimal hop count is: H=d/dm

Department of Electronics and Communication Engineering, KUET 14

 Assignment
Source node,
 Assume the crossover l1 = 1000 bits
distance is 42m, Ec = 50
nj/bit, e1=10 pJ/bit and 32 m
e2=0.0013 pJ/bit . Source node,
(i) Calculate total energy l2 = 1500 bits
required from source to
destination. 52 m
(ii) Also calculate the number
of bits received in the sink
Sink node
node.

Department of Electronics and Communication Engineering, KUET 15

 Routing Model of WSN
 Based on the energy model. The energy consumption for a
routing path p is.
E ( p)   Ei ,n p (i ) (li , di )
i
Where, np(i) is the next hop of node i on path p.
Ei ,n p (i ) (li , di ) is the energy from node i to node np(i).
 Average no. of retransmission:
Probability of packet error rate, Pe= 1-(1-be)L , where, be is BER,
L is the length of packet.

 So Maximum number of retransmission:

pe
nr 
1  pe

Department of Electronics and Communication Engineering, KUET L-12 16

 Routing Strategies

Aim to make communication more

efficient
Trade-off between routing overhead and
data transmission cost
Strategies incur differing levels of
communication and storage overhead
Hybrid approaches are possible

Department of Electronics and Communication Engineering, KUET 17

Why Routing is Required in WSN
Whenever a source node cannot send its packets directly to its
destination node
It has to trust on the assistance of intermediate nodes to
forward these packets on its behalf

In Figure, an intermediate node (as well as the source node)

has to decide to which neighboring node an incoming packet
should be passed on so that it eventually reaches the
destination.

Department of Electronics and Communication Engineering, KUET 18

Proactive and Reactive Routing
 Proactive routing
 Routes created and maintained in advance
 Low latency, high resource demand
 Does not scale to large networks
 Reactive routing
 Routes created and cached as required
 High latency, lower resource demand

Department of Electronics and Communication Engineering, KUET 19

 Routing Protocols in WSNs
Routing
Protocols

Traditional Routing Current Routing

Flooding Gossiping
Location-
Flat-
Based
Based
Hierarchical-
Based
Department of Electronics and Communication Engineering, KUET 20
 Flooding Protocol
 A classical mechanisms to relay data in sensor
networks without the need for any routing
algorithms and topology maintenance. It
broadcasts data.

 Drawbacks:
• Implosion (duplicate
packet may receive)
• Overlap (two sensors send
a packet at the same time)
• Resource blindness (without checking
node’s status it transmits packets)
Department of Electronics and Communication Engineering, KUET 21
 Gossiping Protocol
 A slightly enhanced version
of flooding where the
transmitting node sends the
packet to a randomly
selected neighbor which
picks another neighbor to
forward the packet to and so
on.
 Advantage: avoid the
collapse
 Drawback:
Transmission delay

Department of Electronics and Communication Engineering, KUET L-13 22

Flat-Based Routing Protocols (1/2)
 All the nodes are treated equally and have the
same functionality
1. Sensor Protocol for Information Negotiation (SPIN):
 Sending meta-data to neighboring nodes, instead of data
 Requesting for the desired data
 Avoid redundant data transmission
 Adaptation to remaining energy increase the network
lifetime

2. Directed Diffusion:
 BS continuously sends query to the neighboring nodes
 Node with the desired data transmit all the way back to BS
 Saving energy by selecting the optimal return path
 Not practical for continuous data demand cases
Department of Electronics and Communication Engineering, KUET 23
 Flat-Based Routing Protocols (2/2)
3. Rumor Routing:
 Variation of Directed Diffusion
 Each node has an event table
 Event agent flooding instead of
query flooding
 Significant energy saving
 Good for when number of events is less than queries

4. Minimum Cost Forwarding Algorithm (MCFA):

 Each node knows the least cost path between itself and BS
 Least cost path can be acquired via initialization
 Saving energy by selecting the optimal return path
 Good for small networks
Department of Electronics and Communication Engineering, KUET 24
 Hierarchical Routing (1/3)
 Higher energy nodes for transmission, lower
energy nodes for sensing
 Two layer routing
 Increasing the life time

1. Low Energy Adaptive Clustering Hierarchy

(LEACH):
 Random and variation Cluster Head (CH) selection
 Compression and transmission of arriving data at CHs
 Constant monitoring applications
 Good for small networks
 Extra overhead because of clustering

Department of Electronics and Communication Engineering, KUET 25

 Hierarchical Routing (2/3)
2. Self Organizing Protocol (SOP):
 Mobile sensors to probe the environment
 Stationary nodes as the routers
 LML algorithm for routin (LML= local markov loops)
 Energy consumption is less than SPIN
3. Virtual Grid Architecture
 Symmetric, non-overlapping clusters with optimal CH
 Local and global data aggregation
 Hard to find the optimal global aggregators

Department of Electronics and Communication Engineering, KUET 26

 Hierarchical Routing (3/3)

4. Hierarchical power-aware
routing
 Neighboring nodes form
zones
 Routes through the zones
which has maximum
residual energy
 Extra algorithm can be
exploited

Department of Electronics and Communication Engineering, KUET 27

 Location-Based Routing
o Sensor nodes are addressed based on their location
o Location are acquired by GPS or via coordination
among the nodes
1. Geographical Adaptive Fidelity (GAF):
 Network divided into zones
 Only one node is awake in each zone, the rest are in sleep
 Conserves energy by turning off unnecessary nodes
 Increases the network life time

2. SPAN(Self Powered Ad-Hoc Networks):

 Some nodes are selected as coordinators based on their
positions
 Enough coordinators such that network is three-hop
reachable
 Not energy efficient as the others
Department of Electronics and Communication Engineering, KUET 28
Routing Protocols Based on Protocol
Operation
1. Multipath routing
 Increases fault tolerance
 Sophisticated case: have back up paths

2. Query-based routing
 Query transmitted and the date is sent back

3. Negotiation-based routing
 High-level data description
 Elimination of redundant data transmission

4. QoS-based routing
 Balance between data quality and energy consumption

Department of Electronics and Communication Engineering, KUET 29

 Thanks for Your Kind
Attention

Department of Electronics and Communication Engineering, KUET