IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v62y2015i7p582-594.html
   My bibliography  Save this article

A robust sensor covering and communication problem

Author

Listed:
  • Andrew Romich
  • Guanghui Lan
  • J. Cole Smith

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

Suggested Citation

  • Andrew Romich & Guanghui Lan & J. Cole Smith, 2015. "A robust sensor covering and communication problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(7), pages 582-594, October.
    • Handle: RePEc:wly:navres:v:62:y:2015:i:7:p:582-594
    DOI: 10.1002/nav.21665
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21665
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21665?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Takafumi Kanamori & Akiko Takeda, 2012. "Worst-Case Violation of Sampled Convex Programs for Optimization with Uncertainty," Journal of Optimization Theory and Applications, Springer, vol. 152(1), pages 171-197, January.
    2. Ahmed Ghoniem & Hanif Sherali, 2011. "Defeating symmetry in combinatorial optimization via objective perturbations and hierarchical constraints," IISE Transactions, Taylor & Francis Journals, vol. 43(8), pages 575-588.
    3. Behnam Behdani & J. Smith & Ye Xia, 2013. "The lifetime maximization problem in wireless sensor networks with a mobile sink: mixed-integer programming formulations and algorithms," IISE Transactions, Taylor & Francis Journals, vol. 45(10), pages 1094-1113.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hanif D. Sherali & Ki-Hwan Bae & Mohamed Haouari, 2013. "An Integrated Approach for Airline Flight Selection and Timing, Fleet Assignment, and Aircraft Routing," Transportation Science, INFORMS, vol. 47(4), pages 455-476, November.
    2. Brian Lunday & Hanif Sherali & Kevin Lunday, 2012. "The coastal seaspace patrol sector design and allocation problem," Computational Management Science, Springer, vol. 9(4), pages 483-514, November.
    3. Azrah Anparasan & Miguel Lejeune, 2019. "Resource deployment and donation allocation for epidemic outbreaks," Annals of Operations Research, Springer, vol. 283(1), pages 9-32, December.
    4. Bo Wei & William B. Haskell & Sixiang Zhao, 2020. "The CoMirror algorithm with random constraint sampling for convex semi-infinite programming," Annals of Operations Research, Springer, vol. 295(2), pages 809-841, December.
    5. Ramponi, Federico Alessandro & Campi, Marco C., 2018. "Expected shortfall: Heuristics and certificates," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1003-1013.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:62:y:2015:i:7:p:582-594. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.