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.

Slides:



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

Directed Diffusion for Wireless Sensor Networking
IPv6 Routing Protocol for Low- Power and Lossy Networks Speaker : Chih-Ching Chen Advisor : Dr. Ho-Ting Wu 2014/3/24 1.
Project3 Malabika Das Prajna Setty Preeti Rao. Assumptions and Address Scheme Assumptions End hosts can only connect to one router and knows which router.
HYDRO: A Hybrid Routing Protocol for Lossy and Low Power Networks draft-tavakoli-hydro-01 Stephen Dawson-Haggerty, Jonathan Hui, Arsalan Tavakoli.
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.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
TCP/IP Basics A review for firewall configuration.
Internet Command Message Protocol (ICMP) CS-431 Dick Steflik.
Ad Hoc Wireless Routing COS 461: Computer Networks
Lesson 6 Neighbor Discovery.
CMPT 471 Networking II Address Resolution IPv6 Neighbor Discovery 1© Janice Regan, 2012.
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.
Group Management n Introduction n Internet Group Management Protocol (IGMP) n Multicast Listener Discovery (MLD) protocol.
1Group 07 IPv6 2 1.ET/06/ ET/06/ ET/06/ EE/06/ EE/06/ EE/06/6473 Group 07 IPv6.
Network Layer4-1 NAT: Network Address Translation local network (e.g., home network) /24 rest of.
ICMP (Internet Control Message Protocol) Computer Networks By: Saeedeh Zahmatkesh spring.
Chapter 4: Managing LAN Traffic
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Multicast routing.
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
Mobile Routing protocols MANET
Mobile Adhoc Network: Routing Protocol:AODV
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Slide: 1 Neighbor Discovery. Slide: 2 Neighbor Discovery Overview Set of messages and processes that determine relationships between neighboring nodes.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
1 Internet Control Message Protocol (ICMP) Used to send error and control messages. It is a necessary part of the TCP/IP suite. It is above the IP module.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
1 Ad Hoc On-Demand Distance Vector Routing (AODV) Dr. R. B. Patel.
Presentation slides prepared by Ramakrishnan.V LMS: A Router Assisted Scheme for Reliable Multicast Christos Papadopoulos, University of Southern California.
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,
DSR: Introduction Reference: D. B. Johnson, D. A. Maltz, Y.-C. Hu, and J. G. Jetcheva, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,”
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
IETF77 Multimob California1 Proposal for Tuning IGMPv3/MLDv2 Protocol Behavior in Wireless and Mobile networks draft-wu-multimob-igmp-mld-tuning-00 Qin.
Understanding IPv6 Slide: 1 Lesson 12 IPv6 Mobility.
RPL:IPv6 Routing Protocol for Low Power and Lossy Networks Speaker: Chung-Yi Chao Advisor: Dr. Kai-Wei Ke 2015/10/08 1.
Introduction to Mobile IPv6
draft-ietf-roll-p2p-rpl
Neighbor Discovery. IPv6 Terminology Additional subnets Router Host Neighbors Host Intra-subnet router Switch LAN segment Link Subnet Network.
Dynamic Routing Protocols II OSPF
Intro DSR AODV OLSR TRBPF Comp Concl 4/12/03 Jon KolstadAndreas Lundin CS Ad-Hoc Routing in Wireless Mobile Networks DSR AODV OLSR TBRPF.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
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
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Mobile IP 순천향대학교 전산학과 문종식
Fundamentals of Computer Networks ECE 478/578
Doc.: IEEE /0174r1 Submission Hang Liu, et al. March 2005 Slide 1 A Routing Protocol for WLAN Mesh Hang Liu, Jun Li, Saurabh Mathur {hang.liu,
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.
The Direction Field in Routing Metric/Constraint Objects Used in RPL draft-goyal-roll-metrics-direction-00 Mukul Goyal University of Wisconsin Milwaukee.
Mukul Goyal University of Wisconsin Milwaukee
Dynamic Routing Protocols II OSPF
Wireless Sensor Networks 6. WSN Routing
Introduction to Wireless Sensor Networks
ECE 544 Protocol Design Project 2016
ECE 544 Project3 Team member.
Mobile and Wireless Networking
Dynamic Routing Protocols II OSPF
Vidur Nayyar Xueting Wang Weicong Zhao
Viet Nguyen Jianqing Liu Yaqin Tang
ECE 544 Project3 Dheeraj Medikonda Ravi Chandra Godavarthi 1.
Presentation transcript:

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

Functional Overview Origin initiates a temporary DAG. The DIOs carries a Route Discovery Option (RDO)

Functional Overview The DIOs carry the routing metrics and constraints A DIO is discarded if any mandatory constraint is violated. A router lists the best route it knows so far inside the Address vector (inside the RDO) For route diversity, a router SHOULD remember multiple best routes it comes to knows and choose the route to be listed inside DIO randomly. The discovered routes are optimized for use in forward direction or in both directions The discovered routes MUST have bidirectional reachability To allow Discovery Reply Object (DRO) messages to travel back to the origin Bidirectional reachability is not same as optimizing the route in both directions The discovered routes can be hop-by-hop or source routes. Can discover one hop- by-hop route or up to four source routes at a time Can not discover backward hop-by-hop routes The target can use the discovered routes, after reversal, as source routes to reach the origin

Functional Overview When the target receives a DIO and if it “selects” the route in there, it does the following If one or more source routes are being discovered, the target sends the discovered route to the origin in a Discovery Reply Object (DRO) message (inside an RDO). If a hop-by-hop route is being discovered, the target sends a DRO to the origin. The DRO travels towards the origin along the discovered route, establishing state for this route in the routers on the path. The target may store the reverse of a discovered route in memory and use it as a source-route to reach the origin.

Discovery Reply Object (DRO)

Functional Overview The DRO MUST carry an RDO and travel via link-local multicast along the discovered route (listed inside RDO) – Only nodes on the route multicast it. – If the target has discovered all the routes it needs to, it may set the Stop bit inside the DRO. All nodes receiving such DRO do not transmit any more DIOs for this temporary DAG. They will still process any future DROs they receive. – The DROs are susceptible to loss » Cant use link-level acks » No Trickle controlled retransmissions of DROs » Optional end-to-end ack The target may request the origin to acknowledge the receipt of a DRO by sending back a DRO Acknowledgement (DRO- ACK). The origin unicasts a DRO-ACK message to the target. The target resends the DRO if it does not receive the requested DRO-ACK in time.

DRO-Acknowledgement

Trickle Operation For P2P-RPL Need low latency for P2P-RPL route discovery Then, why use Trickle for P2P-RPL DIO transmissions? – Need to avoid redundant DIO transmissions. – Need to protect against loss of DIOs due to wireless communication. Suggested rules for Trickle for P2P-RPL: – The receipt of a DIO, that allows a router to advertise a better route is considered "inconsistent" and hence resets the Trickle timer. The first receipt of a DIO advertising a particular temporary DAG is always considered an inconsistent event under this rule. – The receipt of a DIO, that advertises a better route than the router but does not lead to the router advertising a better route itself, is considered "consistent". – The receipt of a DIO, that advertises as good a route as the router itself, is considered "consistent". – The receipt of a DIO, that advertises a worse route than what the router advertises, is considered neither "consistent" nor "inconsistent", i.e., the receipt of such a DIO has no impact on the Trickle operation. The recommended values of redundancy constant "k" is 1. – This means that a DIO transmission will be suppressed if the router receives even a single "consistent" DIO during a timer interval.

Packet Forwarding Along a P2P Route Use an RH4 header [I-D.ietf-6man-rpl-routing-header] to travel along a P2P source route. include an RPL option [I-D.ietf-6man-rpl-option] inside the IPv6 hop- by-hop options header to travel along a P2P hop- by-hop route. – The origin MUST set the DODAGID of the P2P route as the source IPv6 address of the packet. – The origin MUST specify the RPLInstanceID, associated with the P2P route, inside the RPL option and set the O flag inside the RPL option to 1. – A router receiving this packet will check the O flag inside the RPL option and correctly infer the source IPv6 address of the packet as the DODAGID of the hop-by-hop route to be used for forwarding the packet further.

Significant Simplifications Since Last IETF What routes can be discovered? – one hop-by-hop route or up to 4 source routes from the origin to the target – The routes may be optimized in just forward direction or in both directions – The routes need to have bidirectional reachability – The target may use the reverse of a discovered route as a source route to reach the origin – Cant establish backward hop-by-hop routes No separate propagation and route constraints. – Can use optional constraints if desired. – No need to include a Metric Container inside a Route Discovery Option (RDO) Routing metrics and OF used for route discovery and temporary DAG formation are now same. Specification of rules to operate Trickle for P2P-RPL. Route accumulation in RDO – Rather than in Reverse Routing Header

Significant Simplifications Since Last IETF The temporary DAG is created solely for route discovery and can not be used for routing purposes Discovery Reply Object (DRO) travel via link- local multicast along the reverse of a discovered route. DRO may have a “stop” bit to cancel DIO transmissions once route discovery is over. Introduces optional DRO Acknowledgement.

INRIA’s P2P-RPL Implementation Based on current development version of Contiki (2.x ). Compliant to version 4 of the draft. A minimal application with Contiki, , 6LoWPAN, IPv6, and P2P-RPL needs 47 KiB memory. Experiments have been carried out on a testbed with 15 MSP430-based sensor nodes and an average node degree of 3.8 A video of P2P RPL in action can be found here: