IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v260y2017i1p291-304.html
   My bibliography  Save this article

A column generation heuristic for optimal wireless sensor network design with mobile sinks

Author

Listed:
  • Keskin, Muhammed Emre

Abstract

Wireless Sensor Networks (WSNs) consist of a high number of tiny, multi-functional, electronic devices called sensors. They collectively provide a distributed environment that is capable of monitoring remote areas. Collected information is transmitted in a direct or multi-hop fashion to the gateway nodes called sinks. An even distribution of energy loads among the sensors is critical for elongating network lifetime. There are four main WSN design issues that substantially affect the distribution of the energy: locations of the sensors, schedule of the active and standby periods of the sensors, trajectory of the mobile sink(s) and routes for data flows. As a result, many studies try to make energy usage more efficient by optimal determination of these design issues. However, only a few of them provide a unified frame in which all four design issues are integrated. In this work, we follow this line of research and propose a column generation heuristic for a Mixed Integer Linear Programing (MILP) model that integrates all design issues. Based on the extensive numerical experiments, we can say that the heuristic outperforms its competitors in the literature.

Suggested Citation

  • Keskin, Muhammed Emre, 2017. "A column generation heuristic for optimal wireless sensor network design with mobile sinks," European Journal of Operational Research, Elsevier, vol. 260(1), pages 291-304.
  • Handle: RePEc:eee:ejores:v:260:y:2017:i:1:p:291-304
    DOI: 10.1016/j.ejor.2016.12.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716310256
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2016.12.006?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.

    References listed on IDEAS

    as
    1. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    2. Lersteau, Charly & Rossi, André & Sevaux, Marc, 2016. "Robust scheduling of wireless sensor networks for target tracking under uncertainty," European Journal of Operational Research, Elsevier, vol. 252(2), pages 407-417.
    3. Y B Türkoğulları & N Aras & İ K Altınel & C Ersoy, 2010. "Optimal placement, scheduling, and routing to maximize lifetime in sensor networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(6), pages 1000-1012, June.
    4. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    5. TürkogullarI, Yavuz B. & Aras, Necati & AltInel, I. Kuban & Ersoy, Cem, 2010. "A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks," European Journal of Operational Research, Elsevier, vol. 207(2), pages 1014-1026, December.
    6. Xia, Li & Shihada, Basem, 2015. "A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 778-787.
    7. Castaño, Fabian & Bourreau, Eric & Velasco, Nubia & Rossi, André & Sevaux, Marc, 2015. "Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks," European Journal of Operational Research, Elsevier, vol. 241(1), pages 28-38.
    8. Silvano Martello & David Pisinger & Paolo Toth, 1999. "Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem," Management Science, INFORMS, vol. 45(3), pages 414-424, March.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Calvete, Herminia I. & del-Pozo, Lourdes & Iranzo, José A., 2018. "Dealing with residual energy when transmitting data in energy-constrained capacitated networks," European Journal of Operational Research, Elsevier, vol. 269(2), pages 602-620.

    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. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "An improved cut-and-solve algorithm for the single-source capacitated facility location problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 1-27, March.
    2. Cerulli, R. & De Donato, R. & Raiconi, A., 2012. "Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges," European Journal of Operational Research, Elsevier, vol. 220(1), pages 58-66.
    3. Simon Görtz & Andreas Klose, 2012. "A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 597-610, November.
    4. Raidl, Günther R., 2015. "Decomposition based hybrid metaheuristics," European Journal of Operational Research, Elsevier, vol. 244(1), pages 66-76.
    5. Lersteau, Charly & Rossi, André & Sevaux, Marc, 2018. "Minimum energy target tracking with coverage guarantee in wireless sensor networks," European Journal of Operational Research, Elsevier, vol. 265(3), pages 882-894.
    6. Lixin Tang & Gongshu Wang & Jiyin Liu & Jingyi Liu, 2011. "A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(4), pages 370-388, June.
    7. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    8. M Büther, 2010. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1582-1595, November.
    9. M Diaby & A L Nsakanda, 2006. "Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1100-1112, September.
    10. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    11. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    12. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    13. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
    14. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    15. Keliang Wang & Leonardo Lozano & Carlos Cardonha & David Bergman, 2023. "Optimizing over an Ensemble of Trained Neural Networks," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 652-674, May.
    16. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    17. Alexandre Belloni & Mitchell J. Lovett & William Boulding & Richard Staelin, 2012. "Optimal Admission and Scholarship Decisions: Choosing Customized Marketing Offers to Attract a Desirable Mix of Customers," Marketing Science, INFORMS, vol. 31(4), pages 621-636, July.
    18. Arabatzis, Garyfallos & Petridis, Konstantinos & Galatsidas, Spyros & Ioannou, Konstantinos, 2013. "A demand scenario based fuelwood supply chain: A conceptual model," Renewable and Sustainable Energy Reviews, Elsevier, vol. 25(C), pages 687-697.
    19. M Hifi & M Michrafy, 2006. "A reactive local search-based algorithm for the disjunctively constrained knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 718-726, June.
    20. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.

    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:eee:ejores:v:260:y:2017:i:1:p:291-304. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.