Ad hoc On-Demand Distance Vector (AODV) Routing
Charles E. Perkins
Communications Systems Laboratory
Nokia Research Center
313 Fairchild Drive
Mountain View, CA 94303
USA
EMail: Charles.Perkins@nokia.com
Elizabeth M. Belding-Royer
Department of Computer Science
University of California, Santa Barbara
Santa Barbara, CA 93106
EMail: ebelding@cs.ucsb.edu
Samir R. Das
Department of Electrical and Computer Engineering & Computer Science
University of Cincinnati
Cincinnati, OH 45221-0030
EMail: sdas@ececs.uc.edu
RFC
Expermimental
July 2003
IETF MANET Working Group
Paper:
see [
Perkins1997] for original internet-draft
see [
Perkins1999] for conference paper
see [
Perkins2001b] for book-article
see [
Perkins2003] for last version of the internet-draft
Abstract
The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. It uses destination sequence numbers to ensure loop freedom at all times (even in the face of anomalous delivery of routing control messages), avoiding problems (such as "counting to infinity") associated with classical distance vector protocols.
BibTeX
@TECHREPORT(RFC3561,
TITLE = {Ad hoc On-Demand Distance Vector (AODV) Routing},
AUTHOR = {Charles E. Perkins and Elizabeth M. Belding-Royer and Samir R. Das},
TYPE = {RFC Experimental},
NUMBER = {3561},
INSTITUTION = {Internet Engineering Task Force},
HOWPUBLISHED = {Published Online},
MONTH = {July},
YEAR = {2003},
URL = {http://rfc.net/rfc3561.txt},
FILE = {rfc3561.txt}
)
