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

Scheduling for data gathering networks with data compression

Author

Listed:
  • Berlińska, Joanna

Abstract

This paper analyzes scheduling in a data gathering network with data compression. The nodes of the network collect some data and pass them to a single base station. Each node can, at some cost, preprocess the data before sending it, in order to decrease its size. Our goal is to transfer all data to the base station in given time, at the minimum possible cost. We prove that the decision version of this scheduling problem is NP-complete. Polynomial-time heuristic algorithms for solving the problem are proposed and tested in a series of computational experiments.

Suggested Citation

  • Berlińska, Joanna, 2015. "Scheduling for data gathering networks with data compression," European Journal of Operational Research, Elsevier, vol. 246(3), pages 744-749.
  • Handle: RePEc:eee:ejores:v:246:y:2015:i:3:p:744-749
    DOI: 10.1016/j.ejor.2015.05.026
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2015.05.026?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. Alfieri, A. & Bianco, A. & Brandimarte, P. & Chiasserini, C.F., 2007. "Maximizing system lifetime in wireless sensor networks," European Journal of Operational Research, Elsevier, vol. 181(1), pages 390-402, August.
    2. Rossi, André & Singh, Alok & Sevaux, Marc, 2013. "Lifetime maximization in wireless directional sensor network," European Journal of Operational Research, Elsevier, vol. 231(1), pages 229-241.
    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. Luo, Wenchang & Gu, Boyuan & Lin, Guohui, 2018. "Communication scheduling in data gathering networks of heterogeneous sensors with data compression: Algorithms and empirical experiments," European Journal of Operational Research, Elsevier, vol. 271(2), pages 462-473.
    2. André Rossi & Alok Singh & Marc Sevaux, 2021. "Focus distance-aware lifetime maximization of video camera-based wireless sensor networks," Journal of Heuristics, Springer, vol. 27(1), pages 5-30, April.
    3. 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.
    4. Amir Hossein Mohajerzadeh & Hasan Jahedinia & Zahra Izadi-Ghodousi & Dariush Abbasinezhad-Mood & Mahdi Salehi, 2018. "Efficient target tracking in directional sensor networks with selective target area’s coverage," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 68(1), pages 47-65, May.
    5. Rossi, André & Singh, Alok & Sevaux, Marc, 2013. "Lifetime maximization in wireless directional sensor network," European Journal of Operational Research, Elsevier, vol. 231(1), pages 229-241.
    6. Xiaojun Zhu & Guihai Chen & Shaojie Tang & Xiaobing Wu & Bing Chen, 2016. "Fast Approximation Algorithm for Maximum Lifetime Aggregation Trees in Wireless Sensor Networks," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 417-431, August.
    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. Li, Xiangyong & Aneja, Y.P. & Huo, Jiazhen, 2012. "A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem," Omega, Elsevier, vol. 40(2), pages 210-217, April.
    9. 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.
    10. 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.
    11. Astorino, Annabella & Gaudioso, Manlio & Miglionico, Giovanna, 2018. "Lagrangian relaxation for the directional sensor coverage problem with continuous orientation," Omega, Elsevier, vol. 75(C), pages 77-86.

    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:246:y:2015:i:3:p:744-749. 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.