Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks

The complete area coverage problem in Wireless Sensor Networks (WSNs) has been extensively studied in the literature. However, many applications do not require complete coverage all the time. For such applications, one effective method to save energy and prolong network lifetime is to partially cover the area. This method for prolonging network lifetime recently attracts much attention. However, due to the hardness of verifying the coverage ratio, all the existing centralized or distributed but nonparallel algorithms for partial coverage have very high time complexities. In this work, we propose a framework which can transform almost any existing complete coverage algorithm to a partial coverage one with any coverage ratio by running a complete coverage algorithm to find full coverage sets with virtual radii and converting the coverage sets to partial coverage sets via adjusting sensing radii. Our framework can preserve the characteristics of the original algorithms and the conversion process has low time complexity. The framework also guarantees some degree of uniform partial coverage of the monitored area.

[1]  Ivan Stojmenovic,et al.  Localized sensor area coverage with low communication overhead , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications (PERCOM'06).

[2]  Yingshu Li,et al.  Distributed Energy-Efficient Algorithms for Coverage Problem in Adjustable Sensing Ranges Wireless Sensor Networks , 2009, Discret. Math. Algorithms Appl..

[3]  Yingshu Li,et al.  Distributed Energy-Efficient Scheduling Approach for K-Coverage in Wireless Sensor Networks , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[4]  Yu-Chee Tseng,et al.  Decentralized energy-conserving and coverage-preserving protocols for wireless sensor networks , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[5]  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).

[6]  Xiaoqiao Meng,et al.  Real-time forest fire detection with wireless sensor networks , 2005, Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005..

[7]  Byung-rak Son,et al.  A Design and Implementation of Forest-Fires Surveillance System based on Wireless Sensor Networks for South Korea Mountains , 2006 .

[8]  G. Calinescu,et al.  EFFICIENT ENERGY MANAGEMENT IN SENSOR NETWORKS , 2004 .

[9]  Shan Gao,et al.  p-Percent Coverage Schedule in Wireless Sensor Networks , 2008, 2008 Proceedings of 17th International Conference on Computer Communications and Networks.

[10]  Xi Chen,et al.  Percentage Coverage Configuration in Wireless Sensor Networks , 2005, ISPA.

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

[12]  J. Hou,et al.  Maximizing α-Lifetime for Wireless Sensor Networks , 2005 .

[13]  Yingshu Li,et al.  Delaunay-triangulation based complete coverage in wireless sensor networks , 2009, 2009 IEEE International Conference on Pervasive Computing and Communications.

[14]  Shan Gao,et al.  p-Percent Coverage in Wireless Sensor Networks , 2008, WASA.

[15]  Majid Bagheri,et al.  Forest Fire Modeling and Early Detection using Wireless Sensor Networks , 2009, Ad Hoc Sens. Wirel. Networks.

[16]  Weifa Liang,et al.  Approximate coverage in wireless sensor networks , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[17]  Jennifer C. Hou,et al.  On deriving the upper bound of α-lifetime for large sensor networks , 2004, MobiHoc '04.