International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 6, No. 8, 8 Jul. 2014
Cover page and Table of Contents: PDF (size: 379KB)
Optimal Route Based Advanced Algorithm using Hot Link Split Multi-Path Routing Algorithm
Full Text (PDF, 379KB), PP.48-55
Views: 0 Downloads: 0
Author(s)
Index Terms
AODV, MANET, Optimal Path, OPNET, Packet Drop, Route Error, Routing Load
Abstract
Present research work describes advancement in standard routing protocol AODV for mobile ad-hoc networks. Our mechanism sets up multiple optimal paths with the criteria of bandwidth and delay to store multiple optimal paths in the network. At time of link failure, it will switch to next available path. We have used the information that we get in the RREQ packet and also send RREP packet to more than one path, to set up multiple paths, It reduces overhead of local route discovery at the time of link failure and because of this End to End Delay and Drop Ratio decreases. The main feature of our mechanism is its simplicity and improved efficiency. This evaluates through simulations the performance of the AODV routing protocol including our scheme and we compare it with HLSMPRA (Hot Link Split Multi-Path Routing Algorithm) Algorithm. Indeed, our scheme reduces routing load of network, end to end delay, packet drop ratio, and route error sent. The simulations have been performed using network simulator OPNET. The network simulator OPNET is discrete event simulation software for network simulations which means it simulates events not only sending and receiving packets but also forwarding and dropping packets. This modified algorithm has improved efficiency, with more reliability than Previous Algorithm.
Cite This Paper
Akhilesh A. Waoo, Sanjay Sharma, Manjhari Jain, "Optimal Route Based Advanced Algorithm using Hot Link Split Multi-Path Routing Algorithm", International Journal of Computer Network and Information Security(IJCNIS), vol.6, no.8, pp.48-55, 2014. DOI:10.5815/ijcnis.2014.08.07
Reference
[1]Charles E. Perkins, Elizabeth M. Belding-Royer, “Evolution and future directions of the ad hocon-demand distance-vector routing protocol in Ad Hoc Networks”, 1 (2003) 125–150.
[2]Srinivas Sethi, Siba K.Udgata, “The Efficient Ant Routing Protocol for MANET”, IJCSE, 2414-2420, 07, 2010.
[3]V. Zangeneh, S. Mohammadi, “New Multipath Node-Disjoint Routing Based on AODV Protocol”, World Academy of Science Engineering and Technology 76 2011.
[4]Humaira Nishat, Vamsi Krishna, Shakeel Ahmed, Dr. D. Srinivasa Rao, “Performance Evaluation of On Demand Routing Protocols AODV and Modified AODV (R-AODV) in MANETS”, International Journal of Distributed and Parallel Systems (IJDPS) January 2011.
[5]Amit Shrivastava, Aravinth Raj Shanmogavel, Avinash Mistry Nitin Chander, Prashanth Patlolla, Vivek Yadlapalli, “Overview of Routing Protocols in MANET’s and Enhancements in Reactive Protocols”, 2005.
[6]C. Perkins, S. Das, E. Belding-Royer, “AODV Routing”, IETF Network Working Group in RFC 3561 July 2003.
[7]Vahide Babaiyan, Manijeh Keshtgary, “Performance Evaluation of Reactive, Proactive and Hybrid Routing Protocols in MANET”, IJCSE, February 2012 ISSN: 0975-3397.
[8]OPNET Tutorial Written by Andrew Kim, 7 March 2003
[9]Sujata Agrawal, Dr. M. B. Daigavane, Dr. K.D.Kulat. Performance Evaluation of Routing Protocols for Wireless Ad hoc Network, ISSN: 0976-3945.
[10]Dr. Scott F. Midkiff, Chair, Dr. Luiz A. DaSilva, Dr. Nathaniel J. Davis, IV Dr. Ira Jacobs Dr. Charles P. Koelling, “Mobile Ad-hoc Network Routing Protocols: Methodologies and Applications”, 2005.
[11]Xiaoyan Hong, Mario Gerla, Kaixin Xu, “Scalable Routing Protocols for Mobile Ad Hoc Networks”, Computer Science Department, University of California, Los Angeles, August 2002.
[12]G. Vijaya Kumar, M. Nagendra, Y. Vasudeva Reddyr, “Current Research Work on Routing Protocols for MANET: A Literature Survey”, IJCSE (International Journal on Computer Science and Engineering), Vol. 02, No. 03, 2010, 706-713 ISSN: 0975-3397.
[13]Zhang Jimeng, Zhao Dandan, “A New Routing Algorithm Based on Key nodes”, Proceedings of the 30th Chinese Control Conference July 22-24, 2011, Yantai, China.
[14]Elizabeth M. Belding-Royer, Charles E. Perkins. Evolution and future directions of the ad hocon-demand distance-vector routing protocol. Ad Hoc Networks 1 (2003) 125–150.
[15]Vijayalakshmi , Dr.V.Saravanan, Dr. P. Ranjit Jeba Thangiah , Abraham Dinakaran “Energy-Aware Performance Metric for AODV and DSDV Routing Protocols in Mobile Ad-Hoc Networks” IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 4, No 1, July 2011 ISSN (Online): 1694-0814 www.IJCSI.org.
[16]P Sreedhar Reddy “Implementation of Wi Fi Re PHY Sectorization in OPNET”.
[17]Dhirendra Kumar Sharma, Sanjay Kumar Biswash, Chiranjeev Kumar “Enhancement of Split Multipath Routing Protocol in MANET” Dhirendra Kumar Sharma et. al. / (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 03, 2010, 679-685.
[18]Gulhane S.P., Joshi A.A. And Chavan K.L. “Optimized AODV Routing Protocol for Vehicular Ad Hoc Networks” International Journal of Networking ISSN: 2249-278X & E-ISSN: 2249-2798, Volume 2, Issue 1, 2012, pp.-55-59.
[19]Awadhesh Kumar, Prabhat Singh, Vinay Kumar, Neeraj Tyagi, “Performance Analysis of AODV, CBRP, DSDV and DSR MANET Routing Protocol using NS2 Simulation”, International Journal of Computer Network and Information Security(IJCNIS), ISSN: 2074-9090 (Print), ISSN: 2074-9104 (Online), PP.45-50 DOI: 10.5815/ijcnis.2013.09.06, Vol. 5, No. 9, July 2013.
[20]Sujatha. P. Terdal, V. D. Mytri, A. Damodaram, “A Link Quality Based Dispersity Routing Algorithm for Mobile Ad Hoc Networks”, IJCNIS , Publisher: MECS, ISSN: 2074-9104, PP.20-28, Vol.4, No.9, August 2012.
[21]S. Iyer, S. Bhattacharyya, N. Taft, N. McKeoen, C. Diot, “A measurement Based Study of Load Balancing in an IP
[22]Backbone”, Sprint ATL Technical Report, TR02-ATL-051027, May 2002.
[23]Chenbo Li. A shortest path algorithm based on Dijkstra J. Harbin University of Science and Technology Journal 1 (13): 36-38 2008.
[24]S Nelakuditi, Zhang Z-L. On selection of candidate paths for proportional routing. Computer Networks, 44: 79-102, 2004.
[25]N Lefebvre, M Ballmer. Fast shortest path computation in time—dependent traffic networks, proceeding of The 6th Swiss Transport Research Conference, Ascona, and September 2007.
[26]R. Krishnan and J.A. Silvester. Choice of allocation in Multipath source routing schemes. In IEEEINFOCOM ’99, volume 1, pages 322–329, IEEE, 1993.
[27]R. Rom, I. Cidon, and Y. Shavitt. Analysis of multi-path routing. IEEE/ACM Transactions on Networking, 7 (6): 885–896(1999).
[28]L. Wang et al.. Multi-path source routing in wireless ad hoc networks. In Canadian Conf. Elec. Comp. Eng., volume 1, pages 479-483, 2000.