POTENTIAL AND MEMORY PROFICIENT REPLICATE DISCLOSURE IN WIRELESS SENSOR NETWORKS
Keywords:
Wireless sensor networks, network lifetime, clone detection protocol, energy efficiencyAbstract
Using the clone recognition protocol, we are designed for maximizing the clone recognition probability. Our
objective would be to propose a distributed clone recognition protocol with random witness selection to be able to increase
the clone recognition probability as the negative impact of network lifetime and the advantages of data buffer storage ought
to be minimized. The ring structure facilitates energy-efficient data forwarding across the path for the witnesses and also the
sink. We theoretically prove the suggested protocol is capable of 100 % clone recognition probability with trustful witnesses.
Particularly, we exploit the place information of sensors and at random select witnesses situated in a diamond ring place to
verify the authenticity of sensors and also to report detected clone attacks. Furthermore, in many existing clone recognition
protocols with random witness selection plan, the needed buffer storage of sensors is generally determined by the node
density. Extensive simulations show our suggested protocol is capable of lengthy network lifetime by effectively disbursing
the traffic load over the network. The present system doesn't make certain that a minimum of one from the witnesses
can look into the identity from the sensor nodes to find out whether there's a clone attack or otherwise. The
performance from the ERCD protocol is evaluated when it comes to clone recognition probability, power consumption,
network lifetime, and knowledge buffer capacity. Extensive simulation results show our suggested ERCD protocol is capable
of superior performance with regards to the clone recognition probability and network lifetime with reasonable data buffer
capacity.
