IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v63y2016i4d10.1007_s11235-016-0140-z.html
   My bibliography  Save this article

Energy-efficient multiple itinerary planning for mobile agents-based data aggregation in WSNs

Author

Listed:
  • Damianos Gavalas

    (University of the Aegean)

  • Ioannis E. Venetis

    (Technological Educational Institution of Athens)

  • Charalampos Konstantopoulos

    (University of Piraeus)

  • Grammati Pantziou

    (Technological Educational Institution of Athens)

Abstract

Data aggregation is recognized as a key method for reducing the amount of network traffic and the energy consumption on wireless sensor network nodes. Mobile agent (MA) technology represents a distributed computing paradigm which has been proposed as a means for increasing the energy efficiency of data aggregation tasks and addressing the scalability problems of centralized methods. Nevertheless, the itineraries followed by travelling MAs largely determine the overall performance of the data aggregation applications. Along this line, this article introduces a novel algorithmic approach for energy-efficient itinerary planning of MAs engaged in data aggregation tasks. Our algorithm adopts an iterated local search approach in deriving the hop sequence of multiple travelling MAs over the deployed source nodes. Simulation results demonstrate the performance gain of our method against existing multiple MA itinerary planning methods.

Suggested Citation

  • Damianos Gavalas & Ioannis E. Venetis & Charalampos Konstantopoulos & Grammati Pantziou, 2016. "Energy-efficient multiple itinerary planning for mobile agents-based data aggregation in WSNs," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 63(4), pages 531-545, December.
    • Handle: RePEc:spr:telsys:v:63:y:2016:i:4:d:10.1007_s11235-016-0140-z
    DOI: 10.1007/s11235-016-0140-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-016-0140-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-016-0140-z?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. Gaddafi Abdul-Salaam & Abdul Hanan Abdullah & Mohammad Hossein Anisi & Abdullah Gani & Abdulhameed Alelaiwi, 2016. "A comparative analysis of energy conservation approaches in hybrid wireless sensor networks data collection protocols," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 61(1), pages 159-179, January.
    2. Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
    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. Hyunchong Cho & Seungmin Oh & Yongje Shin & Euisin Lee, 2021. "Energy-Efficient and Disjoint Multipath Using Face Routing in Wireless Sensor Networks," Energies, MDPI, vol. 14(22), pages 1-25, November.

    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. Maryam Ataei & Ali Divsalar & Morteza Saberi, 2024. "The bi-objective orienteering problem with hotel selection: an integrated text mining optimisation approach," Information Technology and Management, Springer, vol. 25(3), pages 247-275, September.
    2. Alireza Abdollahi & Karim Rejeb & Abderahman Rejeb & Mohamed M. Mostafa & Suhaiza Zailani, 2021. "Wireless Sensor Networks in Agriculture: Insights from Bibliometric Analysis," Sustainability, MDPI, vol. 13(21), pages 1-22, October.
    3. Dang, Duc-Cuong & Guibadj, Rym Nesrine & Moukrim, Aziz, 2013. "An effective PSO-inspired algorithm for the team orienteering problem," European Journal of Operational Research, Elsevier, vol. 229(2), pages 332-344.
    4. Ido Orenstein & Tal Raviv & Elad Sadan, 2019. "Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 683-711, December.
    5. Morteza Keshtkaran & Koorush Ziarati & Andrea Bettinelli & Daniele Vigo, 2016. "Enhanced exact solution methods for the Team Orienteering Problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 591-601, January.
    6. Evers, Lanah & Barros, Ana Isabel & Monsuur, Herman & Wagelmans, Albert, 2014. "Online stochastic UAV mission planning with time windows and time-sensitive targets," European Journal of Operational Research, Elsevier, vol. 238(1), pages 348-362.
    7. Alessandro Hill & Roberto Baldacci & Edna Ayako Hoshino, 2019. "Capacitated ring arborescence problems with profits," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 357-389, June.
    8. Thomas Collerton & Andrea Marrella & Massimo Mecella & Tiziana Catarci, 2017. "Route Recommendations to Business Travelers Exploiting Crowd-Sourced Data," DIAG Technical Reports 2017-07, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    9. Şahinyazan, Feyza Güliz & Kara, Bahar Y. & Taner, Mehmet Rüştü, 2015. "Selective vehicle routing for a mobile blood donation system," European Journal of Operational Research, Elsevier, vol. 245(1), pages 22-34.
    10. Matteo Fischetti & Ivana Ljubić & Michele Monaci & Markus Sinnl, 2019. "Interdiction Games and Monotonicity, with Application to Knapsack Problems," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 390-410, April.
    11. Kobeaga, Gorka & Rojas-Delgado, Jairo & Merino, María & Lozano, Jose A., 2024. "A revisited branch-and-cut algorithm for large-scale orienteering problems," European Journal of Operational Research, Elsevier, vol. 313(1), pages 44-68.
    12. Stacy A. Voccia & Ann Melissa Campbell & Barrett W. Thomas, 2019. "The Same-Day Delivery Problem for Online Purchases," Service Science, INFORMS, vol. 53(1), pages 167-184, February.
    13. Freeman, Nickolas K. & Keskin, Burcu B. & Çapar, İbrahim, 2018. "Attractive orienteering problem with proximity and timing interactions," European Journal of Operational Research, Elsevier, vol. 266(1), pages 354-370.
    14. Verbeeck, C. & Sörensen, K. & Aghezzaf, E.-H. & Vansteenwegen, P., 2014. "A fast solution method for the time-dependent orienteering problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 419-432.
    15. Jesse Pietz & Johannes O. Royset, 2013. "Generalized orienteering problem with resource dependent rewards," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 294-312, June.
    16. Evers, L. & Glorie, K.M. & van der Ster, S. & Barros, A.I. & Monsuur, H., 2012. "The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared," Econometric Institute Research Papers EI 2012-21, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    17. Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
    18. Enrique Benavent & Ángel Corberán & Luís Gouveia & Maria Mourão & Leonor Pinto, 2015. "Profitable mixed capacitated arc routing and related problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 244-274, April.
    19. Maximilian Schiffer & Michael Schneider & Grit Walther & Gilbert Laporte, 2019. "Vehicle Routing and Location Routing with Intermediate Stops: A Review," Transportation Science, INFORMS, vol. 53(2), pages 319-343, March.
    20. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.

    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:spr:telsys:v:63:y:2016:i:4:d:10.1007_s11235-016-0140-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.