Ad Hoc On Demand Distance Vector (AODV) Routing
Charles E. Perkins
Sun Microsystems
901 San Antonio Rd.
Palo Alto, CA, 94303
USA
mailto: cperkins@eng.sun.com
Homepage :
Internet-Draft
November 1997
Expired: Mai 1998
IETF MANET Working Group
Citeseer:
Paper:
see [
Perkins1999] for conference paper
see [
Perkins2001b] for book-article
see [
Perkins2003] for last version of this draft
see [
RFC3561] for RFC
Abstract
The Ad Hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network characterized by frequent changes in link connectivity to each other caused by relative movement. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and establishment of routes between sources and destination which are loop free at all times. It makes use of destination sequence numbers, which are a novel means of ensuring loop freedom even in the face of anomalous delivery of routing control messages, and which solve classical problems associated with distance vector protocols, including the problem of
counting to infinity.
BibTeX
@TECHREPORT(Perkins1997,
TITLE = {Ad Hoc On-Demand Distance Vector Routing Protocol},
AUTHOR = {Charles E. Perkins},
INSTITUTION = {IETF MANET Working Group},
TYPE = {INTERNET-DRAFT},
HOWPUBLISHED = {Published Online},
MONTH = {November},
YEAR = {1997},
NOTE = {Expiration: Mai 20, 1998},
URL = {http://hegel.ittc.ku.edu/topics/internet/internet-drafts/draft-i/draft-ietf-manet-aodv-00.txt},
FILE = {draft-ietf-manet-aodv-00.txt}
)
