Call for Paper - January 2024 Edition
IJCA solicits original research papers for the January 2024 Edition. Last date of manuscript submission is December 20, 2023. Read More

Highly Dynamic Ad hoc On Demand Distance Vector (HDAODV) Routing Protocol for MANET

Print
PDF
 
Download Full Text
International Journal of Computer Applications
© 2010 by IJCA Journal
Number 2 - Article 2
Year of Publication: 2010
Authors:
K.Vanaja
Dr. R. Umarani
V.Selvi
10.5120/1456-1969

K.Vanaja, Dr. R Umarani and V.Selvi. Article:Highly Dynamic Ad hoc On Demand Distance Vector (HDAODV) Routing Protocol for MANET. International Journal of Computer Applications 10(2):6–10, November 2010. Published By Foundation of Computer Science. BibTeX

@article{key:article,
	author = {K.Vanaja and Dr. R. Umarani and V.Selvi},
	title = {Article:Highly Dynamic Ad hoc On Demand Distance Vector (HDAODV) Routing Protocol for MANET},
	journal = {International Journal of Computer Applications},
	year = {2010},
	volume = {10},
	number = {2},
	pages = {6--10},
	month = {November},
	note = {Published By Foundation of Computer Science}
}

Abstract

Mobile ad hoc network is an emerging trend and it has to face many challenges and issues. Routing in these networks is highly complex due to moving nodes and hence many protocols have been developed. Routing in ad hoc networks is a very challenging issue due to nodes mobility, dynamic topology, frequent link breakage, limitation of nodes (memory, battery, bandwidth, and processing power), and lack of central point like base stations or servers. So by analyzing different ad hoc routing protocols based on the metric throughput, packet delivery ratio, end to end delay which may yield a solution to the challenges in the ad hoc routing in different situations. The performance may vary depending upon the topology, flow patterns, mobility speed of the system.

Topology of mobile ad hoc network is varying from time to time. The basic idea behind this paper is to modify AODV that each node uses routing information provided by the new neighbor nodes to find out and exchanges to better paths and create accumulated routes for later use. Simulated modeling results in Network Simulator(NS2) show that the approach can create more optimal routes and significantly improves the performance using by decreasing average delay time in some cases. This paper highlights the swapping of path information on AODV which is highly dynamic (HDAODV) when there is no link breakage. The performance results put HDAODV is bit better than AODV.

Reference

  • Le Anh Tuan, Yuan Luo “ Exchange Routing information between neighbor nodes to improve AODV performance”, 2009 Sith International Conference on Information Technology: New generations.-IEEE.
  • C. Perkin, Elizabeth M. Royer, S. Das, “Ad hoc on demand Distance Vector Routing”, RFC 3561, July 2003, http://www.ietf.org/rfc/rfc3561.txt
  • S. R. Das, C. E. Perkins, E. M. Royer, and M. K. Marina, “Performance Comparison of Two On- Demand Routing Protocols for Ad Hoc Networks,” in IEEE Personal Communications Magazine special issue on Ad hoc Net-working, February 2001, pp. 16–22.
  • S. Gwalani, E. Royer, Charles E. Perkins, “AODVPA: AODV with Path Accumulation”, Next Generation Internet Symposium, held in conjunction with ICC, Anchorage, Alaska, May 2003.
  • E. Royer and C. K. Toh, “A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks”, in IEEE Personal Communications, April 1999, pp.46–55.
  • E. Royer, Charles E. Perkins, “Evolution and future directions of the ad hoc on-demand distance- vector routing protocol”, Ad Hoc Networks Journal, Vol. 1 No. 1, July 2003, pp. 125–150.
  • C. S. R. Murthy and B. S. Manoj, Ad Hoc Wireless Networks: Architecture and Protocols, ch. Routing Protocols for Ad Hoc Wireless Networks, pp. 299-364. Prentice Hall Communications Engineering and Emerging Technologies Series, New Jersey: Prentice Hall Professional Technical Reference, 2004.