UNIVERSITY INSTITUTE OF

ENGINEERING
COMPUTER SCIENCE ENGINEERING
Bachelor of Engineering (Computer Science & Engineering)
Subject Name: Internet of Things
Subject Code: CSY-313

Design Issues and Quality of Service DISCOVER . LEARN . EMPOWER

 Internet Of Things
Course Outcome
greedy
CO Title Level
Number
fails
CO1 An attribute of IOT is dependent on computer network. Understand Greedy Forwarding Perimeter Forwarding
Analyzing the extent to which IOT devices can be
expected to evolve in coming years.
CO2 IoT creates new platform opportunities for the Understand
innovators ready to build them. Understand of new
opportunities and innovation in the new emerging
Internet of Things.
CO3 For understanding the concept to ensure competition Understand have left local
and innovation dissemination on all IoT market greedy maxima greedy
segments, for allowing new isolated players and small- works fails
scale structures to propose and disseminate innovations
on a large scale, for promoting innovation via new
business models.

2
 • Study of existing IoT platforms
/middleware:IoT- A, Hydra, OpenIOT,
Carrot, Xively Etc
• Key IoT Technologies: Device Intelligence,
Syllabus for unit 3 Communication Capabilities, Mobility
Support, Device Power, Design factors, The
design issues & challenges

In unit 3- Students will learn about various

IOT technologies and study existing IOT
platforms.

3
Overview
• The design of routing protocols in WSNs is influenced by many challenging
factors. These factors must be overcome before efficient communication can
be achieved in WSNs.
• Node deployment
• Energy considerations
• Data delivery model
• Node/link heterogeneity
• Scalability
• Network dynamics
• Transmission media
• Connectivity
• Coverage
• Data aggregation/convergecast
• Quality of service

4
Node Deployment
• Node deployment in WSNs is application dependent and affects the performance of the routing
protocol.
• The deployment can be either deterministic or randomized.
• In deterministic deployment, the sensors are manually placed and data is routed through pre-
determined paths.
• In random node deployment, the sensor nodes are scattered randomly creating an infrastructure in
an ad hoc manner.

Energy Considerations
Sensor nodes can use up their limited supply of energy performing computations and transmitting information in a
wireless environment. Energy conserving forms of communication and computation are essential.
In a multi-hop WSN, each node plays a dual role as data sender and data router. The malfunctioning of some sensor
nodes due to power failure can cause significant topological changes and might require rerouting of packets and
reorganization of the network.

5
 Data Delivery Model
• Time-driven (continuous)
• Suitable for applications that require periodic data monitoring
• Event-driven
• React immediately to sudden and drastic changes
• Query-driven
• Respond to a query generated by the BS or another node in the network
• Hybrid
• The routing protocol is highly influenced by the data reporting method

Node/Link Heterogeneity
• Depending on the application, a sensor node can have a different role or capability.
• The existence of a heterogeneous set of sensors raises many technical issues related to data routing.

6
 Scalability

• The number of sensor nodes deployed in the sensing area may be on the
order of hundreds or thousands, or more.
• Any routing scheme must be able to work with this huge number of
sensor nodes.

Network Dynamics
• Routing messages from or to moving nodes is more challenging since route
and topology stability become important issues
• Moreover, the phenomenon can be mobile (e.g., a target detection/
tracking application).

7
Transmission Media
• In general, the required bandwidth of sensor data will be low, on the
order of 1-100 kb/s. Related to the transmission media is the design of
MAC.
• TDMA (time-division multiple access)
• CSMA (carrier sense multiple access)

Connectivity
• High node density in sensor networks precludes them from
being completely isolated from each other.
• However, may not prevent the network topology from
being variable and the network size from shrinking due to
sensor node failures.
8
Coverage
• In WSNs, each sensor node obtains a certain view of the environment.
• A given sensor’s view of the environment is limited in both range and
accuracy.
• It can only cover a limited physical area of the environment.

