Optimal placement of multiple types of communicating sensors with availability and coverage redundancy constraints

Sergey N. Vecherin; D. Keith Wilson; Chris L. Pettit

doi:10.1117/12.849327

22 April 2010 Optimal placement of multiple types of communicating sensors with availability and coverage redundancy constraints

Sergey N. Vecherin, D. Keith Wilson, Chris L. Pettit

Author Affiliations +

Proceedings Volume 7694, Ground/Air Multi-Sensor Interoperability, Integration, and Networking for Persistent ISR; 76940U (2010) https://doi.org/10.1117/12.849327
Event: SPIE Defense, Security, and Sensing, 2010, Orlando, Florida, United States

Abstract

Determination of an optimal configuration (numbers, types, and locations) of a sensor network is an important practical problem. In most applications, complex signal propagation effects and inhomogeneous coverage preferences lead to an optimal solution that is highly irregular and nonintuitive. The general optimization problem can be strictly formulated as a binary linear programming problem. Due to the combinatorial nature of this problem, however, its strict solution requires significant computational resources (NP-complete class of complexity) and is unobtainable for large spatial grids of candidate sensor locations. For this reason, a greedy algorithm for approximate solution was recently introduced [S. N. Vecherin, D. K. Wilson, and C. L. Pettit, "Optimal sensor placement with terrain-based constraints and signal propagation effects," Unattended Ground, Sea, and Air Sensor Technologies and Applications XI, SPIE Proc. Vol. 7333, paper 73330S (2009)]. Here further extensions to the developed algorithm are presented to include such practical needs and constraints as sensor availability, coverage by multiple sensors, and wireless communication of the sensor information. Both communication and detection are considered in a probabilistic framework. Communication signal and signature propagation effects are taken into account when calculating probabilities of communication and detection. Comparison of approximate and strict solutions on reduced-size problems suggests that the approximate algorithm yields quick and good solutions, which thus justifies using that algorithm for full-size problems. Examples of three-dimensional outdoor sensor placement are provided using a terrain-based software analysis tool.

Citation Download Citation

Sergey N. Vecherin, D. Keith Wilson, and Chris L. Pettit "Optimal placement of multiple types of communicating sensors with availability and coverage redundancy constraints", Proc. SPIE 7694, Ground/Air Multi-Sensor Interoperability, Integration, and Networking for Persistent ISR, 76940U (22 April 2010); https://doi.org/10.1117/12.849327

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available