Brief announcement: On simple back-off in unreliable radio networks
Name
LIPIcs-DISC-2018-48.pdf
Description
Published version
Size
328.08 KB
Format
Unknown
Checksum (MD5)
e5b1fd984e15cc3e87e67e34a0c1d0f2
Author(s)
Gilbert, Seth
Lynch, Nancy A.
Newport, Calvin
Pajak, Dominik S
Date Issued
2018
Citation
Lynch, Nancy. 2018. "Brief announcement: On simple back-off in unreliable radio networks."
Version
Final published version
Abstract
© Seth Gilbert, Nancy Lynch, Calvin Newport, and Dominik Pajak. 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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.4230/LIPIcs.DISC.2018.48
