RPL:IPv6 Routing Protocol for Low Power and Lossy Networks Speaker: Chung-Yi Chao Advisor: Dr. Kai-Wei Ke 2015/10/08 1.

Slides:



Advertisements
Similar presentations
Identifying Defunct DAGs in RPL draft-goyal-roll-defunct-dags-00 Mukul Goyal University of Wisconsin Milwaukee.
Advertisements

Neighbor Discovery for IPv6 Mangesh Kaushikkar. Overview Introduction Terminology Protocol Overview Message Formats Conceptual Model of a Host.
IPv6 Routing Protocol for Low- Power and Lossy Networks Speaker : Chih-Ching Chen Advisor : Dr. Ho-Ting Wu 2014/3/24 1.
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
Network Layer IPv6 Slides were original prepared by Dr. Tatsuya Suda.
Computer Networks with Internet Technology William Stallings
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
A Compression Format for RPL Control Messages draft-goyal-roll-rpl-compression-00 Mukul Goyal University of Wisconsin Milwaukee.
Reactive Discovery of Point-to-Point Routes in Low Power and Lossy Networks draft-ietf-roll-p2p-rpl-04 Mukul Goyal University of Wisconsin Milwaukee.
Nov 11, 2004CS573: Network Protocols and Standards1 IP Routing: OSPF Network Protocols and Standards Autumn
MOBILITY SUPPORT IN IPv6
Oct 21, 2004CS573: Network Protocols and Standards1 IP: Addressing, ARP, Routing Network Protocols and Standards Autumn
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
CSE331: Introduction to Networks and Security Lecture 7 Fall 2002.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Extending Networks. Three Levels of Extension Physical Layer –Repeaters Link Layer –Bridges –Switches Network –Routers: “Connecting networks”
Slide #1IETF 77 – Roll WG – March 2010 ROLL RPL IETF 77 status draft-ietf-roll-rpl Tim Winter Pascal Thubert Design Team.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Introducing Distance Vector Routing.
Ad Hoc Wireless Routing COS 461: Computer Networks
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
IETF-76, Hiroshima, Nov 2009 ROLL Working Group Meeting IETF-76, Nov 2009, Hiroshima Routing Metrics used for Path Calculation in Low Power and Lossy Networks.
1Group 07 IPv6 2 1.ET/06/ ET/06/ ET/06/ EE/06/ EE/06/ EE/06/6473 Group 07 IPv6.
TCP/IP Protocol Suite 1 Chapter 14 Upon completion you will be able to: Unicast Routing Protocols: RIP, OSPF, and BGP Distinguish between intra and interdomain.
Chapter 7: Routing Dynamically
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Mobile Adhoc Network: Routing Protocol:AODV
CSC 600 Internetworking with TCP/IP Unit 8: IP Multicasting (Ch. 17) Dr. Cheer-Sun Yang Spring 2001.
Dynamic Routing Protocol EIGRP Enhanced Interior Gateway Routing Protocol (EIGRP) is an advanced distance vector routing protocol developed by Cisco.
10/13/2015© 2008 Raymond P. Jefferis IIILect 07 1 Internet Protocol.
Interior Gateway Protocol. Introduction An IGP (Interior Gateway Protocol) is a protocol for exchanging routing information between gateways (hosts with.
Lecture 4: BGP Presentations Lab information H/W update.
TCOM 515 IP Routing. Syllabus Objectives IP header IP addresses, classes and subnetting Routing tables Routing decisions Directly connected routes Static.
Border Gateway Protocol
Border Gateway Protocol (BGP) W.lilakiatsakun. BGP Basics (1) BGP is the protocol which is used to make core routing decisions on the Internet It involves.
1 Ad Hoc On-Demand Distance Vector Routing (AODV) Dr. R. B. Patel.
Layer 3: Internet Protocol.  Content IP Address within the IP Header. IP Address Classes. Subnetting and Creating a Subnet. Network Layer and Path Determination.
Slide #1IETF 82 – ROLL WG – November 2011 RPL adaptation for asymmetrical links IETF 82 status draft-thubert-roll-asymlink Pascal Thubert.
CSC 600 Internetworking with TCP/IP Unit 7: IPv6 (ch. 33) Dr. Cheer-Sun Yang Spring 2001.
AODV: Introduction Reference: C. E. Perkins, E. M. Royer, and S. R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-08.txt,
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
Routing protocols. Static Routing Routes to destinations are set up manually Route may be up or down but static routes will remain in the routing tables.
Speaker: Yi-Lei Chang Advisor: Dr. Kai-Wei Ke 2012/05/15 IPv6-based wireless sensor network 1.
RPL Routing Pathology In a Network With a Mix of Nodes Operating in Storing and Non-Storing Modes draft-ko-roll-mix-network-pathology JeongGil Ko, J.Jeong,
6LoWPAN Ad Hoc On-Demand Distance Vector Routing Introduction Speaker: Wang Song-Ferng Advisor: Dr. Ho-Ting Wu Date: 2014/03/31.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
1 Chapter 14-16a Internet Routing Review. Chapter 14-16: Internet Routing Review 2 Introduction Motivation: Router performance is critical to overall.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
The Semantic IoT Amr El Mougy Slim Abdennadher Ghada Fakhry.
1 IPv6: Address Architecture Dr. Rocky K. C. Chang 29 January, 2002.
Prof. Alfred J Bird, Ph.D., NBCT Office – Science 3rd floor – S Office Hours – Monday and Thursday.
ROUTING ON THE INTERNET COSC Jun-16. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
ECE 544 Protocol Design Project 2016 Kiran Jatty Lasya Nandamuri Varun Vinnakota.
Mukul Goyal University of Wisconsin Milwaukee
Author:Zarei.M.;Faez.K. ;Nya.J.M.
IP: Addressing, ARP, Routing
Wireless Sensor Networks 6. WSN Routing
Single-Area OSPF 1 Cisco Networking Academy program Routing Protocols
Internet Networking recitation #4
Single-Area OSPF (Open Shortest Path First Protocol)
Sensor Network Routing
Single-Area OSPF (Open Shortest Path First Protocol)
Chapter 3: Dynamic Routing
Chapter 3: Dynamic Routing
EIGRP.
Chapter 15. Internet Protocol
Presentation transcript:

RPL:IPv6 Routing Protocol for Low Power and Lossy Networks Speaker: Chung-Yi Chao Advisor: Dr. Kai-Wei Ke 2015/10/08 1

Outline INTRODUCTION TERMINOLOGY RPL DESIGN OVERVIEW UPWARD ROUTING ROUTING LOOPS RPL METRICS DOWNWARD ROUTING CONCLUSION REFERENCE 2

INTRODUCTION Over the last years WSNs have become a very important and challenging research field. There are cases where a network can only achieve approximately the half of the throughput of the corresponding lossless network. Lossy links effect the power consumption due to packet retransmissions and broadcasting. 3

INTRODUCTION(Cont.) Such LLNs are additionally characterized by connections that are not restricted to two endpoints. The Internet Engineering Task Force (IETF) ROLL Working Group designed a new routing protocol, called RPL. The highest goal of RPL is to provide efficient routing paths for P2MP and MP2P traffic patters in LLNs. 4

TERMINOLOGY DAG(Directed Acyclic Graph) DAG root DODAG(Destination-Oriented DAG) DODAG root Rank OF(Objective Function) RPL Instance RPLInstanceID 5

TERMINOLOGY(Cont.) DODAGID Sub-DODAG DIO(DODAG Information Object) DAO(Destination Advertisement Object) DIS(DODAG Information Solicitation) 6

RPL DESIGN OVERVIEW RPL is a distance vector routing protocol for LLNs that makes use of IPv6. The protocol tries to avoid routing loops by computing a node’s position relative to other nodes with respect to the DODAG root. The RPL specification defines four types of control messages for topology maintenance and information exchange. Another important fact about the protocol’s design is the maintenance of the topology. 7

UPWARD ROUTING Upward routing is a standard procedure which enables network devices to send data to a root. In a typical WSN scenario, nodes periodically generate data packets which have to find their way through the network. In this section: 1.DIO Message Structure 2.Construction Topologies 8

DIO Message Structure DIO message is the main source of information which is needed during topology construction. 9 DIO Option

DIO Message Structure(Cont.) The first field is RPLInstanceID. The second and the third field is the sender‘s DODAG Version and the Rank of the message. The ’G’ flag which defines whether a DODAG is grounded. The MOP(mode of operation) field is set by the DODAG root and defines the used mode of operation for downward routing. The Prf(DAGPreference) field defines how preferable the root node is compared to other root nodes. 10

DIO Message Structure(Cont.) 11 DTSN (Destination Advertisement Trigger Sequence Number) field: Such a number is maintained by the node issuing the DIO message and guarantees the freshness of the message. The DODAGID field used to identify node.

DODAG Configuration Option A DIO message may be extended by the use of options. 12

DODAG Configuration Option(Cont.) 13

DODAG Configuration Option(Cont.) OCP (Objective Code Point ): The OCP field identifies the OF and is managed by the IANA. Default Lifetime: This is the lifetime that is used as default for all RPL routes. It is expressed in units of Lifetime Units Lifetime Unit: Provides the unit in seconds that is used to express route lifetimes in RPL. 14

Construction Topologies In a RPL network, node have three type: 1)root node 2)routers 3)leaf Step1. Construction topology starts at a root node begins to send DIO messages. Step2. Each node that receives the message runs an algorithm to choose an appropriate parent.  The choice is based on the used metric and constraints defined by the OF. 15

