Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks
Issue No. 04 - April (2011 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.124
Yingshu Li , Georgia State University, Atlanta
Chinh Vu , Georgia State University, Atlanta
Chunyu Ai , Georgia State University, Atlanta
Guantao Chen , Georgia State University, Atlanta
Yi Zhao , Georgia State University, Atlanta
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.
Partial coverage, wireless sensor networks, energy efficiency.
Y. Li, G. Chen, Y. Zhao, C. Ai and C. Vu, "Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 695-703, 2010.