EFFECTIVE IDENTIFICATION & REMOVAL OF CLONE NODES IN WSN USING CHORD ALGORITHM

Computer Engineering

Wireless sensor networks are vulnerable to the node clone attack, and several distributed protocols have been proposed to detect it. So too strong assumptions are required to be practical for large-scale, randomly deployed sensor networks. The main aim of the project is to identify the clone nodes and remove them. Thereby a distributed clone detection protocol namely ERCD (Energy-Efficient Ring Based Clone Detection) protocol having two stages: witness selection and legitimacy verification can be used for clone detection. The probability of clone detection can be increased by using the Chord algorithm which is based on the concept of Distributed Hash Table(DHT) where every node is assigned with a random key, before transmitting the data it has to give its key which would be verified by the witness node. The witness node identifies the cloned node if the same key is given by another node. Here every node only needs to know the neighbor-list containing all neighbor IDs and its locations. We are implementing Chord Algorithm, by location based nodes identification, where every region/location will have a group leader. The Group leader generates a random number with time stamp to the available nodes in that location. Witness node verifies the random number and time stamp to detect the cloned node. Those messages are encrypted for security purpose

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.