A robust sensor covering and communication problem

A robust sensor covering and communication problem

0.00 Avg rating0 Votes
Article ID: iaor2016413
Volume: 62
Issue: 7
Start Page Number: 582
End Page Number: 594
Publication Date: Oct 2015
Journal: Naval Research Logistics (NRL)
Authors: , ,
Keywords: design, combinatorial optimization, communications, location, heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.