Minimum Connected Sensor Cover and Maximum-Lifetime Coverage in Wireless Sensor Networks

Energy efficiency is an important issue in the study of wireless sensor networks. The minimum connected sensor cover problem and the maximum lifetime coverage problem are very well known in the literature on energy efficiency. In recent years, there are important developments in the study of these two problems through studying the relationship between the connected sensor cover and the group Steiner tree and the relationship between coverage and weighted dominating set. In this article, we introduce those relationships and related new developments on the minimum connected sensor cover problem and the maximum lifetime coverage problem.

[1]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[2]  Weili Wu,et al.  Constant-approximation for target coverage problem in wireless sensor networks , 2012, 2012 Proceedings IEEE INFOCOM.

[3]  Suman Banerjee,et al.  Node Placement for Connected Coverage in Sensor Networks , 2003 .

[4]  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..

[5]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[6]  Panos M. Pardalos,et al.  Maximum lifetime connected coverage with two active-phase sensors , 2013, J. Glob. Optim..

[7]  Sajal K. Das,et al.  A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks , 2005, DCOSS.

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

[9]  Robert Krauthgamer,et al.  Polylogarithmic inapproximability , 2003, STOC '03.

[10]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[11]  Jie Wu,et al.  On Connected Multiple Point Coverage in Wireless Sensor Networks , 2006, Int. J. Wirel. Inf. Networks.

[12]  Weili Wu,et al.  Node-weighted Steiner tree approximation in unit disk graphs , 2009, J. Comb. Optim..

[13]  David Simplot-Ryl,et al.  Energy-efficient area monitoring for sensor networks , 2004, Computer.

[14]  Thomas Erlebach,et al.  A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs , 2009, WAOA.

[15]  Sajal K. Das,et al.  Coverage and Connectivity Issues in Wireless Sensor Networks , 2005 .

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

[17]  Guy Kortsarz,et al.  A greedy approximation algorithm for the group Steiner problem , 2006, Discret. Appl. Math..

[18]  Michael Segal,et al.  Improved approximation algorithms for connected sensor cover , 2007, Wirel. Networks.

[19]  Ionut Cardei,et al.  Energy-Efficient Target Coverage in Heterogeneous Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[20]  Zygmunt J. Haas,et al.  Coverage and connectivity in three-dimensional networks , 2006, MobiCom '06.

[21]  Thomas Erlebach,et al.  Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs , 2006, APPROX-RANDOM.

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

[23]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

[24]  Weili Wu,et al.  New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs , 2011, Theor. Comput. Sci..

[25]  Weili Wu,et al.  A better constant-factor approximation for weighted dominating set in unit disk graph , 2009, J. Comb. Optim..

[26]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[27]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[28]  Fabrizio Grandoni,et al.  An improved LP-based approximation for steiner tree , 2010, STOC '10.

[29]  Weili Wu,et al.  Coverage breach problems in bandwidth-constrained sensor networks , 2007, TOSN.

[30]  Jing Lv,et al.  Approximations for Minimum Connected Sensor Cover , 2013, 2013 Proceedings IEEE INFOCOM.

[31]  Ding-Zhu Du,et al.  Design and Analysis of Approximation Algorithms , 2011 .

[32]  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.

[33]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[34]  Guy Kortsarz,et al.  An approximation algorithm for the group Steiner problem , 2002, SODA '02.

[35]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[36]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[37]  Mihaela Cardei,et al.  Coverage in Wireless Sensor Networks , 2004, Handbook of Sensor Networks.

[38]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[39]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[40]  Mihaela Cardei,et al.  Coverage Problems in Sensor Networks , 2013 .