A proposed solution for looping in ad hoc on demand distance vector (AODV) routing protocol.

摘要

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that are capable of communicating with each other without the use of any network infrastructure or any centralized communication. Communication in a MANET poses special challenges because the network is infrastructureless and topologically dynamic.; Numerous routing protocols have been proposed for MANET, but none of the routing protocols seem to satisfy the wide diversity of wireless networks. Ad-hoc On-Demand Distance Vector (AODV) is a protocol that takes care of many issues in establishing and maintaining a route between a source and destination when required. The AODV is an on-demand routing protocol used in mobile ad hoc networks and is capable of both unicast and multicast routing. Although AODV is one of the most popular routing protocols used in ad hoc networks, there are a number of disadvantages associated with it. Some of the disadvantages include wasting of bandwidth, loss of shortest path and lengthy route reestablishment. This thesis is proposing an algorithm to improve the performance of the AODV route recovery.; The implementation of the proposed algorithm was also explained. OPNET modeler 10.5 was used for simulation and verification purposes. Four different test scenarios are developed and tested. Simulation tests mainly focus on the performance comparison between original AODV and proposed algorithm. In the majority of the cases, the proposed algorithm was shown to work better than the original AODV algorithm.