The Community for Technology Leaders
Green Image
ABSTRACT
This paper proves that deploying sensors on grid points to construct a wireless sensor network that fully covers critical grids using minimum sensors (Critical-Grid Coverage Problem) and that fully covers a maximum total weight of grids using a given number of sensors (Weighted-Grid Coverage Problem) are each NP-Complete.
INDEX TERMS
NP-Complete, wireless sensor networks, coverage problem.
CITATION

B. Liu, W. Ke and M. Tsai, "Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete," in IEEE Transactions on Computers, vol. 56, no. , pp. 710-715, 2007.
doi:10.1109/TC.2007.1019
85 ms
(Ver 3.3 (11022016))