Protection from Intruders is very challenging and important security issue in Mobile Ad hoc networks. In this paper, a modified AODV algorithm has been proposed to identify and deactivate intruder nodes. The proposed algorithm based on existing AODV routing protocol. In this modified AODV algorithm does not use any cryptographic portion on the messages which will transmit. But, this proposed Modified AODV routing protocol protecting the network by detecting and deactivating the Intruder nodes. To prove the practical significance of the approach, this approach is implemented on NS2. Experimental evaluation shows the efficiency of proposed algorithm in terms of Throughput, Packet Delivery Ratio and End to end delay.
Vijay Kumar, Ashwani Kush, “Proposed New Mechanism to Detect and Defend the Malicious Attackers in AODV”, ACSIJ Advances in Computer Science: an International Journal, Volume 2, 2013 - May 2013 Issue, No. 201, (pg 1-6), ISSN : 2322-5157(Iran).
Vijay Kumar, Rakesh Sharma, Ashwani Kush “EFFECT OF MALICIOUS NODES ON AODV IN MOBILE AD HOC NETWORKS”, International Journal of Computer Science and Management Research ISSN 2278-733X, Vol. 1 Issue 3 October 2012.
Satoshi Kurosawa, Hidehisa Nakayama, Nei Kato, Abbas Jamalipour, and Yoshiaki Nemoto, “Detecting Black hole Attack on AODV-based Mobile Ad Hoc Networks by Dynamic Learning Method”, International Journal of Network Security, Vol.5, issue 3, Nov 2007, pp 338–346.
Shree Om, Mohammad Talib , “ Using Merkle Tree to Mitigate Cooperative Black-hole Attack in Wireless Mesh Networks” (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 2, No. 5, 2011
C. E. Perkins, S.R. Das, and E. Royer, “Ad-hoc on Demand Distance Vector (AODV)”. March 2000, http://www.ietf.org /internal-drafts/ draft-ietf-manetaodv-05.txt
B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, “An On-Demand Secure Routing Protocol Resilient to Byzantine Failures,” Proceedings of the 3rd ACM Workshop on Wireless Security, 2002.
Y. Hu, A. Perrig, and D. Johnson, “Ariadne: A Secure On- Demand Routing Protocol for Ad Hoc Networks,” Proceedings of the 8th ACM International Conference on Mobile Computing and Networking, 2002.
A. Perrig, R. Canetti, D. Song, and J. Tygar, “Efficient and Secure Source Authentication for Multicast,” In Network and Distributed System Security Symposium, pp. 35–46, February 2001.
J. T. A. Perrig, R. Canetti and D. Song, “Efficient Authentication and Signing of Multicast Streams over Lossy Channels,” In IEEE Symposium on Security and Privacy, pp. 56–73, May 2000.
A. Abdul-Rahman and S. Hailes, “A distributed trust model”, in Proceedings of the New Security Paradigms Workshop, pp. 48-60, Langdale, Cumbria, United Kingdom, 1997.
N. Asokan and P. Ginzboorg, “Key agreement in ad hoc networks”, Computer Communications, vol 23, no 17, pp. 1627-1637, 2000.
F. Stajano and R. Anderson, “The resurrecting duckling: security issues for ad hoc wireless networks”, in Proceedings of the 7th International Workshop on Security Protocols, LNCS 1796, Springer- Verlag, pp. 172-194, 1999.
T. Repantis and V. Kalgeraki, “Decnetralized trust management for ad hoc peer-to-peer networks”, in Proceedings of the 4th International Workshop on Middleware for Pervasive and Ad-Hoc Computing(IMPAC 2006), p. 6, Melbourne, Australia, April 2006.
A. Patwardhan, F. Perich, A. Joshi, T. Finin, and Y. Yesha, “Querying in packs: trustworthy data management in ad hoc networks”, International Journal of Wireless Information Networks, vol 13, no 4, october 2006.
A.Kush, S.Taneja, Divya, “Encryption Scheme for Secure Routing in Ad Hoc Networks” in International Journal of Advancements in Technology http://ijict.org/ ISSN 0976-4860, Vol 2, No 1 (January 2011) pp22-29.
Mobile ad hoc networks, Intruder Detection, routing misbehavior.