A framework for guaranteeing detection performance of a sensor network

Issue title: Performance Metrics for Intelligent Systems

Guest editors: Elena Messina

Article type: Research Article

Authors: Krishna, K. Madhava^a | Hexmoor, Henry^{b; *}

Affiliations: [a] International Institute of Information Technology, Hyderabad – 500 019, India. E-mail: [email protected] | [b] CSCE Department University of Arkansas, Fayetteville, AR 72701, USA. Tel.: +1 479 575 2420; Fax: +1 479 575 5339; E-mail: [email protected] | Intelligent Systems Division, National Institute of Standards and Technology (NIST), Gaithersburg, MD 20899-8230, USA. Fax: +1 301 990 9688; E-mail: [email protected]

Correspondence: [*] Corresponding author.

Abstract: We present a framework for modeling and analysis for a surveillance network consisting of multiple sensors. Sensors monitor targets that crisscross a rectangular surveillance zone. When a sensor pursuits a target it leaves areas unguarded through which other targets can get past undetected. A methodology that computes the tracking time for a sensor such that a fraction of the targets expected to cross its home area is detected to an arbitrary probabilistic guarantee is presented based on the framework. Targets enter the surveillance zone according to Poisson statistics. The time spent by a target within a sensor's home area follows uniform random statistics. The home area of the sensor is the area guarded by it when it is stationed at its home position, its default position when it is not in pursuit of a target. The framework is further extended to situations where multiple sensors monitor the same home area. Simulation results presented corroborate with the probabilistic framework developed and verify its correctness for single as well as multi-sensor cases.

DOI: 10.3233/ICA-2005-12308

Journal: Integrated Computer-Aided Engineering, vol. 12, no. 3, pp. 305-317, 2005