Improved Performance of AODV Routing Protocol with Increasing Number of Nodes using Traveling Salesman Problem

Abstract

A mobile ad hoc network is a self-configuring and self organizing infrastructure less network of mobile nodes; these nodes are dynamic in nature and are capable of communicating with each other without the use of a network infrastructure or any centralized administration. With the ease of deployment and the infrastructure less nature of Mobile Ad hoc Networks (MANETs) make them highly popular for the current multimedia communications, so there has been considerable research in routing area. Research shows that Ad Hoc on Demand Distance Vector Routing Protocol (AODV) performs better than any other protocol. Although it performs well but there must be a mechanism to analyze its performance by varying network size. In this paper analyzing the performance of AODV using Travelling Salesman Problem by increasing number of nodes as it is known that routing protocols makes an important task for improving QoS in Mobile Ad hoc Network. The Qos depends upon several parameters like throughput, network load etc. Only throughput parameter has been considered for the simulation. The simulation work has been carried out in Network Simulator (ns-2).

Improving Routing Discovery Based Velocity-Aware Probabilistic Using AODV with Link Prediction in Mobile Ad-hoc Networks

“…From the result, it can be noticed that the proposed scheme resulted in a better throughput value than the old one. This result can help previous studies like Pandey et al (2014) to increase the performance of AODV in different network sizes. This include combining the feature of velocity-aware probabilistic with travelling salesman problem in order to increase number of nodes as it is known that routing protocols makes an important task for improving QoS.…”