Metric Comparison of AODV-PA, DSDV and DSR Routing Protocols

Author : Mohit Yadav and Basant Shah

Abstract

Ad hoc On-Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad hoc networks (MANETs) and other It is a reactive routing protocol, meaning that it establishes a route to a destination only on demand. In contrast, the most common routing protocols of the Internet are proactive, meaning they find routing paths independently of the usage of the paths. AODV is, as the name indicates, a distance-vector routing protocol. AODV avoids the counting- toinfinity problem of other distance-vector protocols by using sequence numbers on route updates, a technique pioneered by DSDV. AODV is capable of both unicast and multicast routing. Previous studies have shown limitations of these protocols in certain network scenarios. To improve the performance of AODV.The advantage of AODV is that it creates no extra traffic for communication along existing links. Also, distance vector routing is simple, and doesn’t require much memory or calculation. However AODV requires more time to establish a connection, and the initial communication to establish a route is heavier than some other approaches.

Keywords: AVODV, MANETs