Elliptical Curve Diffe-Hellman Algorithm for discovering Duplication Attack in Mobile WSN

Abstract

Wireless Sensor Network (WSN) is the greatest susceptible of all the wireless sensor nodes. In the WSN, several widespread attacks were launched in the rival world. The most problematic are complete attack identification and avoidance of node duplication. The period it takes to recognize and separate a duplicated sensor node is typically higher than other attack recognition methods owing to the related identity and features copied through the attacker. Elliptical Curve Diffe-Hellman Algorithm is employed for discovering duplication attack (ECDD) in Mobile WSN. This approach aims to distinguish duplicated sensor nodes in the mobile WSN. In this approach, the public and private keys are used for verification. The ECDD method interacts with the secret key to distinguish the duplicate sensor node and separate it from routing, raising the network function. The simulation examination demonstrates a lesser false negative ratio and increases duplicate attack detection in the network.