Mobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV
Requires Subscription PDF

Keywords

Mobile adhoc network, routing overhead, route discovery, mobility aware routing, routing protocols, DSDV, DSR, AODV, MADA-AODV

Abstract

Problem statement: In this study, we proposed a method to improve the performance of AODV by reducing overhead by adopting a route message propagation mechanism. According to the new scheme, a node will be selected to forward a routing request message if and only if a condition based on its mobility (speed) and number of neighbors is satisfied. If the routing request is allowed to propagate through a node then there will be at least a possible path which includes that node in its path list. So, at the end of the route resolving process, the destination will have a possible path through that node. If the routing request is disallowed to propagate through a node then there will not be a possible path which includes that node in its path list. So, at the end of the route resolving process, the destination will not have a possible path through that node. We implemented the idea on network simulator (ns2) and measured the improvement in performance. Mobility and node density are the two major factors which has much influence on the performance of any routing protocol of mobile adhoc network. Several previous works highlighted this fact. In this study, we will improve the performance of AODV by adding mobility and density aware behaviors in route resolving process.

Requires Subscription PDF