Get access

Optimization of steerable sensor network for threat detection

Authors

  • Anton Molyboha,

    1. Department of Mathematical Sciences, Stevens Institute of Technology, Castle Point on Hudson, Hoboken, New Jersey 07030
    Search for more papers by this author
  • Michael Zabarankin

    Corresponding author
    1. Department of Mathematical Sciences, Stevens Institute of Technology, Castle Point on Hudson, Hoboken, New Jersey 07030
    • Department of Mathematical Sciences, Stevens Institute of Technology, Castle Point on Hudson, Hoboken, New Jersey 07030
    Search for more papers by this author

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. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011

Ancillary