ScholarLens Back to search
2003•Unpublished venueRequires access

Ad hoc On-Demand Distance Vector (AODV) Routing

Colin S. Perkins, Elizabeth M. Belding‐Royer, S. Das

Open publisher page 10,695 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 10695 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Ad hoc On-Demand Distance Vector Routing, Computer science, Distance-vector routing protocol, Destination-Sequenced Distance Vector routing, Computer network, Routing (electronic design automation), Dynamic Source Routing, Routing protocol

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Ad hoc On-Demand Distance Vector (AODV) Routing — Research Paper | ScholarLens