Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A Control Packet Minimized Routing Protocol for Ad-Hoc Wireless Networks
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
An AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networks
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
| Hi-index | 0.00 |
In this paper we propose and investigate a number of heuristics for enhancements of the performance of Ad hoc On-demand Distance Vector (AODV) routing protocol for mobile ad hoc networks. These include (i) the utilization of location information to localize flooding during a route discovery, (ii) the utilization route caches at intermediate nodes for route discovery, (iii) the scheme for maintaining alternative paths to destination, and (iv) an aggressive local repair scheme for re-establishing a broken route. All the heuristics were implemented along with the latest version of AODV protocol proposal, and simulated using ns-2 simulator. For the purpose of analyzing the performance three different metrics, namely, packet delivery fraction, average delay and routing load, have been employed. Furthermore, in order to get a realistic insight into the effects of the proposed heuristics, the performance metrics have been evaluated in the presence of both low and high packet rate traffics and over three different mobility ranges, viz., high, moderate, and low.