A Simulation Model to Secure the Routing Protocol AODV against Black-Hole Attack in MANET

Summary An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. In mobile ad hoc network, each mobile node acts as a host as well as a router. These nodes communicate to each other by hop-to-hop communication. A number of routing protocols like Ad Hoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR), Destination-Sequenced Distance-Vector (DSDV) and Temporally Ordered Routing Algorithm (TORA) have been implemented. AODV is a prominent on-demand reactive routing protocol for mobile ad hoc networks. But in existing AODV, there is no security provision against a well-known “Black Hole” attack. Black hole nodes are those malicious nodes that agree to forward packet to destination but do not forward packet intentionally. These black hole nodes participate in the network actively and degrade the performance of network eventually. This thesis proposes watchdog mechanism to detect the blackhole nodes in a MANET. This method first detects a black hole attack and then gives a new route bypassing this node. In this thesis an attempt has been made to compare the performance of original AODV and modified AODV in the presence of multiple black hole nodes on the basis of throughput and packet delivery ratio. With this new protocol, throughput increases 10-18% in the presence of 10% black hole nodes for different pause times.

[1]  Dharma P. Agrawal,et al.  Strategies for enhancing routing security in protocols for mobile ad hoc networks , 2003, J. Parallel Distributed Comput..

[2]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[3]  Peng Ning,et al.  How to misuse AODV: a case study of insider attacks against mobile ad-hoc routing protocols , 2003, IEEE Systems, Man and Cybernetics SocietyInformation Assurance Workshop, 2003..

[4]  Kevin R. Fall,et al.  Ns: notes and documentation , 1997 .

[5]  J.-P. Hubaux,et al.  Enforcing service availability in mobile ad-hoc WANs , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[6]  Baruch Awerbuch,et al.  An on-demand secure routing protocol resilient to byzantine failures , 2002, WiSE '02.

[7]  Dharma P. Agrawal,et al.  Routing security in wireless ad hoc networks , 2002, IEEE Commun. Mag..

[8]  R. Ramanujan,et al.  Intrusion-resistant ad hoc wireless networks , 2002, MILCOM 2002. Proceedings.

[9]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[10]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[11]  Peng Wei-gang Routing Protocol in Mobile Ad Hoc Networks , 2002 .

[12]  Refik Molva,et al.  Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks , 2002, Communications and Multimedia Security.

[13]  Xiaoyan Hong,et al.  Scalable routing protocols for mobile ad hoc networks , 2002, IEEE Netw..

[14]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[15]  Zygmunt J. Haas,et al.  Securing ad hoc networks , 1999, IEEE Netw..

[16]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.