Energy Efficient Distributed Connected Coverage Algorithms with Dynamic Coverage Maintenance in Wireless Sensor Networks

A combined algorithm is required to select an optimal set of sensors, satisfying the conditions of coverage and connectivity. Since topological changes have significant impact on the coverage quality, there is a need for dynamic coverage maintenance algorithms. In this paper, an energy efficient distributed connected coverage (EEDCC) algorithm and a set of dynamic coverage maintenance (DCM) algorithms have been proposed. EEDCC aims to reduce the energy consumption with a lower communication overhead. The DCM algorithms aid in the tracking of changes in network topology thereby addressing the issues related to dynamic coverage and loss recovery. These algorithms would assist in the adaptive maintenance of the coverage either by migrating sensor node or by updating the radii accordingly. Simulations results show that the EEDCC-DCM algorithms attain significant reduction of energy, with strong connectivity and coverage.

[1]  Sean E. Hynes,et al.  Multi-Agent Simulations (MAS) for Assessing Massive Sensor Coverage and Deployment , 2003 .

[2]  N. Devarajan,et al.  An Energy Efficient Distributed Algorithm for Connected Sensor Cover in Sensor Networks , 2008 .

[3]  Michael Segal,et al.  Improved approximation algorithms for connected sensor cover , 2004, ADHOC-NOW.

[4]  Romit Roy Choudhury,et al.  Location-Independent Coverage in Wireless Sensor Networks , 2022 .

[5]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[6]  Dong Xuan,et al.  On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[7]  Himanshu Gupta,et al.  Variable radii connected sensor cover in sensor networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[8]  Biswanath Mukherjee,et al.  Optimizing placement of beacons and data loggers in a sensor network - a case study , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[9]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[10]  Guoliang Xing,et al.  Impact of sensing coverage on greedy geographic routing algorithms , 2006, IEEE Transactions on Parallel and Distributed Systems.

[11]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[12]  Weijia Jia,et al.  Deploying Four-Connectivity and Full-Coverage Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[13]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[14]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[15]  Archana Bharathidasan,et al.  Sensor Networks : An Overview , 2002 .

[16]  Gregory J. Pottie,et al.  Instrumenting the world with wireless sensor networks , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[17]  Sanjay Kumar Madria,et al.  Sensor networks: an overview , 2003 .

[18]  Jie Wu,et al.  Broadcasting in Ad Hoc Networks Based on Self-Pruning , 2003, Int. J. Found. Comput. Sci..