IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v45y2013i10p1094-1113.html
   My bibliography  Save this article

The lifetime maximization problem in wireless sensor networks with a mobile sink: mixed-integer programming formulations and algorithms

Author

Listed:
  • Behnam Behdani
  • J. Smith
  • Ye Xia

Abstract

This article considers the problem of maximizing the lifetime of a wireless sensor network with a mobile sink. The sink travels at finite speed among a subset of possible sink locations to collect data from a stationary set of sensor nodes. The considered problem chooses a subset of sink locations for the sink to visit, finds a tour for the sink among the selected sink locations, and prescribes an optimal data routing scheme from the sensor nodes to each location visited by the sink. The sink’s tour is constrained by the time it spends at each location collecting data. Two variations of this problem are examined based on assumptions regarding delay tolerance. Exact mixed-integer programming formulations to model this problem are provided along with cutting planes, preprocessing techniques, and a Benders decomposition algorithm to improve its solvability. Computational results demonstrate the effectiveness of the proposed methods.

Suggested Citation

  • 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.
    • Handle: RePEc:taf:uiiexx:v:45:y:2013:i:10:p:1094-1113
    DOI: 10.1080/0740817X.2013.770189
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2013.770189
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2013.770189?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.

    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:taf:uiiexx:v:45:y:2013:i:10:p:1094-1113. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.