Ad hoc On-Demand Distance Vector (AODV) Routing
draft-perkins-manet-aodvbis-01

Document Type Expired Internet-Draft (individual)
Author Charles Perkins 
Last updated 2004-02-12
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-perkins-manet-aodvbis-01.txt

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 unicast route determination 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.

Authors

Charles Perkins (charliep@computer.org)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)