IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v656y2024ics0378437124007052.html

Self-organized efficient transmission in dynamic networks

Author

Listed:
  • Neta, Pedro D.
  • Araújo, Nuno A.M.
  • de Arcangelis, Lucilla
  • Garofalo, Jacopo Alexander
  • Sarracino, Alessandro
  • Lippiello, Eugenio

Abstract

Effective protocols are needed to ensure successful transmission of signals, messages, or parcels through a network of intermediaries. Existing studies often overlook real-world constraints such as limited resources. We investigate the design of efficient and robust transmission strategies in dynamic networks subject to dissipation and resource limited node activity, as in wireless sensor networks. We find that dissipation and randomness can enhance transmission efficiency and network resilience. For a broad family of protocols, a self-organized dynamics assures global connectivity, even in the limit of low density of links, where random networks fail.

Suggested Citation

  • Neta, Pedro D. & Araújo, Nuno A.M. & de Arcangelis, Lucilla & Garofalo, Jacopo Alexander & Sarracino, Alessandro & Lippiello, Eugenio, 2024. "Self-organized efficient transmission in dynamic networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 656(C).
    • Handle: RePEc:eee:phsmap:v:656:y:2024:i:c:s0378437124007052
    DOI: 10.1016/j.physa.2024.130196
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437124007052
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2024.130196?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    2. Tiago A. Schieber & Laura C. Carpi & Panos M. Pardalos & Cristina Masoller & Albert Díaz-Guilera & Martín G. Ravetti, 2023. "Diffusion capacity of single and interconnected networks," Nature Communications, Nature, vol. 14(1), pages 1-9, December.
    3. 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.
    4. Consiglio, R. & Baker, D.R. & Paul, G. & Stanley, H.E., 2003. "Continuum percolation thresholds for mixtures of spheres of different sizes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 319(C), pages 49-55.
    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. Orenstein, Ido & Raviv, Tal, 2022. "Parcel delivery using the hyperconnected service network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    2. Sapan Tiwari & Neema Nassir & Patricia Sauri Lavieri, 2024. "Smart Insertion Strategies for Sustainable Operation of Shared Autonomous Vehicles," Sustainability, MDPI, vol. 16(12), pages 1-28, June.
    3. Liu, Yubin & Ye, Qiming & Escribano-Macias, Jose & Feng, Yuxiang & Candela, Eduardo & Angeloudis, Panagiotis, 2023. "Route planning for last-mile deliveries using mobile parcel lockers: A hybrid q-learning network approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    4. Ouyang, Kechen & Wang, David Z.W., 2025. "Optimal operation strategies for freight transport with electric vehicles considering wireless charging lanes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 193(C).
    5. Gronalt, Manfred & Hartl, Richard F. & Reimann, Marc, 2003. "New savings based algorithms for time constrained pickup and delivery of full truckloads," European Journal of Operational Research, Elsevier, vol. 151(3), pages 520-535, December.
    6. Santini, Alberto & Plum, Christian E.M. & Ropke, Stefan, 2018. "A branch-and-price approach to the feeder network design problem," European Journal of Operational Research, Elsevier, vol. 264(2), pages 607-622.
    7. Qin, Hu & Moriakin, Anton & Xu, Gangyan & Li, Jiliu, 2024. "The generator distribution problem for base stations during emergency power outage: A branch-and-price-and-cut approach," European Journal of Operational Research, Elsevier, vol. 318(3), pages 752-767.
    8. Xiang, Zhihai & Chu, Chengbin & Chen, Haoxun, 2006. "A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1117-1139, October.
    9. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    10. Egan, Malcolm & Jakob, Michal, 2016. "Market mechanism design for profitable on-demand transport services," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 178-195.
    11. Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.
    12. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    13. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    14. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi, 2011. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows," Operations Research, INFORMS, vol. 59(2), pages 414-426, April.
    15. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    16. Lin, Jianjun & Chen, Huisu & Liu, Lin & Zhang, Rongling, 2020. "Impact of particle size ratio on the percolation thresholds of 2D bidisperse granular systems composed of overlapping superellipses," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 544(C).
    17. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    18. Sina Mohri, Seyed & Ghaderi, Hadi & Van Woensel, Tom & Mohammadi, Mehrdad & Nassir, Neema & Thompson, Russell G., 2024. "Contextualizing alternative delivery points in last mile delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    19. Francis, Peter & Zhang, Guangming & Smilowitz, Karen, 2007. "Improved modeling and solution methods for the multi-resource routing problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1045-1059, August.
    20. Fagerholt, Kjetil, 2001. "Ship scheduling with soft time windows: An optimisation based approach," European Journal of Operational Research, Elsevier, vol. 131(3), pages 559-571, June.

    More about this item

    Keywords

    ;
    ;
    ;

    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:eee:phsmap:v:656:y:2024:i:c:s0378437124007052. 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.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.