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

Authors:
Wei-Chieh Ke;Bing-Hong Liu;Ming-Jer Tsai
Affiliations:
-;-;-
Venue:
IEEE Transactions on Computers
Year:
2007

Citing 8
Cited 8

Unit disk graphs

Discrete Mathematics - Topics on domination
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks

Autonomous Robots
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks

IEEE Transactions on Computers
Sensor deployment and target localization in distributed sensor networks

ACM Transactions on Embedded Computing Systems (TECS)
Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks

IEEE Transactions on Computers
Soft Tamper-Proofing via Program Integrity Verification in Wireless Sensor Networks

IEEE Transactions on Mobile Computing
A Distributed Coverage- and Connectivity-Centric Technique for Selecting Active Nodes in Wireless Sensor Networks

IEEE Transactions on Computers
Automatic mesh generation for mobile network dimensioning using evolutionary approach

IEEE Transactions on Evolutionary Computation

TALONet: a power-efficient grid-based congestion avoidance scheme using multi-detouring technique in wireless sensor networks

WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
Area coverage based domain division in wireless sensor network

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Constrained relay node placement in wireless sensor networks: formulation and approximations

IEEE/ACM Transactions on Networking (TON)
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Coverage problems in sensor networks: A survey

ACM Computing Surveys (CSUR)
The critical-square-grid coverage problem in wireless sensor networks is NP-Complete

Computer Networks: The International Journal of Computer and Telecommunications Networking
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks

Theoretical Computer Science
Ant colony optimization with greedy migration mechanism for node deployment in wireless sensor networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	14.98

Visualization

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.