2026-07-23T06:52:02Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9837 2024-03-06T10:45:03Z ddc:004 open_access

Brief Announcement: On Simple Back-Off in Unreliable Radio Networks Gilbert, Seth Lynch, Nancy Newport, Calvin Pajak, Dominik radio networks broadcast unreliable links distributed algorithm robustness In this paper, we study local broadcast in the dual graph model, which describes communication in a radio network with both reliable and unreliable links. Existing work proved that efficient solutions to these problems are impossible in the dual graph model under standard assumptions. In real networks, however, simple back-off strategies tend to perform well for solving these basic communication tasks. We address this apparent paradox by introducing a new set of constraints to the dual graph model that better generalize the slow/fast fading behavior common in real networks. We prove that in the context of these new constraints, simple back-off strategies now provide efficient solutions to local broadcast in the dual graph model. These results provide theoretical foundations for the practical observation that simple back-off algorithms tend to work well even amid the complicated link dynamics of real radio networks. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Seth Gilbert and Nancy Lynch and Calvin Newport and Dominik Pajak 2018 Is Part Of LIPIcs, Volume 121, 32nd International Symposium on Distributed Computing (DISC 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2018.48 urn:nbn:de:0030-drops-98373 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.48 eng https://creativecommons.org/licenses/by/3.0/legalcode