A robust sensor covering and communication problem |
| |
| Authors: | Andrew Romich Guanghui Lan J Cole Smith |
| |
| Affiliation: | 1. Weapon Systems, Sandia National Laboratories, Livermore, California;2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida;3. Department of Industrial Engineering, Clemson University, Clemson, South Carolina |
| |
| 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 |
| |
| Keywords: | sensor placement network optimization cutting planes |
|
|
