CFP last date
22 April 2024
Reseach Article

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

by K.Vanaja, Dr. R. Umarani, V.Selvi
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 10 - Number 2
Year of Publication: 2010
Authors: K.Vanaja, Dr. R. Umarani, V.Selvi
10.5120/1456-1969

K.Vanaja, Dr. R. Umarani, V.Selvi . Article:Highly Dynamic Ad hoc On Demand Distance Vector (HDAODV) Routing Protocol for MANET. International Journal of Computer Applications. 10, 2 ( November 2010), 6-10. DOI=10.5120/1456-1969

@article{ 10.5120/1456-1969,
author = { K.Vanaja, Dr. R. Umarani, V.Selvi },
title = { Article:Highly Dynamic Ad hoc On Demand Distance Vector (HDAODV) Routing Protocol for MANET },
journal = { International Journal of Computer Applications },
issue_date = { November 2010 },
volume = { 10 },
number = { 2 },
month = { November },
year = { 2010 },
issn = { 0975-8887 },
pages = { 6-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume10/number2/1456-1969/ },
doi = { 10.5120/1456-1969 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:58:43.132987+05:30
%A K.Vanaja
%A Dr. R. Umarani
%A V.Selvi
%T Article:Highly Dynamic Ad hoc On Demand Distance Vector (HDAODV) Routing Protocol for MANET
%J International Journal of Computer Applications
%@ 0975-8887
%V 10
%N 2
%P 6-10
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
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.

References
  1. 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.
  2. 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
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
Index Terms

Computer Science
Information Sciences

Keywords

Node mobility dynamic topology frequent link breakage throughput packet delivery ratio end to end delay