CFP last date
22 April 2024
Reseach Article

On Demand Local Link Repair Algorithm for AODV Protocol

by Jyoti Jain, Roopam Gupta, T.K. Bandhopadhyay
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 35 - Number 5
Year of Publication: 2011
Authors: Jyoti Jain, Roopam Gupta, T.K. Bandhopadhyay
10.5120/4397-6105

Jyoti Jain, Roopam Gupta, T.K. Bandhopadhyay . On Demand Local Link Repair Algorithm for AODV Protocol. International Journal of Computer Applications. 35, 5 ( December 2011), 20-25. DOI=10.5120/4397-6105

@article{ 10.5120/4397-6105,
author = { Jyoti Jain, Roopam Gupta, T.K. Bandhopadhyay },
title = { On Demand Local Link Repair Algorithm for AODV Protocol },
journal = { International Journal of Computer Applications },
issue_date = { December 2011 },
volume = { 35 },
number = { 5 },
month = { December },
year = { 2011 },
issn = { 0975-8887 },
pages = { 20-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume35/number5/4397-6105/ },
doi = { 10.5120/4397-6105 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:21:12.697304+05:30
%A Jyoti Jain
%A Roopam Gupta
%A T.K. Bandhopadhyay
%T On Demand Local Link Repair Algorithm for AODV Protocol
%J International Journal of Computer Applications
%@ 0975-8887
%V 35
%N 5
%P 20-25
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

MANET (Mobile Ad hoc Network) is a wireless self-organized distributed network. This paper gives a general survey of research on local repair of link, if it is broken during communication for MANET and proposes a new local repair scheme in order to make up the deficiency of the existing local repair schemes. The improved local repair scheme concerns about the over head requirement and end to end delay in transmission. Nodes are required to keep the next two-hop node address for each route entry in routing table. During local repair, the repairing node use Ant algorithm for finding new route for next to next node in the link considering that other part of the link is already in existence. Reduced size of F-ANT and B-ANT will give significant reduction in overhead. In this case repairing node not only tries to discover the route to the destination node of data packet, but also attempts to establish the route to its downstream node (i.e. the next hop node). The proposed algorithm will be highly adaptive, scalable and efficient and mainly reduces end-to-end delay in high mobility cases.

References
  1. Er J.-N. LIU and Imrich Chlamtac “Mobile ad hoc networking with a view of 4G wireless: Imperatives and Challenges”
  2. C. S. R. Murthy and B. Manoj ”Ad Hoc Wireless Networks: Architectures and Protocols”, Prentice Hall PTR, May 2004.
  3. Elizabeth.M.Royer, C-K Toh,” A Review of Current Routing Protocols for Ad-hoc Mobile Wireless networks”,IEEE personal communication,pp.46-55,April 1999.
  4. C. E. Perkins, E. M. Royer, and S. R. Das, “Ad hoc on-demand distance vector routing,” IETF RFC 3561, July 2003.
  5. Srdjan Krco and Marina Dupcinov, “Improved Neighbor Detection Algorithm for AODV Routing Protocol” IEEE Communications letters, Vol. 7, No. 12, December 2003
  6. Ionut D. Aron and Sandeep K.S. Gupta, “Analytical Comparison of local and End-toEnd Error Recovery in Reactive Routing Protocols for Mobile Ad Hoc Networks,” Proceedings of the 3rd ACM Int. Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM 2000) pp. 69-76, August 2000.
  7. Sergio Crisstomo , Susana Sargento, edro Brandgo’, Rui Prior’ “Improving AODV with Preemptive Local Route Repair” International Workshop on Wireless Ad-Hoc Networks 2004
  8. XIAO Bai-Long, GUO Wei, LIU Jun, ZHU Si-Lu, “An Improvement for Local Route Repair in Mobile Ad Hoc Networks,” 6th International Conference on ITS Telecommunications Proceedings 2006.
  9. Ammar Zahary and Aladdin Ayesh , “On-demand Multiple Route Maintenance in AODV Extensions (ORMAD)” IEEE page 225-230, 2008.
  10. Nadilma Cintra Valença Nunes Pereira and Renato Mariz de Moraes , “ A Comparative Analysis of AODV Route Recovery Mechanisms in Wireless Ad Hoc Networks” IEEE transaction 2009
  11. Saaidal R. Azzuhri, Marius Portmann, Wee Lum Tan, “Evaluation of Parameterised Route Repair in AODV” IEEE 2010.
  12. S. H. Shah and K. Nahrsledt.. “Predictive location-based QoS routing in mobile ad hoc networks,” in in Pruc. of IEEE Infernarional Conferenceon Comniunicarions (ICC 20021, New York, NZ April - May 2002
  13. Fei Jiang, JianJun Hao, “Simulation of An Improved AODV Algorithm for Ad Hoc Network” vol1 IEEE conference ICACT 2010 ,
  14. M.Dorigo, LM. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem”, IEEE Transactions on Evolutionary Computation, Vol.1, No.1, pp.53-66,1997.
  15. Ruud Schoonderwoerd, Owen Holland, Janet Bruten, and L.Rothkrantz, "Ant-Based Load Balancing In Telecommunications Networks," Adaptive Behavior, 1996.
  16. G.Di Caro and M.Dorigo, "AntNet: distributed stigmergetic control for communications networks," Journal of Artificial Intelligence Research, vol. 9, pp. 317-365, 1998.
  17. M.Heissenbuttle and T.Braun, "Ants-Based Routing in Large Scale Mobile Ad-Hoc Networks," Kommunikation in Verteilten Systemen (KiVS), 2003.
  18. Mesut Gunes,Udo Sorges, Imed Bouazizi, “ARA-The Ant-Colony Based Routing Algorithm for MANETs” International workshop on Ad HocNetworking (WAHN 2002) couver, British Columbia, Canada, August18-21,2002
  19. Zhenyu Liu; Marta Z. Kwaitkowska; Costas Constantinou “A Biologically Inspired QoS Routing Algorithm for Mobile Ad Hoc Networks”, Proceedings of the 19thInternational Conference on Advanced Information. Networking and Applications(AINA’05), 2005. pp. 426 -431
  20. X. Zheng, W. Guo, and R. Liu. An ant-based distributed routing algorithm for ad-hoc networks. In Proceedings of the International Conference on Communications,Circuits and Systems (ICCCAS), pages 412–417, Washington,DC, 2004. IEEE.
  21. M. T. Islam, P. Thulasiraman, and R. K. Thulasiram, “A parallel ant colony optimization algorithm for all-pair routing in MANETs,” in Proceedings of the International Symposium on Parallel and Distributed Processing (IPDPS 2003), Nice, France, April 2003.
  22. Gianni Di Caro and Gianni Di Caro and Frederick Ducatelle and Frederick Ducatelle and Luca Maria Gambardella and Luca Maria Gambardella, “AntHocNet: An Adaptive Nature-inspired Algorithm for Routing in Mobile Ad hoc Networks”, European Transactions on Telecommunications, vol. 16, pp. 443–455, 2005.
  23. O. Hussein, T. Saadawi, “Ant routing algorithm for mobile ad-hoc networks (ARAMA)”, performance computing, and communications IEEE International conference, pp. 281–290, 2003.
Index Terms

Computer Science
Information Sciences

Keywords

Routing protocol AODV link break Ant colony local repair Ad hoc mobile networking