The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2007 vol.56)
pp: 710-715
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
Wei-Chieh Ke, Bing-Hong Liu, 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. 5, pp. 710-715, May 2007, doi:10.1109/TC.2007.1019
459 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool