Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms

Coverage is a measure of the quality of surveillance offered by a given network of sensors over the field it protects. Geometric characterization of, and optimization problems pertaining to, a specific measure of coverage - maximal breach - form the subject matter of this paper. We prove lower bound results for maximal breach through its geometric characterization.We define a new measure called average maximal breach and design an optimal algorithm for it. We also show that a relaxed optimization problem for the proposed measure is NP-Hard.

[1]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[2]  Indranil Sengupta,et al.  Optimisation Problems Based on the Maximal Breach Path Measure for Wireless Sensor Network Coverage , 2006, ICDCIT.

[3]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[4]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[6]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7]  Arun K. Pujari,et al.  Q-Coverage Problem in Wireless Sensor Networks , 2009, ICDCN.

[8]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[9]  Miodrag Potkonjak,et al.  Worst and best-case coverage in sensor networks , 2005, IEEE Transactions on Mobile Computing.

[10]  Xiang-Yang Li,et al.  Coverage in wireless ad-hoc sensor networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[11]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[12]  Gaetano Borriello,et al.  Embedded computation meets the World Wide Web , 2000, Commun. ACM.

[13]  JORGE URRUTIA,et al.  Routing with guaranteed delivery in geometric and wireless networks , 2002 .

[14]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[15]  Ivan Stojmenovic,et al.  Handbook of Wireless Networks and Mobile Computing , 2002 .

[16]  Abder Koukam,et al.  The coverage problem in wireless sensor networks by holonic multi-agent approach , 2009 .