Modeling radio networks
Name
Newport-concur09.pdf
Size
228.51 KB
Format
Adobe PDF
Checksum (MD5)
b7b1b33f90b8e1d4fb28c4e0f1eb48c0
Author(s)
Newport, Calvin Charles
Lynch, Nancy A.
Date Issued
July 2011
Journal
Distributed Computing
Publisher
Spring Berlin/Heidelberg
Citation
Newport, Calvin, and Nancy Lynch. “Modeling radio networks.” Distributed Computing 24.2 (2011): 101-118.
Version
Author's final manuscript
Abstract
We describe a modeling framework and collection of foundational
composition results for the study of probabilistic distributed
algorithms in synchronous radio networks. Though the radio setting has
been studied extensively by the distributed algorithms community, their
results rely on informal descriptions of the channel behavior and therefore
lack easy comparability and are prone to error caused by definition subtleties.
Our framework rectifies these issues by providing: (1) a method
to precisely describe a radio channel as a probabilistic automaton; (2) a
mathematical notion of implementing one channel using another channel,
allowing for direct comparisons of channel strengths and a natural
decomposition of problems into implementing a more powerful channel
and solving the problem on the powerful channel; (3) a mathematical
definition of a problem and solving a problem; (4) a pair of composition
results that simplify the tasks of proving properties about channel
implementation algorithms and combining problems with channel implementations.
Our goal is to produce a model streamlined for the needs of
the radio network algorithms community.
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 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00446-011-0135-7
