Abstrait

On The Performance Analysis of AODV Protocol in Mobile Ad-Hoc Network

Mitali Sinha , Mira Rani Debbarma, Sangita Rani Bhowmik, Trina Sil, Jhunu Debbarma

Recent advances in portable computing and wireless technologies are opening up exciting possibilities for the future of wireless mobile networking. A Mobile Ad-hoc NETwork (MANET) consists of mobile platforms which are free to move arbitrarily. This is in contrast with the topology of the existing Internet, where the router topology is essentially static. In MANET, the nodes are mobile and inter-node connectivity may change frequently during normal operation. In this work, we present an analysis of Ad-Hoc On-Demand Distance vector Routing (AODV) protocol and evaluate the performance of the protocol. AODV is a reactive protocol as it reacts to change and maintain the active routes in the caches or tables for a pre-specified expiration time. Distance vector means a set of distant nodes, which defines the path to destination. AODV can be considered as a descendent of DSR and DSDV algorithms. It uses the same route discovery mechanism used by DSR. AODV attempts to improve on DSR by maintaining routing tables at the nodes, so that data packets do not have to contain routes. Numerous simulations of routing protocols have been made using different simulators. Simulators though cannot take into account of all the factors that can come up in real life and performance and connectivity of mobile Ad-hoc network depend and are limited also by such factors. In our project work, we have analyzed the behavior of AODV protocol with various parameters like pdf, end-to-end delay, throughput, normalized routing load (NRL).