Accumulating Path Information in AODV for Ad-Hoc Network

Abstract

An ad-hoc network is the cooperative engagement of collection of mobile nodes without the required intervention of any centralized access point or exiting infrastructure. The need for an efficient routing protocol in mobile ad hoc network is widely proclaimed. A lot of routing protocols have been proposed. They are categorized into three parts according to the way how their routing tables are constructed: Proactive or Table Driven (OLSR, DSDV), Reactive or On-Demand-Driven (DSR, AODV, TORA) and hybrid (ZRP). Ad-Hoc On-Demand Distance Vector Routing (AODV) is one of the most widely researched on-demand ad hoc routing Protocols. In this paper present modified ad-hoc On demand distance vector Routing mechanism (MAODV) for route discovery process of such ad-hoc networks. That mechanism modified route request and route reply packet format of route discovery. By accumulating this information, nodes can learn better amount of routing information to different destinations and reduced number of route discovery. Which are performs effectively in term of routing overhead and delay during high load. The performance of the protocol is evaluated by a simulation model under a variety of network conditions. Evaluation based on comparative study of MAODV with unmodified AODV was done using realistic parameters like Packet received, Average end to end delay, Average jitter, packet drop, Throughput, and energy consumption calculated by varying attributes of Number of Nodes and Pause Time. Implementation and simulations were performed in QualNet 5.0 simulator.