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.

/pdf/ad-hoc-on-demand-distance-vector-aodv-routing-2v7bybe614.pdf

Ad hoc On-Demand Distance Vector (AODV) Routing

Wireless Communications

A 2001 IBM manifesto observed that a looming software complexity crisis -caused by applications and environments that number into the tens of millions of lines of code - threatened to halt progress in computing. The manifesto noted the almost impossible difficulty of managing current and planned computing systems, which require integrating several heterogeneous environments into corporate-wide computing systems that extend into the Internet. Autonomic computing, perhaps the most attractive approach to solving this problem, creates systems that can manage themselves when given high-level objectives from administrators. Systems manage themselves according to an administrator's goals. New components integrate as effortlessly as a new cell establishes itself in the human body. These ideas are not science fiction, but elements of the grand challenge to create self-managing computing systems.

The vision of autonomic computing

"A Survey of Mobility Models for Ad Hoc Network Research," Wireless Comm. & Mobile Computing (WCMC) : Special issue on Mobile Ad Hoc Networking : Research

In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models, and realistic movements of the mobile users (i.e., a mobility model). This paper is a survey of mobility models that are used in the simulations of ad hoc networks. We describe several mobility models that represent mobile nodes whose movements are independent of each other (i.e., entity mobility models) and several mobility models that represent mobile nodes whose movements are dependent on each other (i.e., group mobility models). The goal of this paper is to present a number of mobility models in order to offer researchers more informed choices when they are deciding upon a mobility model to use in their performance evaluations. Lastly, we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Specifically, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.

/pdf/a-survey-of-mobility-models-for-ad-hoc-network-research-ygkxat400x.pdf

A survey of mobility models for ad hoc network research

Multicast Ad hoc On-Demand Distance Vector (MAODV) Routing

The Ad hoc On-Demand Distance Vector (AODV) routing protocol is designed for use in ad hoc mobile networks. Because of the difficulty of testing an ad hoc routing protocol in a real-world environment, a simulation was first created so that the protocol design could be tested in a variety of scenarios. Once simulation of the protocol was nearly complete, the simulation was used as the basis for an implementation in the Linux operating system. In the course of converting the simulation into an implementation, certain modifications were needed in AODV and the Linux kernel due to both simplifications made in the simulation of AODV and to incompatibilities of the Linux kernel and the IP-layer to routing in a mobile environment. This paper details many of the changes that were necessary during the development of the implementation.

An implementation study of the AODV routing protocol

The Ad Hoc on-demand distance-vector protocol

As mobile computing gains popularity, the need for ad hoc routing protocols will continue to grow. There have been numerous simulations comparing the performance of these protocols under varying conditions and constraints. One question that arises is whether the choice of MAC protocol affects the relative performance of the routing protocols being studied. This paper investigates the answer to that question by simulating the performance of three ad hoc routing protocols when run over different MAC protocols. It is determined that the choice of MAC layer protocol does, in fact, affect the relative performance of the routing protocols.

The effects of MAC protocols on ad hoc network communication

Routing in Ad hoc Mobile Networks: On-Demand and Hierarchical Strategies by Elizabeth M. Royer Mobile wireless communication is becoming increasingly popular due to recent advances in wireless devices and applications. A desirable capability of portable devices is the ability for communication between them. Collectively, these devices can form an ad hoc network. An ad hoc network is a group of mobile nodes with no xed infrastructure; nodes communicate directly between one another over wireless channels. Because the transmission range of these nodes is limited, a routing protocol is needed to enable communication between them. However, because of the portable nature of these devices and the wireless transmission medium, ad hoc networks have many characteristics that render routing protocols designed for wired networks inapplicable. This dissertation presents the Ad hoc On-Demand Distance Vector Routing (AODV) protocol. AODV is a reactive protocol in that it discovers routes only when they are needed by a source node. It provides unicast, multicast, and broadcast communication capability and is able to maintain routes even when the topology of the network is dynamic. AODV is well-suited for mobile wireless networks in that it has low processing and memory overhead, and low network utilization. Additionally, AODV provides loop freedom for all routes through the use of sequence numbers. To improve the scaling potential of AODV, as well as that of many other reactive routing protocols, a set of hierarchical routing protocols has been developed. Hierarchical routing records routes logically across hierarchical levels, rather than across physical links. Hierarchical links tend to be longer-lived, and so these routes are more robust to node movement. This dissertation presents the Adaptive Routing using Clusters (ARC) protocol, as well as the Adaptive Routing using Cluster Hierarchies (ARCH) protocol. The former creates a one-level cluster structure across the network, while the latter can adjust dynamically the depth of the routing hierarchy in response to the network topology. The performance of a protocol is not based solely upon its design. There are many other factors that contribute to the overall performance of the protocol. These factors include the density of the network, the MAC layer protocol selected, and the number of nodes in the network. Studies of these interactions are presented to determine their e ect in ad hoc mobile networks. ix

E.M. Royer

Papers

Multicast Ad hoc On-Demand Distance Vector (MAODV) Routing

An implementation study of the AODV routing protocol

The Ad Hoc on-demand distance-vector protocol

The effects of MAC protocols on ad hoc network communication

Routing in ad hoc mobile networks: on-demand and hierarchical strategies