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

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.

[1]  Xiang Cao,et al.  Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[2]  Yu-Chee Tseng,et al.  Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network , 2007, TOSN.

[3]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[4]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[5]  Aiguo Song,et al.  Self-Deployment of Mobile Sensor Networks in Complex Indoor Environments , 2006, 2006 6th World Congress on Intelligent Control and Automation.

[6]  Bing-Hong Liu,et al.  Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks with Unidirectional Links , 2009, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[7]  Mohamed A. Elgamel,et al.  A Lightweight Collaborative Fault Tolerant Target Localization System for Wireless Sensor Networks , 2009, IEEE Transactions on Mobile Computing.

[8]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[9]  Pramod K. Varshney,et al.  Energy-efficient deployment of Intelligent Mobile sensor networks , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[10]  Bing-Hong Liu,et al.  Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Points Is NP-Complete , 2007, IEEE Transactions on Computers.

[11]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[12]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[13]  Pramod K. Varshney,et al.  An intelligent deployment and clustering algorithm for a distributed mobile sensor network , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[14]  Jiming Chen,et al.  Grid Scan: A Simple and Effective Approach for Coverage Issue in Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[15]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[16]  Sartaj Sahni,et al.  Minimum-cost sensor coverage of planar regions , 2008, 2008 11th International Conference on Information Fusion.

[17]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[18]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[19]  Yuanyuan Yang,et al.  Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks , 2007, IEEE Trans. Computers.

[20]  Frank Hoffmann,et al.  The art gallery theorem for polygons with holes , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[21]  Pramod K. Varshney,et al.  Estimation of spatially distributed processes in wireless sensor networks with random packet loss , 2009, IEEE Transactions on Wireless Communications.

[22]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[23]  Abraham O. Fapojuwo,et al.  Energy consumption and message delay analysis of QoS enhanced base station controlled dynamic clustering protocol for wireless sensor networks , 2009, IEEE Transactions on Wireless Communications.

[24]  Hongyi Wu,et al.  Grid-based approach for working node selection in wireless sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[25]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[26]  Dong Xuan,et al.  On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[27]  Pei-Ling Chiu,et al.  A simulated annealing algorithm for energy-efficient sensor network design , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).

[28]  Ronald L. Graham,et al.  Some NP-complete geometric problems , 1976, STOC '76.

[29]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[30]  P. C. Schuur,et al.  Covering a Rectangle with Six and Seven Circles , 2000, Discret. Appl. Math..

[31]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization in distributed sensor networks , 2004, TECS.

[32]  Krishnendu Chakrabarty,et al.  A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks , 2005, IEEE Transactions on Computers.

[33]  S. Sitharama Iyengar,et al.  Sensor placement for grid coverage under imprecise detections , 2002, Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997).

[34]  Kyung-Joon Park,et al.  Design and analysis of asynchronous wakeup for wireless sensor networks , 2009, IEEE Transactions on Wireless Communications.

[35]  Kari J. Nurmela,et al.  Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles , 2000, Exp. Math..

[36]  Chih-Yung Chang,et al.  Obstacle-Resistant Deployment Algorithms for Wireless Sensor Networks , 2009, IEEE Transactions on Vehicular Technology.

[37]  C. Siva Ram Murthy,et al.  Energy Efficient and Scalable Search in Dense Wireless Sensor Networks , 2009, IEEE Transactions on Computers.