Probabilistic detection of mobile targets in heterogeneous sensor networks

  • Authors:

  • Loukas Lazos;Radha Poovendran;James A. Ritcey

  • Affiliations:

  • University of Washington, Seattle, WA;University of Washington, Seattle, WA;University of Washington, Seattle, WA

  • Venue:
  • Proceedings of the 6th international conference on Information processing in sensor networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Target detection and field surveillance are among the most prominent applications of Sensor Networks (SN). The quality of detection achieved by a SN can be quantified by evaluating the probability of detecting a mobile target crossing a Field of Interest (FoI). In this paper, we analytically evaluate the detection probability of mobile targets when N sensors are stochastically deployed to monitor a Fol. We map the target detection problem to a line-set intersection problem and derive analytical formulas using tools from Integral Geometry and Geometric Probability. We show that the detection probability depends on the length of the perimeters of the sensing areas of the sensors and not their shape. Hence, compared to prior work, our formulation allows us to consider a heterogeneous sensing model, where each sensor can have an arbitrary sensing area. We also evaluate the mean free path until a target is first detected.