Overview of IoT Protocols
Dr. S. Chithra,
Associate Professor, CT
Anna University, MIT Campus
Clustering Protocols of WSN
Internet of Things - Ubiquitous
Gartner: “IoT Installed Base Will Grow to 26 Billion Units By 2020.” That number might be
too low.
Every mobile
Every door
Every part, on
every parts list
Every auto
Every room
Every sensor in every device …
in every bed, chair or bracelet ... in every home,
office, building or hospital room … in every city and
village ... on Earth ...
LLN
• Low power and Lossy
Networks (LLNs)
• LLNs are composed of many
embedded devices:
• restricted in processing
power, memory and energy
(battery);
• interconnected by a variety of
links, such as IEEE 802.15.4
(LR-WPAN)
IoT Protocols
Overview of 6LoWPAN
• A simple low throughput wireless network comprising typically low
cost and low power devices
• Devices in the network typically work together to connect the
physical environment to real world applications, e.g., wireless
sensors networks
• Common topologies include – star, mesh, and combinations of star
and mesh
• The Phy and MAC layers conform to IEEE 802.15.4-2003 standard
6LoWPAN characteristics
• Small packet size
• Low bandwidth. (250/40/20 kbps)
• Topologies include star and mesh
• Low power, typically battery operated
• Relatively low cost
• Networks are ad hoc & devices have limited accessibility and
user interfaces
• Inherently unreliable due to nature of devices in the wireless
medium
Protocol Architecture of 6LowPAN
Comparison between WSN and IPv6
Problem
• No method exists to make IP run over IEEE 802.15.4
networks
• Stacking IP and above layers “as is” may not fit within
one 802.15.4 frame
– IPv6 uses 1280 bits
• Not all adhoc routing protocols may be immediately
suitable for LoWPAN
– DSR (Dynamic Source Routing) may not fit within a
packet.
– AODV (Ad hoc On-Demand Distance Vector) needs
more memory.
Need for Routing in 6LowPAN
• 6LoWPAN architecture enables the transmission of IPv6
over WSNs based on the IEEE 802.15.4 standard.
• 6LoWPAN supports routing in both layer
Layer2 - mesh-under
Layer3 - route-over
Routing is challenging for 6LoWPAN
• Low-power and Lossy radio links
• Battery powered nodes
• Multi-hop mesh topologies
• Frequent topological changes due to mobility.
Routing Protocol (RPL)
• The Internet Engineering Task Force (IETF) Working Group
designed a new routing protocol, called RPL.
• RPL is a distance-vector protocol and a source routing protocol that
is designed to operate on top of several link layer mechanisms.
• RPL forms the DODAG (Destination Oriented Directed Acyclic
Graph), which contain only 1 root. the root node is also called sink
node.
RPL and Objective Functions
• Objective functions are used to select next hop among
candidate next hops
• Examples
– Hop count
– Throughput
– ETX
• Combinations possible
The ETX Metric
• ETX = Expected Number of Transmissions
– Includes ReTX and ACK
• Path ETX = Sum of Link ETX
• Many ways to compute ETX
• Widely used in wireless routing
– Several MANET protocols
The ETX Objective Function (ETXOF)
• Pick the candidate with the smallest Path ETX
– Path ETX = 0 at DAG root
– Path ETX = Link ETX to a candidate n + Path ETX
from n to the DAG root
RPL Operation
RPL Operation
0 DIO
DIO 1
DIO
DIO
DIO 2
1 1 DIO
DIO DIO 2
DIO DIO
DIO
2 3
2
2 DIO DIO
3
3 3 3
• Directed Acyclic Graph (DAG) Information Object (DIO) messages are
broadcast to build the tree; includes a node’s rank (its level), ETX, etc.
• ETX probe is sent periodically to probe neighboring ETX
RPL Node RANK
• Defines a node's relative position within a DODAG with
respect to the DODAG root.
DODAG Construction
►
Nodes periodically send link-local multicast DIO messages
►
Nodes listen for DIOs and use their information to join a
new DODAG, or to maintain an existing DODAG
►
Based on information in the DIOs the node chooses
parents that minimize path cost to the DODAG root
Result: Upward routes towards the DODAG root
DODAG Example
Each node has a set of parent nodes
A node has no knowledge about children ! ONLY upward routes
Advertisement
H sends a DAO message to F indication the availability of H,
F adds the next-hop and forwards the message to I
G sends a DAO message to F indication the availability of G,
F adds the next-hop and forwards the message to I
F sends a DAO message to I indication the availability of F
I aggregates the routes and sends a DAO advertising (F-I)
RPL routing
RPL routing
RPL routing
RPL Implementations
Open source
ContikiRPL
→https://github.com/contikios/contiki/tree/master/core/net/rpl
TinyRPL
→https://github.com/tinyos/tinyosmain/tree/master/tos/lib/net/rpl
Unstrung → http://unstrung.sandelman.ca/
RPL Implementation
METRICS SKY MOTE WISMOTE
PACKET LOSS No packet loss Loss of packets
HOP COUNT More hops with slight Less hops
difference
ROUTING METRIC Less Efficient Efficient
ETX Less expected More expected
transmissions transmissions
BEACON INTERVAL Less interval More interval
CPU POWER High Less
LISTEN DUTY CYCLE 0.85 99.9
TRANSMITER DUTY 0.454 0.009
CYCLE
AVG INTER PACKET 45 Sec 57 sec
TIME
