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.

[1]  Jörg Widmer,et al.  In-network aggregation techniques for wireless sensor networks: a survey , 2007, IEEE Wireless Communications.

[2]  José D. P. Rolim,et al.  Energy balanced data propagation in wireless sensor networks , 2006, Wirel. Networks.

[3]  A.E. Kamal,et al.  Data aggregation in wireless sensor networks - exact and approximate algorithms , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[4]  Azzedine Boukerche,et al.  Fault-tolerant wireless sensor network routing protocols for the supervision of context-aware physical environments , 2006, J. Parallel Distributed Comput..

[5]  Sotiris E. Nikoletseas,et al.  Energy balanced data propagation in wireless sensor networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[6]  Stephan Olariu,et al.  A Lightweight Skeleton Construction Algorithm for Self-Organizing Sensor Networks , 2009, 2009 IEEE International Conference on Communications.