Data Aggregation/Convergecast
• Since sensor nodes may generate significant redundant data, similar
packets from multiple nodes can be aggregated to reduce the number
of transmissions.
• Data aggregation is the combination of data from different sources
according to a certain aggregation function.
• Convergecasting 9is collecting information “upwards” from the
Quality of Service
• In many applications, conservation of energy, which is directly related to
network lifetime.
• As energy is depleted, the network may be required to reduce the quality
of results in order to reduce energy dissipation in the nodes and hence
lengthen the total network lifetime.

10
Overview
• In flat network, each node typically plays the same role and sensor nodes collaborate together to
perform the sensing task.
• Due to the large number of such nodes, it is not feasible to assign a global identifier to each node. This
consideration has led to data centric routing, where the BS sends queries to certain regions and waits
for data from the sensors located in the selected regions. Since data is being requested through
queries, attribute-based naming is necessary to specify the properties of data.
• Prior works on data centric routing, e.g., SPIN and Directed Diffusion, were shown to save energy
through data negotiation and elimination of redundant.

11
SPIN -Motivation
• Sensor Protocols for Information via Negotiation, SPIN
• A Negotiation-Based Protocols for Disseminating Information in Wireless Sensor
Networks.
• Dissemination is the process of distributing individual sensor
observations to the whole network, treating all sensors as sink nodes
• Replicate complete view of the environment
• Enhance fault tolerance
• Broadcast critical piece of information
• Deficiencies
• Implosion
• Overlap
• Resource blindness

12
SPIN (cont.)- SPIN family
• Protocols of the SPIN family
• SPIN-PP
• It is designed for a point to point communication, i.e., hop-by-hop routing
• SPIN-EC
• It works similar to SPIN-PP, but, with an energy heuristic added to it
• SPIN-BC
• It is designed for broadcast channels
• SPIN-RL
• When a channel is lossy, a protocol called SPIN-RL is used where adjustments
are added to the SPIN-PP protocol to account for the lossy channel.

13
SPIN (cont.)- Three-stage handshake protocol
• SPIN-PP: A three-stage handshake protocol for point-to-point media
• ADV – data advertisement
• Node that has data to share can advertise this by transmitting an ADV with
meta-data attached
• REQ – request for data
• Node sends a request when it wishes to receive some actual data
• DATA – data message
• Contain actual sensor data with a meta-data header
• Usually much bigger than ADV or REQ messages

14
 Directed Diffusion
A Scalable and Robust Communication Paradigm
for Sensor Networks

15
 Overview

• Data-centric communication A sensor field

• Data is named by attribute-value pairs Sources
Event
• Different form IP-style communication
• End-to-end delivery service
• e.g.
• How many pedestrians do you observe in the
geographical region X? Directed
Diffusion

Sink Node

16
Directed Diffusion

• Typical IP based networks

• Requires unique host ID addressing
• Application is end-to-end

• Directed diffusion – use publish/subscribe

• Inquirer expresses an interest, I, using attribute values
• Sensor sources that can service I, reply with data

17
Data Naming

• Expressing an Interest
• Using attribute-value pairs
• e.g.,

18
Exploratory Gradient

Exploratory Request
Gradient

Event

Low Data-rate Interest

Low Data-rate Interest

Low Data-rate Interest

19
Data Propagation

• A sensor node that detects a target

• Search its interest cache
• Compute the highest requested data-rate among all its outgoing
gradients
• Data message is unicast individually
• A node that receives a data message
• Find a matching interest entry in its cache
• Check the data cache for loop prevention
• Re-send the data to neighbors

20
Reinforcement (1/4)
• Positive reinforcement
• Sink selects the neighboring node
• Original interest message but with high data-rate
• Neighboring node must also reinforce at least one neighbor
• Low-delay path is selected
• Exploratory gradients still exist: useful for faults

Reinforced gradient
Event Reinforced gradient
Source
A sensor field
Sink

21
Reinforcement (2/4)
• Path failure and recovery
• Link failure detected by reduced rate, data loss
• Choose next best link (i.e., compare links based on infrequent exploratory
downloads)
• Negatively reinforce lossy link
• Either send interest with base (exploratory) data rate or allow neighbor’s
cache to expire over time

Link A-M lossy

