ABSTRACT

Ad hoc wireless networks are infrastructureless, self-organizing networks of mobile computers

operated by humans. The computers have to detect other computers and organize a temporary
infrastructure for a dynamic network - hence the term infrastructureless. The temporary
infrastructure consists of communication links that make use of unguided media like the radio
waves or infrared light. In addition to detecting computers close-by they also have to be able to
communicate indirectly with remote computers not in the vicinity. This can be done by letting
intermediate computers relay information between two communicating peers. Because
computers are mobile, or rather the users are mobile, the current infrastructure has to be known
in order to be able to relay information between computers. The goal of ad hoc networking is to
provide data communication anywhere that two or more computer users roam, directly or
indirectly, as a secluded intranet or as a subnet of the Internet if some computer belonging to the
ad hoc network can serve as a gateway. This text will elaborate on software structures, called
protocols that make it possible to provide ad hoc wireless computing.

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 uni-cast between
sources and destinations. It uses destination sequence numbers to ensure loop freedom at all
times (even in the face of anomalous delivery of routing control messages), solving problems
(such as ``counting to infinity'') associated with classical distance vector protocols.
 CONTENTS
PAGE NO.

1. INTRODUCTION 1

2. OVERVIEW 2

3. AODV TERMINOLOGY 4

4. PATH MAINTAINANCE 5

5. WORKINGS 7

6. CONCLUSION 9

REFERENCES