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

  • Authors:

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

  • Affiliations:

  • Department of Computer Science, National Tsing Hua University, 101, Kuang Fu Rd., Sec. 2, Hsinchu 30013, Taiwan, ROC;Department of Electronic Engineering, National Kaohsiung University of Applied Sciences, 415, Chien Kung Rd., Kaohsiung 80778, Taiwan, ROC;Department of Computer Science, National Tsing Hua University, 101, Kuang Fu Rd., Sec. 2, Hsinchu 30013, Taiwan, ROC

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Wireless sensor networks are formed by connected sensors, each of which has the ability to collect, process, and store environmental information as well as communicate with others via inter-sensor wireless communication. These characteristics allow wireless sensor networks to be used in a wide range of applications. In many applications, such as smart home, fire fighting system, nuclear, biological, and chemical (NBC) attack detection, and so on, critical areas and common areas must be distinguished adequately. It is more practical and efficient to monitor critical areas rather than common areas if the sensor field is large, or the available budget cannot provide enough sensors to fully cover the entire field. In most available state-of-the-art sensor deployment algorithms, the sensor field is divided into square grid cells and sensors are deployed on constrained locations such as grid points. To study the computational complexity of sensor deployment, the problem of deploying the minimum number of sensors on grid points to construct a wireless sensor network fully covering critical square grid cells, termed critical-square-grid coverage, is introduced and shown to be NP-Complete in this paper.