{"draft":"draft-ietf-manet-aodv-13","doc_id":"RFC3561","title":" Ad hoc On-Demand Distance Vector (AODV) Routing ","authors":["C. Perkins","E. Belding-Royer","S. Das"],"format":["ASCII","HTML"],"page_count":"37","pub_status":"EXPERIMENTAL","status":"EXPERIMENTAL","source":"Mobile Ad-hoc Networks","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.  ","pub_date":"June 2003","keywords":["AODV","Ad hoc On-Demand Distance Vector","unicast","multiple nodes"],"obsoletes":[],"obsoleted_by":[],"updates":[],"updated_by":[],"see_also":[],"doi":"10.17487\/RFC3561","errata_url":"https:\/\/www.rfc-editor.org\/errata\/rfc3561"}