Duplicate Node Detection In Wireless Sensor Network Using Detection Algorithms

S. Anandamurugan*, M. Divya**
* Assistant Professor (SLG), Department of IT, Kongu Engineering College, Perundurai, India.
** PG Scholar, Department of IT, Kongu Engineering College, Perundurai, India.
Periodicity:October - December'2014
DOI : https://doi.org/10.26634/jwcn.3.3.3083

Abstract

Wireless Sensor Network is a collection of many sensor nodes and is more vulnerable to node replica attack. Among many physical attacks to sensor networks, the node clone is a serious and dangerous one because sensor nodes are generally short of tamper-resistance hardware components. An adversary can capture few nodes, extract code and all secret information to replica many nodes. That replica nodes act as a original node, and can freely enter the sensor network and then extend the adversary's capacities to perform the network maliciously and have whole control over the network. In the existing system, even though private keys are used for both identity and location of the sensor node, still the nodes are compromised by the attacker and also those methods are based on centralized system, and it increases communication burden and increases complexity to detect the clone node. To overcome these problems, two detection algorithms are proposed. Distributed Hash Table (DHT) is a decentralized, key-based caching and checking system to detect the clone node. DHT-based detection algorithm can use chord overlay network to detect node clone with high security level. Randomly Directed Exploration (RDE), a distributed system providing good communication performance, uses two methods probabilistic directed forwarding with random initial direction and border determination for detecting the clone node. RDE has high detection probability compared to DHT-based detection algorithms.

Keywords

Node Replication Attack, Distributed Protocol, Wireless Sensor Networks, Randomly Directed Exploration.

How to Cite this Article?

Anandamurugan, S., and Divya, M. (2014). Duplicate Node Detection In Wireless Sensor Network Using Detection Algorithms. i-manager's Journal on Wireless Communication Networks, 3(3), 35-41. https://doi.org/10.26634/jwcn.3.3.3083

References

[1]. Parno, B., Perrig, A., Gligor, V. (2005). “Distributed detection of node replication attacks in sensor networks,” in Proceedings of IEEE Symposium Security Privacy, pp 49–63.
[2]. Balakrishnan,H. ,Kaashoek,M.F., Karger,D., Morris.R., Stoica,I. (2003). “Looking up data in P2P systems,” Communication ACM, Vol. 46, No. 2, pp.43–48.
[3]. Zhang.Y, Liu.W, Lou.W, and Fang.Y. (2006). “Locationbased compromisetolerant security mechanisms for wireless sensor networks,” IEEE Journal Selected Areas Commun., Vol. 24, No. 2, pp. 247–260.
[4]. Zhu.S, Setia.S, and Jajodia.S. (2003). “LEAP: Efficient security mechanisms for large-scale distributed sensor networks,” in Proceeding of. 10th ACM conference in CCS, Washington, DC, pp. 62–72.
[5]. Anderson, R., Chan, H., and Perrig, A. (2004). “Key infection: Smart trust for smart dust,” in Proceedings of 12th IEEE ICNP, pp. 206–215.
[6]. Conti, M., Pietro, R.D., Mancini, L.V., and A. Mei. (2007). “A randomized, efficient, and distributed protocol for the detection of node replication attacks in wireless sensor networks,” in Proceedings of 8thACMMobiHoc,Montreal, QC, Canada, pp. 80–89.
[7].Zhu,B.,Addada,V.G,K.,Setia.S.,Jajodia.S.,and Roy.S. (2007). “Efficient distributed detection of node replication attacks in sensor networks,” in Proceedings of 23rd ACSAC, pp. 257–267.
[8]. H. Choi, S. Zhu, and T. F. La Porta, “SET: Detecting node clones in sensor networks,” in Proceedings of 3rd Secure Comm, pp. 341–350.
[9] . Stoica,I., Morris, R. ,Liben - Nowell , D.,Karger, Kaashoek,M.F., Dabek,F., and Balakrishnan,H. (2003). “Chord: A scalable peer-to-peer lookup protocol for internet applications,” IEEE/ACM Tranaction on Networking, Vol. 11, No. 1, pp. 17–32.
[10]. Eschenauer.L., and Gligor,v.D. (2002). “A keymanagement scheme for distributed sensor networks,” in Proc. 9th ACM Conf. Comput. Commun. Security, Washington, DC, pp. 41–47.
[11]. A. I. T. Rowstron and P. Druschel, (2001). “Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems,” in Proceeding IFIP/ACM International Conference Distributed System Platforms Heidelberg, pp. 329–350.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Online 15 15

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.