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,

Slides:



Advertisements
Similar presentations
1 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks By Lei Chen.
Advertisements

AODV update Charles E. Perkins Elizabeth M. Royer Samir R. Das.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
Nov.6, 2002 Secure Routing Protocol for Ad Hoc Networks Li Xiaoqi.
Revisiting On Demand Routing On Demand Routing schemes are reactive – a route is found when needed. This precludes the periodic exchange of routing tables.
1 Routing in Mobile Ad Hoc Networks most slides taken with permission from presentation of Nitin H. Vaidya University of Illinois at Urbana-Champaign.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Adaptive backup routing for ad-hoc networks Adviser: Ho-Ting Wu Speaker: Zen-De Liu Date:05/14/2007.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Centre for Wireless Communications Ad hoc On-demand Distance Vector Routing Protocol The presentation is based on a paper: C.E. Perkins, E.M. Royer, “Ad.
Routing Security in Ad Hoc Networks
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.
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks Ranveer Chandra (joint work with Venugopalan Ramasubramanian and Ken Birman)
A Review of Current Routing Potocols for Ad-Hoc Mobile Wireless Networks Yibo Sun
Ad-hoc On-Demand Distance Vector Routing (AODV) Sirisha R. Medidi.
Overview of AODV protocol SNAP Presentation 9/7/2007 Jaein Jeong and Jorge Ortiz.
Aodv. Distance vector routing Belman principle AODV - overview Similar to DSR –On demand –Route request when needed and route reply when a node knows.
Multicasting Multicasting is the process by which data is set to multiple recipients. Simplest but a very inefficient way is to initiate multiple unicast.
8/7/2015 Mobile Ad hoc Networks COE 549 Routing Protocols II Tarek Sheltami KFUPM CCSE COE 1.
Ad Hoc Wireless Routing COS 461: Computer Networks
Routing Two papers: Location-Aided Routing (LAR) in mobile ad hoc networks (2000) Ad-hoc On-Demand Distance Vector Routing (1999)
Distance Vector Routing Protocols W.lilakiatsakun.
Dsr – dynamics source routing. basics Two types of routing –On-demand / reactive Information is only collected when required, I.e., when a packet needs.
CBRP: A Cluster-based Routing Protocol for Mobile Ad hoc Networks Authors : Mingliang Jiang Jinyang Li Y.C. Tay Presented by: Hiren Shah.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Mobile Routing protocols MANET
Mobile Adhoc Network: Routing Protocol:AODV
Ad hoc On-demand Distance Vector (AODV) Routing Protocol ECE 695 Spring 2006.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Ad Hoc Routing: The AODV and DSR Protocols Jonathan Sevy Geometric and Intelligent Computing Lab Drexel University
RFC 3561 AODV Routing Protocol Mobile Ad Hoc Networking Working Group Charles E. Perkins INTERNET DRAFT Nokia Research Center 19 June 2002 Elizabeth M.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Ad Hoc Routing: The AODV and DSR Protocols Speaker : Wilson Lai “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks”, C. Perkins.
1 Ad Hoc On-Demand Distance Vector Routing (AODV) Dr. R. B. Patel.
Doc.: IEEE /1047r0 Submission Month 2000August 2004 Avinash Joshi, Vann Hasty, Michael Bahr.Slide 1 Routing Protocols for MANET Avinash Joshi,
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,”
Traditional Routing A routing protocol sets up a routing table in routers A node makes a local choice depending on global topology.
Ad-hoc On Demand Distance Vector Protocol Hassan Gobjuka.
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 Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
Remote Deployment of Sensor Networks Presentation 3: Providing connectivity between sensor nodes and uplinks.
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
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
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,
Jim Parker CMSC691t Spring 2000 “Ad-hoc On-Demand Distance Vector Routing” A dynamic routing algorithm for mobile ad-hoc networks.
Doc.: IEEE /0174r2 Submission Hang Liu, et al. March 2005 Slide 1 A Routing Protocol for WLAN Mesh Date: Authors: Notice: This document.
A Cluster-based Routing Protocol for Mobile Ad hoc Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
The Ad Hoc On-Demand Distance-Vector Protocol (AODV)
Routing design goals, challenges,
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
By Ioannis Chatzigiannakis, Elena Kaltsa, Sotiris Nikoletseas
Internet Networking recitation #4
A comparison of Ad-Hoc Routing Protocols
CBRP: A Cluster-based Routing Protocol for Mobile Ad hoc Networks
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Mobile and Wireless Networking
by Saltanat Mashirova & Afshin Mahini
A Hybrid Mesh Routing Protocol
Routing.
Vinay Singh Graduate school of Software Dongseo University
A Routing Protocol for WLAN Mesh
Routing protocols in Mobile Ad Hoc Network
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

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, 2001. (draft-ietf-manet-aodv-08.doc)

Introduction Ad Hoc On-Demand Distance Vector Allows mobile nodes to respond quickly to link breakages and changes in network topology When links break, AODV causes the affected set of nodes to be notified so that they are able to invalidate the routes using the broken link Use of a destination sequence number Created by the destination for any route information it sends to requesting nodes Given the choice between two routes to a destination, a requesting node always selects the one with the greatest sequence number

