Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete

Wei-Chieh Ke, Bing-Hong Liu, Ming-Jer Tsai · IEEE Transactions on Computers · 2007

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

Read the paper · More papers on PaperTik