CFP last date
20 June 2024
Reseach Article

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

by Tripti Pandey, Sangeeta Solanki, Ramnesh Dubey
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

@article{ 10.5120/17266-7640,
author = { Tripti Pandey, Sangeeta Solanki, Ramnesh Dubey },
title = { Improved Performance of AODV Routing Protocol with Increasing Number of Nodes using Traveling Salesman Problem },
journal = { International Journal of Computer Applications },
issue_date = { July 2014 },
volume = { 98 },
number = { 16 },
month = { July },
year = { 2014 },
issn = { 0975-8887 },
pages = { 10-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume98/number16/17266-7640/ },
doi = { 10.5120/17266-7640 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:26:21.224057+05:30
%A Tripti Pandey
%A Sangeeta Solanki
%A Ramnesh Dubey
%T Improved Performance of AODV Routing Protocol with Increasing Number of Nodes using Traveling Salesman Problem
%J International Journal of Computer Applications
%@ 0975-8887
%V 98
%N 16
%P 10-13
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
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).

References
  1. Rajesh kumar Yadav, Deepak panwar "Optimal and Robust Framework for Enhancing Network Lifetime using Power Efficient AODV in Mobile Ad hoc Network" Amity University Rajasthan , Jaipur Computer Science & Engineering.
  2. Hadi Sargolzaey, Ayyoub Akbari Comparison of Reliable unicast routing protocols for mobile ad hoc networks 2009.
  3. Yu-Chee Tseng, Wen-Hua Liao, Shih-Lin Wu, "Mobile Ad Hoc Networks and Routing Protocols", Handbook of Wireless Networks and Mobile Computing, Edited by Ivan Stojmenovic´ Copyright ©2002 John Wiley & Sons, Inc. ISBNs: 0-471- 41902-8 (Paper); 0-471- 22456-1 (Electronic).
  4. Srdjan Krco and Marina Dupcinov, "Improved Neighbor Detection Algorithm for AODV Routing Protocol", IEEE Communications Letters, vol. 7, No. 12, December 2003.
  5. Mahesh M Karina and Samir R. Das. "Ad hoc On demand multipath distance vector routing",IEEE 2001.
  6. A Fault Tolerant Multipath Routing Protocol to Reduce Route Failures in Mobile Ad Hoc Networks. G. Rajkumar, K. Duraisamy.
  7. A Mechanism For Booster Approach In Mobile Ad Hoc Networks, Ahmad Anzar, Hussain shanawaz, Dr. S. C Gupta.
  8. Elizabeth M. Royer "A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks", University of California.
  9. Fahim Maan, Nauman Mazhar National University of Sciences and Technology (NUST), MANET Routing Protocols vs Mobility Models: A Performance Evaluation.
  10. C. E. Perkins, E. M. Belding-Royer, and S. R. Das, "Ad hoc On-Demand Distance Vector (AODV) routing," Internet Engineering Task Force (IETF) draft, November 2002. Available at http://www. ietf. org/internet-drafts/draft-ietf-manet-aodv-12. txt.
  11. Vincent D. Park and M Scott Corson, Temporally Ordered Routing Algorithm (TORA) version 1:Functional specification , Internet draft, draft ietf manettoraspec-01 . txt August 1998.
  12. V. D Park and M. S. Corson A Highly Adaptive distributed routing algorithm for mobile wireless networks april 1997.
  13. C. -K. Toh, Georgia Institute of Technology Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks.
  14. Morteza Maleki, Karthik Dantu, and Massoud Pedram Dept. of EE-Systems, University of Southern California, Los Angeles, Power-aware Source Routing Protocol for Mobile Ad Hoc Networks.
  15. E. M. Royer and Charles E. Perkins multicast operations of the ad hoc on demand distance vector routing algorithm University of California Santa Barbara.
  16. Rohit Dube, Cynthia D. Rais Kuang stability-based adaptive Routing (SSA) for mobile ad hoc networks IEEE Personal Communication.
  17. S. S. Tyagi, R. K. Chauhan Performance Analysis of Proactive and Reactive Routing Protocols for Ad hoc Networks.
  18. Simmi Jain, Prof. Hitesh Gupta, Prof. Mukesh Kumar Baghel Survey on MANET Routing Protocol and proposed Multipath Extension in AODV.
Index Terms

Computer Science
Information Sciences

Keywords

MANET AODV and ns-2