z-logo
open-access-imgOpen Access
Probabilistic detection of mobile targets in heterogeneous sensor networks
Author(s) -
Loukas Lazos,
Radha Poovendran,
James A. Ritcey
Publication year - 2007
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/1236360.1236426
Subject(s) - probabilistic logic , intersection (aeronautics) , computer science , wireless sensor network , set (abstract data type) , field (mathematics) , path (computing) , algorithm , artificial intelligence , computer vision , mathematics , engineering , pure mathematics , aerospace engineering , computer network , programming language
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom