Ad hoc On-Demand Distance Vector Routing
RFC 3561, “Ad hoc On-Demand Distance Vector Routing”, is an Experimental document published in July 2003 by C. Perkins, E. Belding-Royer, S. Das. The canonical text is published by the RFC Editor.
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. This memo defines an Experimental Protocol for the Internet community.
What “Experimental” means
Describes a specification that is part of a research or development effort, published so the community can gain experience with it.
The canonical text of RFC 3561 is hosted at rfc-editor.org. Available in TXT,HTML.
- RFC 3560 Use of the RSAES-OAEP Key Transport Algorithm in Cryptographic Message Syntax
- RFC 3562 Key Management Considerations for the TCP MD5 Signature Option
- RFC 3559 Multicast Address Allocation MIB
- RFC 3563 Cooperative Agreement Between the ISOC/IETF and ISO/IEC Joint Technical Committee 1/Sub Committee 6 on IS-IS Routing Protocol Development
- RFC 3558 RTP Payload Format for Enhanced Variable Rate Codecs and Selectable Mode Vocoders
- RFC 3564 Requirements for Support of Differentiated Services-aware MPLS Traffic Engineering
- RFC 3557 RTP Payload Format for European Telecommunications Standards Institute European Standard ES 201 108 Distributed Speech Recognition Encoding
- RFC 3565 Use of the Advanced Encryption Standard Encryption Algorithm in Cryptographic Message Syntax