Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete
Issue No. 05 - May (2007 vol. 56)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2007.1019
Ming-Jer Tsai , IEEE
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.
NP-Complete, wireless sensor networks, coverage problem.
Bing-Hong Liu, Wei-Chieh Ke, Ming-Jer Tsai, "Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete", IEEE Transactions on Computers, vol. 56, no. , pp. 710-715, May 2007, doi:10.1109/TC.2007.1019