Optimization of steerable sensor network for threat detection

Anton Molyboha, Michael Zabarankin

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A Markov chain approach to detecting a threat in a given surveillance zone by a network of steerable sensors is presented. The network has a finite number of predetermined states, and transition from one state to another follows a Markov chain. Under the assumption that the threat avoids detection, two game theoretic problems for finding an optimal Markov chain (two surveillance strategies) are formulated: the first maximizes the probability of threat detection for two consecutive detection periods, whereas the second minimizes the average time of detection for the worst-case threat's trajectory. Both problems are reduced to linear programming, and special techniques are suggested to solve them. For a dynamic environment with moving noise sources, the optimal Markov chain changes at each detection period, and the rate of convergence of the Markov chain to its stationary distribution is analyzed. Both surveillance strategies are tested in numerical experiments and compared one with another.

Original languageEnglish
Pages (from-to)564-577
Number of pages14
JournalNaval Research Logistics
Volume58
Issue number6
DOIs
StatePublished - Sep 2011

Keywords

  • Markov chain
  • optimization
  • sensor network
  • steerable sensor
  • threat detection

Fingerprint

Dive into the research topics of 'Optimization of steerable sensor network for threat detection'. Together they form a unique fingerprint.

Cite this