Online Submission!

Open Journal Systems

Detection of Clone Nodes in Wireless Sensor Networks Using RED and Chord Algorithm

R. Sindoori, S. Mahalakshmi, T. Sowkarthika, S. Imavathy, K. Pravinkumar

Abstract


The major issue in WSN is vital information accessed by unauthorized party by clone node. Once a node is captured, the attacker can re-program it and replicate the node in a huge number, thereby easily take over the network process. The detection of node clone attacks in a wireless sensor network is a fundamental problem. Here, the proposed protocols are used to detect clone nodes. The protocols used here are Randomized, Efficient and Distributed (RED) protocol, Chord algorithm and distributed hash table (DHT). The first one RED, a new protocol for the detection of clone attacks. And it is used to generate the random number by group leader. The next protocol is chord algorithm for maintaining the neighbor‘s details. The distributed hash table (DHT) is a class of a decentralized distributed system that provides a service similar to a hash table and any participating node can efficiently retrieve the neighbor‘s details. The DHT is used to store the member ID, MAC address, preceded ID and successor ID. A witness node is used to verify the random number, member ID, MAC address. The witness node is able to detect the message is send from the authorized party or not by using random key.


Full Text:

PDF

References


B. Parno, A. Perrig, and V. Gligor, ―Distributed detection of node replication attacks in sensor networks,‖ in Proc. IEEE Symp. Security Privacy, 2005, pp. 49–63.

H. Balakrishnan, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, ―Looking up data in P2P systems,‖ Commun. ACM, vol. 46, no. 2, pp. 43–48, 2003.

Y. Zhang,W. Liu,W. Lou, andY. Fang, ―Location-based compromisetolerant security mechanisms for wireless sensor networks,‖ IEEE J. Sel. Areas Commun., vol. 24, no. 2, pp. 247–260, Feb. 2006.

S. Zhu, S. Setia, and S. Jajodia, ―LEAP: Efficient security mechanisms for large-scale distributed sensor networks,‖ in Proc. 10th ACM CCS, Washington, DC, 2003, pp. 62–72.

R. Anderson, H. Chan, and A. Perrig, ―Key infection: Smart trust for smart dust,‖ in Proc. 12th IEEE ICNP, 2004, pp. 206–215. [6] M. Conti, R. D. Pietro, L. V. Mancini, and A. Mei, ―A randomized, efficient, and distributed protocol for the detection of node replication attacks inwireless sensor networks,‖ in Proc. 8thACMMobiHoc,Montreal, QC, Canada, 2007, pp. 80–89. [7] B. Zhu, V. G. K. Addada, S. Setia, S. Jajodia, and S. Roy, ―Efficient distributed detection of node replication attacks in sensor networks,‖ in Proc. 23rd ACSAC, 2007, pp. 257–267. [8] H. Choi, S. Zhu, and T. F. La Porta, ―SET: Detecting node clones in sensor networks,‖ in Proc. 3rd SecureComm, 2007, pp. 341–350. [9] R. Brooks, P. Y. Govindaraju, M. Pirretti, N. Vijaykrishnan, and M. T. Kandemir, ―On the detection of clones in sensor networks using random key predistribution,‖ IEEE Trans. Syst.s, Man, Cybern. C, Appl. Rev., vol. 37, no. 6, pp. 1246–1258, Nov. 2007. [10] L. Eschenauer and V. D. Gligor, ―A key-management scheme for distributed sensor networks,‖ in Proc. 9th ACM Conf. Comput. Commun. Security, Washington, DC, 2002, pp. 41–47. [11] A. Shamir, ―Identity-based cryptosystems and signature schemes,‖ in Proc. CRYPTO, 1984, LNCS 196, pp. 47–53. [12] R. Poovendran, C. Wang, and S. Roy, Secure Localization and Time Synchronization for Wireless Sensor and Ad Hoc Networks. New York: Springer-Verlag, 2007. [13] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, ―A survey on sensor networks,‖ IEEE Commun. Mag., vol. 40, no. 8, pp. 102–114, Aug. 2002. [14] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, ―A scalable content-addressable network,‖ in Proc. SIGCOMM, San Diego, CA, 2001, pp. 161–172. [15] I. Stoica, R.Morris, D. Liben-Nowell, D. R. Karger,M. F.Kaashoek, F. Dabek, and H. Balakrishnan, ―Chord: A scalable peer-to-peer lookup protocol for internet applications,‖ IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 17–32, Feb. 2003. [16] A. I. T. Rowstron and P. Druschel, ―Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems,‖ in Proc. IFIP/ACM Int. Conf. Distrib. Syst. Platforms Heidelberg, 2001, pp. 329–350. [17] A. Varga and R. Hornig, ―An overview of the OMNeT++ simulation environment,‖ in Proc. 1st Int. Conf. Simulation Tools Tech. Commun., Netw. Syst. Workshops, Marseille, France, 2008, pp. 1–10. [18] A. Awad, C. Sommer, R. German, and F. Dressler, ―Virtual cord protocol (VCP): A flexible DHT-like routing service for sensor networks,‖ in Proc. 5th IEEE MASS, 2008, pp. 133–142. [19] R. Diestel, Graph Theory, 3rd ed. New York: Springer, 2006.




DOI: http://dx.doi.org/10.6084/ijact.v3i6.299

Refbacks

  • There are currently no refbacks.