International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 5, No. 10, 8 Aug. 2013
Cover page and Table of Contents: PDF (size: 248KB)
Security Algorithms for Mitigating Selfish and Shared Root Node Attacks in MANETs
Full Text (PDF, 248KB), PP.1-10
Views: 0 Downloads: 0
Author(s)
J.Sengathir
1,*
R.Manoharan
1
Index Terms
MANETs, Selfish nodes, Shared root node, MADOV, Control packet, Sequence numbers
Abstract
Mobile ad hoc network is a type of self configurable, dynamic wireless network in which all the mobile devices are connected to one another without any centralised infrastructure. Since, the network topology of MANETs changes rapidly. It is vulnerable to routing attacks than any other infrastructure based wireless and wired networks. Hence, providing security to this infrastructure-less network is a major issue. This paper investigates on the security mechanisms that are proposed for Selfish node attack, Shared root node attack and the Control packet attack in MANETs with the aid of a well known multicast routing protocol namely Multicast Ad hoc On Demand Distance Vector (MAODV). The security solutions proposed for each of the above mentioned attacks are evaluated with the help of three evaluation parameters namely packet delivery ratio, control overhead and total overhead. The algorithmic solutions thus obtained are analysed in the simulation environment by using ns-2 simulator.
Cite This Paper
J.Sengathir, R.Manoharan, "Security Algorithms for Mitigating Selfish and Shared Root Node Attacks in MANETs", International Journal of Computer Network and Information Security(IJCNIS), vol.5, no.10, pp.1-10, 2013. DOI:10.5815/ijcnis.2013.10.01
Reference
[1]E.M.Royer and C.E.Perkins. Multicast Operation of the Ad hoc On-Demand Distance Vector Routing Protocol. Proceedings of ACM MOBICOM 2002, pp.207-218, Aug 2002.
[2]Seungjoon Lee and Chongkwon Kim. Neighbor Supporting Ad Hoc Multicast Routing Protocol. In Proceedings of ACM the First ACM International Symposium on Mobile Ad Hoc Networking and Computing, pages 37–44, August 2000.
[3]M.Phani, Vijaya Krishna, Dr M.P.Sebastain. HMAODV: History aware on Multicast Ad Hoc On Demand Distance Vector Routing. IEEE 2006.
[4]S.Buchegger and J-Y L.Boudec. Nodes bearing Grudges: Towards routing security, Fairness, and Robustness in Mobile Ad-Hoc Networks preseented at tenth Eurominicro workshop on Partallel. Distributed and Networkbased Processing , Canary Islands, spain, 2002.
[5]L.Buttyan and J-P, Hubaux, Stimulating Cooperation in Self –organizing Mobile Ad hoc Networks, Mobile Computing and Networking. Pp 255-265, 2003.
[6]S.Marti, T.J Giuli, K.Lai, and M.Baker. Mitigating routing misbehavior in mobile ad hoc networks. Mobile Computing and Networking, pp 255-2656, 2000.
[7]P.Michiardi and R.Molva, CORE: A collaborative reputation mechanism to enforce node cooperation mobile ad hoc networks. presented at Communication and Multimedia security, Protoroz, Solvenia, 2002.
[8]S.Buchegger and J-Y L.Boudec. Performance Analysis of the CONFIDANT protocol: Cooperation of Nodes – Fairness in Distributed Ad-hoc Networks. Presented at tenth Eurominicro workshop on Partallel, Distributed and Network based Processing , Canary Islands, spain, 2002.
[9]F.Kargl A.Klenk , S.Schlott and M.Weber. Advanced Detection of selfish or Malicious Nodes in Ad hoc Networks. Presented at 1st European Workshop on Security in Ad-Hoc and Sensor Network. Heidelberg Germany,2004.
[10]Md. Amir Khusru Akhtar & G. Sahoo. Mathematical Model for the Detection of Selfish Nodes in MANETs. International Journal of Computer Science and Informatics (IJCSI) ISSN (PRINT): 2231 –5292, Volume-1, Issue-3.
[11]A.H Azni, Rabiah Ahmad,Zul Azri Muhamad Noh, Abd Samad Hasan Basari, Burairah Hussin. Correlated Node Behavior Model based on Semi Markov Process for MANETS. IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 1, No 1, January 2012.
[12]C.A.V.Campos and L.F.M.de Moraes. A Morkovian Model Representation of Individual Mobility Scenarios in Ad Hoc Networks and Its Evaluation. EURASIP Journal on Wireless Communicationsand Networking.,Pp231 –5292, Volume-1, Issue-3.
[13]Ching-Chuan Chiang, Mario Gerla, and Lixia Zhang. Forwarding Group Multicast Protocol (FGMP) for Multihop, Mobile Wireless Networks. Cluster Computing, Springer Special Issue on Mobile Computing, 1(2):187–196, 1998.
[14]Subir Kumar Das, B.S. Manoj, and C. Siva Ram Murthy. Dynamic Core-Based Multicast Routing Protocol for Ad Hoc Wireless Networks. In Proceedings of the Third ACM International Symposium on Mobile Ad Hoc Networking and Computing, pages 24–35, June 2002.
[15]H. Yang, H. Y. Luo, F. Ye, S. W. Lu, and L. Zhang, Security in mobile ad hoc networks: Challenges and solutions. IEEE Wireless Communications, vol. 11, pp. 38-47, 2004.
[16]S. Roy, V.G. Addada, S. Setia and S.Jajodia, Securing MAODV: Attacks and countermeasures, in Proceedings of. SECON’05, IEEE,2005.
[17]Demir, C and Comaniciu C. An Auction based AODV Protocol for Mobile Ad Hoc Networks with Selfish Node. Communications ICC'07. IEEE International Conference in June 2007.
[18]Chi-Yuan Chang, Yun-Sheng Yen. Chang-Wei Hsiesh Han-Chieh Chao An Efficient Rendezvous Point Recovery Mechanism in Multicasting Network. International Conference on Communications and Mobile Computing, 2007.
[19]Ashish D. Patel, Jatin D. Parmar and Bhavin I. Shah. MANET Routing Protocols and Wormhole Attack against AODV. IJCSNS International Journal of Computer Science and Network Security, Vol.10 No.4, pp. 12-18, April 2010.
[20]Bing Wu, Jianmin Chen, Jie Wu, Mihaela Cardei. A Survey on Attacks and Counter measures in Mobile Ad Hoc Networks. WIRELESS/MOBILE NETWORK SECURITY Y. Xiao, X. Shen, and D.-Z. Du (Eds.) 2006 Springer.