Constructing a wireless sensor network to fully cover critical grids by deploying minimum sensors on grid points is NP-complete
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.
wireless sensor networks np-complete coverage problem