Abstract
A mobile adhoc network (MANET) is a collection of wireless nodes, communicating among themselves over possibly multi hop paths, without the help of any central infrastructure such as base stations. Ad hoc On Demand Vector Routing (AODV) is perhaps the most well known routing protocol for MANET. A variety of attacks can be launched against AODV [1] protocol. One of major attack is modification of hop count in route request and route reply control messages. This attack propagates distorted view of hop counts between two legitimate nodes in the network Secure AODV (SAODV) is a secure extension of the AODV routing protocol. SAODV [2] only prevents from decrease of the hop count attack, while attackers can still forward routing messages with the same hop count or increase in hop count on the network. In this paper, we have proposed a security scheme to improve SAODV (I-SAODV) which uses hash chain and markle hash tree for authentication to protect not only from same hop count fraud but also prevent from maliciously increase in hop count in the message. The effectiveness of I-SAODV is analyzed using network simulator NS2.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Royer, E.M., Perkins, C.E.: Ad-hoc on-demand distance vector routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, p. 90 (1999)
Zapata, M.G., Asokan, N.: Securing ad hoc routing protocols. In: Proceedings of ACM Workshop on Wireless Security (WiSe), pp. 1–10 (2002)
Perkins, C.E., Belding-Royer, E.M., Das, S.R.: Ad hoc on-demand distance vector (AODV) routing, RFC 3561, The Internet Engineering Task Force, Network Working Group (July 2003)
Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Imielinski, Korth (eds.) Mobile Computing, vol. 353, pp. 153–181. Kluwer Academic Publishers, Dordrecht (1996)
Maltz, D.A., Johnson, D.B., Hu, Y.: The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4, RFC 4728, The Internet Engineering Task Force, Network Working Group (February 2007)
Perkins, C.E., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: Proc. Conf. Commun. Architect. Protocols, Appl., pp. 234–244 (August 1994)
Hu, Y., Perrig, A., Johnson, D.B.: Wormhole attacks in wireless networks. IEEE Journal on Selected Areas in Communication 24(2) (February 2006)
Wu, B., Chen, J., Wu, J., Cardei, M.: A survey of attacks and countermeasures in mobile ad hoc networks. Wireless Network Security 30(3), 103–135 (2007)
Win, K.S.: Analysis of detecting wormhole attack in wireless networks. World Academy of Science, Engineering and Technology 36 (December 2008)
Juwad, M.F., Al-Raweshidy, H.S.: Experimental Performance Comparisons between SAODV & AODV. In: IEEE Second Asia International Conference on Modeling & Simulation (2008)
Arshad, J., Azad, M.A.: Performance Evaluation of Secure on-Demand Routing Protocols for Mobile Ad-hoc Networks, 1-4244-0626-9/06 © 2006 IEEE
Hu, Y., Johnson, D., Perrig, A.: SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks. Ad Hoc Networks I, 175–192 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rana, S., Singh, M. (2011). I-SAODV: Improving SAODV to Mitigate Hop-Count Attack in Mobile Adhoc Network. In: Abraham, A., Lloret Mauri, J., Buford, J.F., Suzuki, J., Thampi, S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22709-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-22709-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22708-0
Online ISBN: 978-3-642-22709-7
eBook Packages: Computer ScienceComputer Science (R0)