A universal framework for partial coverage in Wireless Sensor Networks

The complete area coverage problem in Wireless Sensor Networks (WSNs) where every point inside an area is covered by an active sensor has been extensively studied in the literature. However, there are many applications that do not always require complete coverage. For such applications, an effective method to save energy and prolong network lifetime is to partially cover the area. However, due to the hardness to verify the ratio of the covered area over the entire monitored area (coverage ratio), all the existing algorithms for partial coverage have very high time complexities (either centralized algorithms or distributed but non-parallel algorithms). Besides, all the existing algorithms are intentionally designed for partial coverage, thus they do not utilize the various exiting methods for the complete coverage problem. In this work, we propose a framework that can convert almost any existing algorithm for complete coverage to a one for partial coverage with any coverage ratio. 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.