Overview of AODV Three message types Route Request (RREQ) When a route to a new destination is needed, the node uses a broadcast RREQ to find a route to the destination A route can be determined when the RREQ reaches either the destination itself, or an intermediate node with a “fresh enough” route to the destination Route Reply (RREP) The route is made available by unicasting a RREP back to the source of the RREQ Since each node receiving the request caches a route back to the source of the request, the RREP can be unicast back from the destination to the source

Overview of AODV (cont) Route Error (RERR) Nodes monitor the link status of next hops in active routes When a link break in an active route is detected, a RERR message is used to notify other nodes that the loss of that link has occurred The RERR message indicates which destinations are now unreachable due to the loss of the link Route table entry Destination IP address, Destination Sequence #, Hop Count, Next Hop, List of Precursors, Lifetime, Routing Flags

AODV Operation Maintaining Route Utilization Records The list of precursors that may be forwarding packets on this route These precursors will receive notifications from the node in the event of detection of the loss of the next hop link Each time a route is used to forward a data packet Its lifetime field is updated

AODV Operation (cont) Generating Route Requests A node broadcast a RREQ when it determines that it needs a route to a destination and does not have one available The Destination Sequence Number field in the RREQ message is the last known destination sequence number for this destination After broadcasting a RREQ, a node waits for a RREP If the RREP is not received within NET_TRAVERSAL_TIME ms, the node may rebroadcast the RREQ, up to a maximum RREQ_RETRIES times

AODV Operation (cont) Forwarding Route Requests The intermediate nodes always creates or updates a reverse route to the Source IP Address in its routing table If a route to the Source IP Address already exists, it is updated only if either 1. The Source Sequence Number in the RREQ is higher than the destination sequence number of the Source IP Address in the routing table, or 2. The sequence numbers are equal, but the hop count as specified by the RREQ is now smaller than the existing hop count in the routing table

AODV Operation (cont) If the node does not have an active route, or if the existing destination sequence number is smaller than the Destination Sequence Number field of the RREQ It rebroadcasts the RREQ from its interfaces but using its own IP address in the IP header of the outgoing RREQ The TTL in the outgoing IP header is decreased by one The Hop Count field in the broadcast RREQ message is incremented by one, to account for the new hop through the intermediate node

AODV Operation (cont) Generating Route Replies If a node receives a route request for a destination, and either has a fresh enough route to satisfy the request or is itself the destination, the node generates a RREP message and unicasts it back to the source node As the RREP is forwarded to the source, the Hop Count field is incremented by one at each hop

AODV Operation (cont) Generating Gratuitous RREP When a node receives a RREQ and responds a RREP, it does not forward the RREQ and further If all incarnations of a single RREQ are replied to by intermediate nodes, the destination does not receive any copies of the RREQ. Hence, it does not learn of a route to the source node In order that the destination learn of routes to the source node, the source node should set the gratuitous RREP (‘G’) flag in the RREQ if the session is going to be run over TCP, or for any other reasons Intermediate nodes receiving a RREQ with the ‘G’ flag set and responding a RREP should unicast a gratuitous RREP to the destination node

AODV Operation (cont) Forwarding Route Replies The precursor list for the corresponding destination node is updated by adding to it the next hop node to which the RREP is forwarded Also, at each node the (reverse) route used to forward a RREP has its lifetime changed

AODV Operation (cont) Route Error Messages A node initiates a RERR message in three situations 1. If it detects a link break for the next hop of an active route in its routing table, or 2. If it gets a data packet destined to a node for which it does not have an active route, or 3. If it receives a RERR from a neighbor for one or more active routes

AODV Operation (cont) For cases (1) and (2) For case (3), the node The destination sequence numbers in the routing table for the unreachable destination(s) are incremented by one Then RERR is broadcast with the unreachable destination(s) and their incremented destination sequence number(s) included in the packet For case (3), the node Updates the corresponding destination sequence # and invalidates the route for the destination Broadcast a RERR message to the neighbor nodes in the precursor list of the destination

AODV Operation (cont) Local Repair When a link break in an active route occurs The node upstream of that break may choose to repair the link locally if the destination is no farther than MAX_REPAIR_TTL hops away To repair the link break itself, it increments the sequence number for the destination and then broadcasts a RREQ for that destination 1. Sometimes results in increased path lengths to those destinations 2. Likely to increase the number of data packets which are able to be delivered to the destinations

RREQ Format Type: 1 J: Join flag (reserved for multicast); R: Repair flag (for multicast)

G: Gratuitous RREP flag; indicates whether a gratuitous RREP should be unicast to the node specified in the Destination IP Address field Hop Count: The number of hops from the Source IP Address to the node handling the request Broadcast ID: A sequence number uniquely identifying the particular RREQ when taken in conjunction with the source node's IP address. Destination IP Address: The IP address of destination for which a route is desired. Destination Sequence Number: The last sequence number received in the past by the source for any route towards the destination. Source IP Address: The IP address of the node which originated the Route Request. Source Sequence Number: The current sequence number to be used for route entries pointing to (and generated by) the source of the route request.

RREP Format Lifetime: The time for which nodes receiving the RREP consider the route to be valid.

RERR Format N: No delete flag; set when a node has performed a local repair of a link, and upstream nodes should not delete the route.