Ad Hoc On-Demand Distance Vector Routing protocol and the effects of flooding mechanism on its performance

Scalability and Performance Analysis of the AODV Protocol in Ad Hoc Networks

Abstract

Throughout the past few years, there have been a significant increase in the number ofwireless communication devices. Since a growing number of users desire to be able to connect with oneanother at any time and from any location, without depending on any centralised access point or currentinfrastructure, this has led to new kinds of technological requirements. An ad hoc network is made up ofnumerous mobile nodes working together to create such a network. Ad hoc networks do not require anyexisting infrastructure because each node serves as both a host and a router. One of the createdprotocols that allows routing with constantly changing topologies is the ad-hoc on demand distancevector routing protocol (AODV). Because AODV is reactive, it only creates routes when those routes areactually required. Although it attempts to increase the overall bandwidth available by limiting the use ofany periodic ads, it uses heavy flooding of messages when determining routes. The effectiveness andprecision of the deployed routing protocols have come under scrutiny due to the growing popularity ofthese on-the-fly networks. This study examines the AODV protocol's scalability and performance in bothsmall and large networks.