A robust sensor covering and communication problem
Abstract
We consider the problem of placing sensors across some area of interest. The sensors must be placed so that they cover a fixed set of targets in the region, and should be deployed in a manner that allows sensors to communicate with one another. In particular, there exists a measure of communication effectiveness for each sensor pair, which is determined by a concave function of distance between the sensors. Complicating the sensor location problem are uncertainties related to sensor placement, for example, as caused by drifting due to air or water currents to which the sensors may be subjected. Our problem thus seeks to maximize a metric regarding intrasensor communication effectiveness, subject to the condition that all targets must be covered by some sensor, where sensor drift occurs according to a robust (worst‐case) mechanism. We formulate an approximation approach and develop a cutting‐plane algorithm to solve this problem, comparing the effectiveness of two different classes of inequalities. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 582–594, 2015
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Oct 01, 2015
- Source ID
- 10.1002/nav.21665
Entities
People
- Andrew Romich
- Guanghui Lan
- J. Cole Smith
Organizations
- Clemson University
- Defense Threat Reduction Agency
- National Science Foundation
- Office of Naval Research
- Sandia National Laboratories
- University of Florida