Bounds on Contention Management in Radio Networks
Name
Lynch_Bounds on.pdf
Size
227.1 KB
Format
Adobe PDF
Checksum (MD5)
1bb0699c23853ab29dc2a0b939798c07
Author(s)
Ghaffari, Mohsen
Haeupler, Bernhard
Newport, Calvin Charles
Lynch, Nancy A.
Date Issued
2012
Journal
Distributed Computing
Publisher
Springer-Verlag
Citation
Ghaffari, Mohsen, Bernhard Haeupler, Nancy Lynch, and Calvin Newport. “Bounds on Contention Management in Radio Networks.” Lecture Notes in Computer Science (2012): 223–237.
Version
Author's final manuscript
Abstract
The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two well-studied wireless network models: the classical model, in which links are reliable and collisions consistent, and the more recent dual graph model, which introduces unreliable edges. Our results prove that the Decay strategy, commonly used for local broadcast in the classical setting, is optimal. They also establish a separation between the two models, proving that the dual graph setting is strictly harder than the classical setting, with respect to this primitive.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-33651-5_16
