IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v13y2022i6d10.1007_s13198-022-01751-w.html
   My bibliography  Save this article

Routing protocol based ant colony optimization system for hybrid sensor and vehicular networks

Author

Listed:
  • Malika Sadou

    (University of Bejaia
    Research Center of Amazigh Language and Culture)

  • Louiza Bouallouche-Medjkoune

    (University of Bejaia)

Abstract

This paper investigates the proposition of a novel reliable routing protocol for Hybrid Sensor and Vehicular Networks. In this solution, we apply the concept of ant colony optimization meta-heuristic to route alert messages from a source node (a sensor node that detects any emerged event along a road) to the sink. In our proposed approach, the sink is responsible for predicting the best route that leads to itself. Thus, once a sensor node detects any event, the packets will be conducted to the sink following a predefined optimal path already calculated by the sink. This mechanism allows the timely delivery of alert messages from the source node to the sink and incites sensor nodes to preserve their energy by minimizing their involvement in relay tasks. The simulation results show that our solution has the capability of finding an optimal and faster solution using fewer sensor nodes and possesses strong robustness.

Suggested Citation

  • Malika Sadou & Louiza Bouallouche-Medjkoune, 2022. "Routing protocol based ant colony optimization system for hybrid sensor and vehicular networks," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(6), pages 2855-2864, December.
    • Handle: RePEc:spr:ijsaem:v:13:y:2022:i:6:d:10.1007_s13198-022-01751-w
    DOI: 10.1007/s13198-022-01751-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-022-01751-w
    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/s13198-022-01751-w?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. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    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. Yuxin Liu & Zihang Qin & Jin Liu, 2023. "An Improved Genetic Algorithm for the Granularity-Based Split Vehicle Routing Problem with Simultaneous Delivery and Pickup," Mathematics, MDPI, vol. 11(15), pages 1-15, July.
    2. Bombelli, Alessandro & Fazi, Stefano, 2022. "The ground handler dock capacitated pickup and delivery problem with time windows: A collaborative framework for air cargo operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    3. Nadia Giuffrida & Jenny Fajardo-Calderin & Antonio D. Masegosa & Frank Werner & Margarete Steudter & Francesco Pilla, 2022. "Optimization and Machine Learning Applied to Last-Mile Logistics: A Review," Sustainability, MDPI, vol. 14(9), pages 1-16, April.
    4. Ines Sbai & Saoussen Krichen & Olfa Limam, 2022. "Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the Tunisian Post Office," Operational Research, Springer, vol. 22(1), pages 507-549, March.
    5. Osicka, Ondrej & Guajardo, Mario & van Oost, Thibault, 2018. "Cooperative game-theoretic features of cost sharing in location-routing," Discussion Papers 2018/11, Norwegian School of Economics, Department of Business and Management Science.
    6. Maria Gulnara Baldoquin & Jairo A Martinez & Jenny Díaz-Ramírez, 2020. "A unified model framework for the multi-attribute consistent periodic vehicle routing problem," PLOS ONE, Public Library of Science, vol. 15(8), pages 1-27, August.

    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:ijsaem:v:13:y:2022:i:6:d:10.1007_s13198-022-01751-w. 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.