Providing Efficient Energy to By-Pass Infected Areas in WSNs

Wireless Sensor Network have been the front line innovation in different remote occasion observing applications, particularly in unsafe zones, threatening situations, battlefields and commercial applications such as building, traffic surveillance, habitat monitoring and smart homes and many more scenarios. Although several existing methods BOUNDHOLE, GAR, TWIN ROLLING BALL algorithms are used to avoid these problems but their performance are bounded by their limitations. While transmitting the packet the void problem can also occur that makes the packet unreachable towards the destination. This becomes challenge to avoid routing problem in Greedy routing protocol. Especially the active attacks would decrease the Qos parameters of the System, this paper mainly focuses on the After by-passing the packet from the infected area using BPR technique, the Enhancement added further to this is - We are finding the new path from SOURCE to DESTINATION through the best energy-efficient neighbor node. For that, we are setting the energy model using ene. awk and calculating the energy-efficient of best neighbor node. We have to sort the energy file to get the highest energy neighbor node. In final. awkitwill find the new path from source to destination through best energy efficient neighbor node.