A Resilient Strategy to Overcome Stretch Attacks by using Kmidpoint - Medoid Gateway Clustering Algorithm

摘要

Wireless Adhoc Sensor Networks are susceptiule to attacks which will evacuate the nodes battery life. Sensor nodes have sense and send data to sink or base station requiring more resources. In wireless adhoc sensor networks, reducing energy consumption and extending network lifetime are two great challenges. We fmd that the vampire attacks (stretch attack, carousal attack) are highly destructive, disastrous, catastrophic and difficult to detect, but they depend on the properties of many classes of routing protocols. This paper looks over the stretch attack that consumes more energy by long routes. A resilient approach is introduced in this paper that reduces the energy consumption and the long routes caused by vampires during the packet forwarding phase. In this study, an energy efficient clustering protocol based on K-medoids algorithm named Kmidpoint-medoid has been proposed for wireless adhoc sensor networks which increases the network lifetime of nodes and performs better routing. The proposed approach prolongs the network lifetime by appropriate clusters, centroid, cluster heads and gateways. Simulation results demonstrates that the proposed approach is far better and reduce the energy consumption at most compared to LEACH and Basic K-Medoids algorithm.