Construction Topologies(Cont.) Step3. Each of them computes its own Rank and in case a node is a router, it updates the Rank in the DIO message and sends it to all neighboring peers. Step4. Repeat Step.2 and Step3. the process terminates when a DIO message hits a leaf or when no more nodes are left in range. Three values have to be considered in order to uniquely identify a DODAG: 1)RPL Instance ID: identification of an independent set of DODAG. 2)DODAG ID: is a routable IPv6 address belonging to the root 3)DODAG version number: is incremented each time a DODAG reconstruction. 16

Construction Topologies(Cont.) 17

ROUTING LOOPS The formation of routing loops is a common problem in all kinds of networks. RPL define two mechanisms to solve this problem. 1)Avoidance Mechanisms 2)Detection Mechanisms 18

Avoidance Mechanisms 1.RPL node does not process DIO messages from nodes deeper (higher Rank) than itself. 2.RPL specification suggests that a node must never advertise within a DODAG Version a Rank higher than RankLowest + RankMaxInc. RankLowest is the lowest Rank the node has advertised within a DODAG Version. RankMaxInc is a predefined constant received via a DIO. 19

Detection Mechanisms RPL loop detection uses additional information that is transported in the data packets. It places a RPL Packet Information in the IPv6 option field which is updated and examined on each hop. There are five control fields within the RPL Packet Information. 1.The packet is sent in a upward or downward direction. 2.Reports if a Rank mismatch has been detected. 3.Report a error field by a child node. 4.The Rank of the sender. 5.The RPL Instance ID. 20