Event D A reinforces B
M B reinforces C
Source A
C reinforces D
C
B Sink
or
A negative reinforces M
M negative reinforces D
22
Directed Diffusion: Pros & Cons
• Different from SPIN in terms of on-demand data querying mechanism
• Sink floods interests only if necessary (lots of energy savings)
• In SPIN, sensors advertise the availability of data
• Pros
• Data centric: All communications are neighbor to neighbor with no need for a
node addressing mechanism
• Each node can do aggregation & caching
• Cons
• On-demand, query-driven: Inappropriate for applications requiring continuous
data delivery, e.g., environmental monitoring
• Attribute-based naming scheme is application dependent
• For each application it should be defined a priori
• Extra processing overhead at sensor nodes

23
 LEACH
Low-Energy Adaptive Clustering Hierarchy

24
 LEACH
• LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based
protocol that minimizes energy dissipation in sensor networks.
• LEACH outperforms classical clustering algorithms by using adaptive
clusters and rotating cluster-heads, allowing the energy requirements of
the system to be distributed among all the sensors.
• LEACH is able to perform local computation in each cluster to reduce the
amount of data that must be transmitted to the base station.
• LEACH uses a CDMA/TDMA MAC to reduce inter-cluster and intra-cluster
collisions.

25
LEACH
100 m
叢 叢 叢

叢 叢 叢 叢

~100m

Sensor (Non Cluster Head)

Sensor (Cluster Head)
Initial Data
Aggregated Data

26 Base Station
LEACH: Adaptive Clustering
• Periodic independent self-election
• Probabilistic
• CSMA MAC used to advertise
• Nodes select advertisement with strongest signal strength
• Dynamic TDMA cycles

All nodes marked with a given symbol belong to the same cluster, and the cluster head nodes are
marked with a ●.
27
Algorithm
• Periodic process
• Two phases per round:
• Setup phase
• Advertisement: Execute election algorithm
• Members join to cluster
• Cluster-head broadcasts schedule

• Steady-State phase
• Data transmission to cluster-head using TDMA
• Cluster-head transfers data to BS (Base Station)

28
 Algorithm Summary
• Set-up phase
• Node n choosing a random number m between 0 and 1
• If m < T(n) for node n, the node becomes a cluster-head where

 P
 if n  G
T ( n )   1  P [ r * mod(1/ P )]
0
 otherwise ,

• where P = the desired percentage of cluster heads (e.g., P= 0.05), r=the current
round, and G is the set of nodes that have not been cluster-heads in the last 1/P
rounds. Using this threshold, each node will be a cluster-head at some point
within 1/P rounds. During round 0 (r=0), each node has a probability P of
becoming a cluster-head.
29
 Algorithm Summary (cont.)
• Set-up phase
• Cluster heads assign a TDMA schedule for their members where each node is
assigned a time slot when it can transmit.
• Each cluster communications using different CDMA codes to reduce interference
from nodes belonging to other clusters.
• TDMA intra-cluster
• CDMA inter-cluster
• Spreading codes determined randomly
• Broadcast during advertisement phase

30
An Example of a LEACH Network

• While neither of these diagrams is the optimum scenario, the second

is better because the cluster-heads are spaced out and the network is
more properly sectioned

Good case scenario Bad case scenario

Node
Cluster-Head Node
X Node that has been cluster-head in the last 1/P rounds
Cluster
31 Border
Conclusions
• Directed diffusion, a paradigm proposed for event monitoring sensor networks
• Directed Diffusion has some novel features - data-centric dissemination,
reinforcement-based adaptation to the empirically best path, and in-network data
aggregation and caching.

• Advantages
• Increases the lifetime of the network
• Even drain of energy
• Energy saving due to aggregation by CHs

• Disadvantages
• 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
32
Reference

• C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed Diffusion: A

Scalable and Robust Communication Paradigm for Sensor Networks,” in
the Proceedings of the Sixth Annual International Conference on Mobile
Computing and Networks (MobiCom’00), August 2000.
• C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva,
“Directed Diffusion for Wireless Sensor Networking,” IEEE/ACM
Transactions on Networking, Vol. 11, No. 1, Feb. 2003.
• W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-efficient
communication protocol for wireless sensor networks,” Proceedings of
the 33rd Hawaii International Conference on System Sciences, January
2000.

33
 THANK YOU

For queries
Email: [email protected]