The critical-square-grid coverage problem in wireless sensor networks is NP-Complete.

Wei-Chieh Ke Bing-Hong Liu Ming-Jer Tsai

Published in: Comput. Networks (2011)

Keyphrases

np complete
square grid
wireless sensor networks
np hard
energy efficient
randomly generated
sensor networks
sensor nodes
computational complexity
satisfiability problem
biological inspired
routing algorithm
digital circles
conjunctive queries
energy consumption
b spline
special case