An Improvement over AODV Routing Protocol by Limiting Visited Hop Count

Full Text (PDF, 410KB), PP.87-93

Views: 0 Downloads: 0

Author(s)

Reza Fotohi 1,* Shahram Jamali 2 Fateme Sarkohaki 1 Shahram Behzad 1

1. Department of Computer Engineering, Germi branch, Islamic Azad University, Germi, Iran

2. Department of Computer Engineering, Mohaghegh Ardabili University, Ardabil, Iran

* Corresponding author.

DOI: https://doi.org/10.5815/ijitcs.2013.09.09

Received: 5 Oct. 2012 / Revised: 17 Feb. 2013 / Accepted: 21 Apr. 2013 / Published: 8 Aug. 2013

Index Terms

AODV, Routing Protocols, Multi-Hop

Abstract

The AODV protocol is based on the minimum delay path as its route selection criteria, regardless of the paths load. This issue leads to unbalanced load dissemination in the network and the energy of the nodes on the shortest path deplete earlier than others. We proposed an improved AODV protocol with limited TTL (Time to Live) of RREP packet in which the route reply (RREP) packet of AODV is modified to limite TTL information of nodes. Experiments have been carried out using network simulator software (NS2). Simulation results show that our proposed routing protocol outperforms regular AODV in terms of packet delivery rate, good put, throughput, and jitter.

Cite This Paper

Reza Fotohi, Shahram Jamali, Fateme Sarkohaki, Shahram Behzad, "An Improvement over AODV Routing Protocol by Limiting Visited Hop Count", International Journal of Information Technology and Computer Science(IJITCS), vol.5, no.9, pp.87-93, 2013. DOI:10.5815/ijitcs.2013.09.09

Reference

[1]Akshatha, P.S., Khurana, N., Rathi, and A.: Optimal Path For Mobile Ad-Hoc Networks Using Reactive Routing Protocol. International Journal of Advances in Engineering & Technology, IJAET (2011) ISSN: 2231-1963.

[2]D. Chakeres and E. M. Belding-Royer. AODV routing protocol implementation design. In Proceedings of the International Workshop on Wireless Ad-hoc Networking (WWAN), pp. 698–703, Tokyo, Japan, March 2004.

[3]E. N. et al. AODV-UU: Ad-hoc On-demand Distance Vector Routing. http://user.it.uu.se/˜henrikl/aodv

[4]NS -2, The ns Manual (formally known as NS Documentation)

[5]E. Perkins, E. M. Royer, and S. R. Das, “Ad-hoc On-Demand Distance Vector (AODV ) Routing”, Internet Draft, draft-ietf-MANETsaodv -10.txt, work in progress, 2002.

[6]Li Ting Jun “Study On Airborne Single passive location Technology” Applied Mechanics and Materials Vols.58(2011) pp. 2006-2009.

[7]Li Ting Jun, Lin Xueyuan, “GPS/SINS Integrated Navigation System Based On Multi-Scale Preprocessing”, Journal of Wuhan University, 2011, Vols 36(1): pp. 6-9.

[8]Li Tingjun “The Phonetic Complex Data Based on FPGA Key Engineering Materials”, Vols 475(2011)pp. 1156-1160.

[9]Khan, J., Hyder, S.I., Fakar, S.M.: Modeling and simulation of dynamic intermediate nodes and performance analysis in Manet’s reactive routing protocols. International Journal of Grid and Distributed Computing 4(1) (March 2011).

[10]Barakovic, S., Kasapovic, S., Barakovic, J.: Comparison of MANETS routing protocols in different traffic and mobility models. Telfor Journal 2(1) (2010).

[11]E. M. Belding-Royer, I. D. Chakeres, and C. E. Perkins. Ad-hoc On-Demand Distance Vector (AODV) Routing: Work in progress, July 2004. Internet Draft, RFC 3561bis-01, http://moment.cs.ucsb.edu/pub/draft-perkins-MANETs-aodv bis-02.txt.

[12]Kaur, S.: Performance Comparison of DSR and AODV Routing Protocols with Efficient Mobility Model in Mobile Ad-Hoc Network. IJCST 2(2) (June 2011). 

[13]Shahram Behzad, Reza Fotohi, Shahram Jamali,"Improvement over the OLSR Routing Protocol in Mobile Ad Hoc Networks by Eliminating the Unnecessary Loops", IJITCS, vol.5, no.6, pp.16-22, 2013. DOI: 10.5815/ijitcs.2013.06.03.