A robust sensor covering and communication problem

Andrew Romich, Guanghui Lan, J. Cole Smith

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)582-594
Number of pages13
JournalNaval Research Logistics
Issue number7
StatePublished - Oct 1 2015
Externally publishedYes


  • cutting planes
  • network optimization
  • sensor placement

ASJC Scopus subject areas

  • Modeling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research


Dive into the research topics of 'A robust sensor covering and communication problem'. Together they form a unique fingerprint.

Cite this