International Journal of Mathematics and Computational Science
Articles Information
International Journal of Mathematics and Computational Science, Vol.1, No.4, Aug. 2015, Pub. Date: Jun. 10, 2015
Kuder Richardson Reputation Coefficient Based Reputation Mechanism for Isolating Root Node Attack in MANETs
Pages: 206-213 Views: 1113 Downloads: 394
Authors
[01] S. Parthiban, Faculty of Engineering, Department of Computer Science and Engineering, DMI College of Engineering, Affiliated to Anna University, Chennai, India.
[02] Paul Rodrigues, Faculty of Engineering, Department of Computer Science and Engineering, DMI College of Engineering, Affiliated to Anna University, Chennai, India.
Abstract
In multi-hop networks like MANETs, the mobile nodes relies upon the intermediate nodes for routing the packets. But, the existence of root node attack in an ad hoc environment may degrade the network performance. Hence, the critical issues that could arise due to the existence of root node attack are considered as one of the important research issues to be solved. In this paper, we propose a Kuder – Richardson Reputation Co-efficient based Cooperation Enforcement Mechanism (KRRCM) for mitigating Root node attack based on Kuder – Richardson Reputation Co-efficient (KRRC) that quantifies the reputation level of mobile node. This Kuder – Richardson Reputation Co-efficient is calculated based on second hard reputation. The coefficient value obtained through KRRCM approach reflects an individual root node’s behaviour in relation to cooperation, so that the particular node can be selected as core point for group communication. The performance analysis of KRRCM carried out based on ns-2 simulator and the proposed KRRCM approach outperforms the existing mechanisms by increasing the packet delivery ratio and throughput by 23% and 28%, while decreasing the control overhead and total overhead in an average by 18% and 29% respectively. Further, KRRCM ideally mitigates the root node attack at a faster rate of 32% than the considered benchmark mechanism considered for investigation.
Keywords
Root Node Attack, MAODV, Kuder – Richardson Reputation Co-efficient, Threshold Detection Point, Group Communication, Packet Drop Variance
References
[01] Rizvi, S and Elleithy, M, (2009) ‘A new scheme for minimizing malicious behavior of mobile nodes in Mobile Ad Hoc Networks’, IJCSIS Internation Journal of computer Science and Information Security. Vol.3, No.1, pp. 45-54.
[02] Fahad Tarag, Askwith Robert, (2006), A node misbehaviour detection mechanism for mobile ad hoc networks. In: Proc, seventh annual post graduate symposium on the convergence of telecommunications, networking and broadcasting (PGNet), Vol. 1, No. 1; pp. 78–84.
[03] Zouridaki,C, Mark,B.L, Hejmo,M and Thomas,R.K (2005). ‘A quantitative trust establishment framework for reliable data packet delivery in MANETs’, Proceedings of the 3rd ACM Workshop on security of ad hoc and sensor networks, vol 1, pp.1-10.
[04] Roy, S, Addada, V.G, Setia, S and Jajodia, S (2005), Securing MAODV: Attacks and countermeasures, in Proceedings of. SECON’05, IEEE, Vol. 1, No. 1, pp. 521-532.
[05] Subir Kumar Das, B.S. Manoj, and C. Siva Ram Murthy, (2002), 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, Vol. 1, No. 1, pp 33-46.
[06] Buttyan, L and Hubaux, J-P (2003), Stimulating Coperation in Self –organizing Mobile Ad hoc Networks”, Mobile Computing and Networking, Vol.1, No.1, pp 255-265.
[07] Sengathir, J Manoharan, R A Split Half Reliability Coefficient based Mathematical Model for Mitigating Selfish Nodes in MANETs, in Proc., 3rd IEEE International Advance Computing Conference (IACC-2013), Ghaziabad, India, Feb 22-23, 2013, IEEE pp.267-272.
[08] Bing Wu, Jianmin Chen, Jie Wu, Mihaela Cardei, (2006) A Survey on Attacks and Counter measures in Mobile Ad Hoc Networks. WIRELESS/MOBILE, NETWORK SECURITY Springer, Vol. 1, No. 1, pp. 1-38.
[09] Chi-Yuan Chang, Yun-Sheng Yen. Chang-Wei Hsiesh Han-Chieh Chao, (1998) an Efficient Rendezvous Point Recovery Mechanism in Multicasting Network, International Conference on Communications and Mobile Computing, Vol. 1, No.2, pp.187-196.
[10] Demir, C and Comaniciu C, (2007), An Auction based AODV Protocol for Mobile Ad Hoc Networks with Selfish Node. Communications ICC'07. IEEE International Conference, Vol. 1, No. 1, pp. 3351-3356.
[11] Yang, H, Luo, Y, Ye, F, Lu,W, S and Zhang, L, (2004) Security in mobile ad hoc networks: Challenges and solutions. IEEE Wireless Communications, Vol. 1, No. 1, pp. 38-47.
[12] Chen, T.M, Varatharajan,V (2005) Dempster-Shafer Theory for Intrusion Detection in Ad Hoc Networks. IEEE Internet Computing, Vol. 3, No. 1, pp 233-245.
600 ATLANTIC AVE, BOSTON,
MA 02210, USA
+001-6179630233
AIS is an academia-oriented and non-commercial institute aiming at providing users with a way to quickly and easily get the academic and scientific information.
Copyright © 2014 - 2017 American Institute of Science except certain content provided by third parties.