On efficient deployment of sensors on planar grid

One practical goal of sensor deployment in the design of distributed sensor systems is to achieve an optimal monitoring and surveillance of a target region. The optimality of a sensor deployment scheme is a tradeoff between implementation cost and coverage quality levels. In this paper, we consider a probabilistic sensing model that provides different sensing capabilities in terms of coverage range and detection quality with different costs. A sensor deployment problem for a planar grid region is formulated as a combinatorial optimization problem with the objective of maximizing the overall detection probability within a given deployment cost. This problem is shown to be NP-complete and an approximate solution is proposed based on a two-dimensional genetic algorithm. The solution is obtained by the specific choices of genetic encoding, fitness function, and genetic operators such as crossover, mutation, translocation for this problem. Simulation results of various problem sizes are presented to show the benefits of this method as well as its comparative performance with a greedy sensor placement method.

[1]  David M. Mount,et al.  A local search approximation algorithm for k-means clustering , 2002, SCG '02.

[2]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[3]  Satish Rao,et al.  A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem , 1999, ESA.

[4]  Satish Rao,et al.  A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem , 2007, SIAM J. Comput..

[5]  Sulema Aranda,et al.  On Optimal Sensor Placement and Motion Coordination for Target Tracking , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[6]  Min Wu,et al.  Coordinated sensor deployment for improving secure communications and sensing coverage , 2005, SASN '05.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Satish Rao,et al.  Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.

[9]  Leonidas J. Guibas,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Environment , 1997, WADS.

[10]  Baltasar Beferull-Lozano,et al.  Power-efficient sensor placement and transmission structure for data gathering under distortion constraints , 2006, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

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

[12]  S. Iyengar,et al.  Multi-Sensor Fusion: Fundamentals and Applications With Software , 1997 .

[13]  S. Sitharama Iyengar,et al.  Advances in Distributed Sensor Integration; Application and Theory , 1995 .

[14]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[15]  Parameswaran Ramanathan,et al.  Sensor deployment strategy for target detection , 2002, WSNA '02.

[16]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[17]  C. L. Liu,et al.  Introduction to Combinatorial Mathematics. , 1971 .

[18]  Deborah Estrin,et al.  Adaptive beacon placement , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[20]  David M. Mount,et al.  A local search approximation algorithm for k-means clustering , 2004, Comput. Geom..

[21]  David Coley,et al.  Introduction to Genetic Algorithms for Scientists and Engineers , 1999 .

[22]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[23]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[24]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[25]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[26]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[27]  Deborah Estrin,et al.  Scalable, Ad Hoc Deployable, RF-Based Localization , 2002 .

[28]  S. Sitharama Iyengar,et al.  Coding theory framework for target location in distributed sensor networks , 2001, Proceedings International Conference on Information Technology: Coding and Computing.