Dynamic cluster based energy controlled routing in Wireless Sensor Networks

Fault tolerance has been identified as key challenges in the design and operations of Wireless Sensor Network (WSNs). Failures are inevitable in wireless sensor networks due to inhospitable environment and unattended deployment. Therefore, it is necessary to detect the networks for recovery from the failure to sustain it. WSNs are self-organized using clustering algorithms to conserve energy. The sensor nodes are organized in several small clusters where there are cluster heads in each cluster. These CHs (Cluster Heads) gather data from their local clusters aggregate them & send them to the base station with shortest distance as a forwarding metric using Dijkstra algorithm. The proposed scheme is supposed to be an efficient fault detection and recovery mechanism to make the network fault-tolerant and achieve reliability, latency and energy efficiency. Performance analysis and evaluation will be made using several scenarios of wireless sensor networks.