On efficient deployment of sensors on planar grid

  • Authors:

  • Qishi Wu;Nageswara S. V. Rao;Xiaojiang Du;S. Sitharama Iyengar;Vijay K. Vaishnavi

  • Affiliations:

  • Department of Computer Science, University Of Memphis, Memphis, TN 38152, USA;Computer Science and Mathematics Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831-6355, USA;Department of Computer Science, North Dakota State University, Fargo, ND 58105, USA;Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803, USA;Department of Computer Information Systems, Georgia State University, Atlanta, GA 30302, USA

  • Venue:
  • Computer Communications
  • Year:
  • 2007

Quantified Score

Hi-index 0.25

Visualization

Abstract

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.