Ad Hoc On Demand Distance Vector (AODV) Routing
Charles E. Perkins
Nokia Research Center
Communications Systems Laboratory
313 Fairchild Drive
Mountain View, CA 94303, USA
charliep@iprg.nokia.com
Elizabeth M. Belding-Royer
University of California, Santa Barbara
Department of Computer Science
Santa Barbara, CA 93106, USA
ebelding@cs.ucsb.edu
Samir R. Das
University of Cincinnati
Internet-Draft
February 2003
Expired: August 2003
IETF MANET Working Group
Citeseer:
Paper:
see [
Perkins1997] for first version of this draft
see [
Perkins1999] for conference paper
see [
Perkins2001b] for book-article
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. 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(Perkins2003,
TITLE = {Ad Hoc On-Demand Distance Vector Routing Protocol},
AUTHOR = {Charles E. Perkins and Elizabeth M. Belding-Royer and Samir R. Das},
INSTITUTION = {IETF MANET Working Group},
TYPE = {INTERNET-DRAFT},
HOWPUBLISHED = {Published Online},
MONTH = {February 2003},
YEAR = {2003},
NOTE = {Expiration: August 17, 2003},
URL = {http://www.ietf.org/internet-drafts/draft-ietf-manet-aodv-13.txt},
FILE = {draft-ietf-manet-aodv-13.txt}
)
