RPL-Routing Protocol for Low
Power and Lossy Networks
PRESENTED BY:
PALLAVI VUPPALA
227Z1A04C6
III-ECE B
Overview
• Introduction
• Routing Requirements
• RPL instance and DODAG
• RPL Ranks
• Route construction
• Objective Function and Control Messages
Introduction
• Low Power and Lossy Networks (LLN) are resource constrained.
Routers are usually limited in terms of processing power, battery and memory, and
their interconnects are characterized by unstable links with high loss rates, low data
rates, and low packet delivery rates.
• The traffic patterns could be P2P or P2MP or MP2P.
• Lossy means the packet drop rate will be high.
• RPL is a distance vector routing protocol
Introduction
• RPL mainly targets collection-based networks, where nodes periodically send
measurements to a collection point.
• The protocol was designed to be highly adaptive to network conditions and to
provide alternate routes whenever default routes are inaccessible.
• RPL provides a mechanism to disseminate information over the dynamically formed
network topology.
• Contains thousands of nodes...
RPL topology
• DODAG (Destination Oriented Directed Acyclic Graphs)
A DODAG is a DAG rooted at a single destination. The DODAG root has no outgoing edges. A
DODAG is uniquely identified by a combination of RPL Instance ID and DODAG ID.
• Rank
A node's Rank defines the node's individual position relative to other nodes with respect to a
DODAG root. Rank strictly increases in the Down direction and strictly decreases in the Up direction.
• DODAG Root
The DODAG root is the DAG root of the DODAG. The DODAG root may act as a border router for the
DODAG, and aggregate routes in the DODAG and may redistribute DODAG routes into other routing
protocols.
• RPL supports multiple instances of routing topologies, each optimized for specific
application objectives (e.g., low latency or energy efficiency).
• RPL prevents routing loops using a strict rank hierarchy and DAG rules.
• Upward path is so common (mp2p).
• Downward path is optional mainly for p2p and p2mp
• An RPL Instance consists of multiple Destination Oriented Directed Acyclic Graphs
(DODAGs). Traffic moves either up towards the DODAG root or down towards the
DODAG leaves.
RPL Instance
•DODAGs are disjoint (no shared nodes).
•Link properties: (reliability, latency, ...) Node
properties: (powered or not, ...)
•RPL Instance has an optimization
objective.
•Multiple RPL Instances with different
optimization objectives can coexist.
RPL Rank
•A node’s Rank defines the
node’s individual position relative
to other nodes with respect to a
DODAG root.
•The scope of Rank is a DODAG
Version.
Forwarding and Routing
• Up routes towards nodes of decreasing rank (parents).
• Down routes towards nodes of increasing rank.
• Nodes inform parents of their presence and reachability to descendants.
• All routes go upwards and/or downwards along a DODAG.
• When going up, always forward to lower rank when possible, may forward to sibling
if no lower rank exists.
• When going down, forward based on down routes.
RPL Control
Messages
•DIO - DODAG Information Object
•DIS - DODAG Information Solicitation
•DAO - Destination Advertisement
Object (propagate destination
information upwards)
•DAO-ACK - DAO Acknowledgement
(unicast packet by a DAO recipient)
•CC - Consistency Check (Checking
for consistency in the messages)
THANK YOU
