International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 98 - Number 16 |
Year of Publication: 2014 |
Authors: Tripti Pandey, Sangeeta Solanki, Ramnesh Dubey |
10.5120/17266-7640 |
Tripti Pandey, Sangeeta Solanki, Ramnesh Dubey . Improved Performance of AODV Routing Protocol with Increasing Number of Nodes using Traveling Salesman Problem. International Journal of Computer Applications. 98, 16 ( July 2014), 10-13. DOI=10.5120/17266-7640
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).