RPL METRICS Node Energy Consumption EE(Energy Estimation) ETX PRR(Packet Reception Rate) ETX(expected transmission count) 21

DOWNWARD ROUTING The support of downward routing is another important feature of RPL. The RPL specification defines two modes of operation for supporting P2MP. Non-storing mode Storing mode In this section: DAO Message Structure Non-Storing Mode Storing Mode 22

DAO Message Structure 23 DAO Option

DAO Message Structure(Cont.) The ‘K’ flag which indicates whether the sender of the DAO expects to receive a DAO-ACK in response. The ‘D’ flag indicates if the DODAGID field is present The DAO Sequence field is a sequence number that is incremented for each outgoing DAO message by the sender 24

DAO Target Option Target Option is used to indicate a target IPv6 address, prefix or multicast group. 25

DAO Target Option(Cont.) Option Type : 0X05 Option Length: Variable, length of the option in octets excluding the Type and Length fields. Prefix Length: 8-bit unsigned integer. Number of valid leading bits in the IPv6 Prefix. Target Prefix: Variable-length field identifying an IPv6 destination address, prefix, or multicast group. 26

DAO Transit Information Option Transit Information Option is used to indicate attributes for a path to one or more destinations. 27

DAO Transit Information Option(Cont.) Option Type: 0x06 Option Length: Variable, depending on whether or not the DODAG Parent Address subfield is present. External (E): set to indicate that the parent router redistributes external targets into the RPL network. Path Control: limits the number of DAO parents to which a DAO message advertising connectivity to a specific destination may be sent. 28

DAO Transit Information Option(Cont.) Path Sequence: indicates if a Target option with updated information has been issued. Path Lifetime: defines how long a prefix for a destination should be kept valid. Parent Address (optional): IPv6 address of the DODAG parent of the node originally issuing the Transit Information option. 29

Non-Storing Mode In the non-storing mode each node generates a DAO message and sends it to the DODAG root. The RPL specification suggests that the delay between two DAO sending operations may be inversely proportional to the Rank. The resulting DAO message is sent directly to the DODAG root along the default route created during parent selection. The DODAG root can piece together a Downward route to a node by using DAO parent sets from each node in the route. 30

Non-Storing Mode(Cont.) 31

Storing Mode Similar to the non-storing mode, the storing mode also requires the generation of DAO messages. However, a DAO is no longer propagated to the DODAG root. Instead, it is sent as unicast to all parent nodes which maintain additional downward routing tables. 32

Storing Mode(Cont.) 33

CONCLUSION LLNs and WSNs are rapidly emerging as a new type of distributed systems. RPL was specified and developed in order to overcome these requirements about high delivery ratio and energy efficient at same time. RPL also allows optimization of the network for different application scenarios and deployments. 34

REFERENCE Tsvetko Tsvetkov, “RPL: IPv6 Routing Protocol for Low Power and Lossy Networks”, Network Architectures and Services, pp July 2011 T. Winter, P. Thubert, A. Brandt, J. Hui, R. Kelsey, P. Levis, K. Pister, R. Struik, JP. Vasseur, and R. Alexander “RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks,” IETF, RFC6550, Mar