The abstract MAC layer
Name
AbstractMACTR6.pdf
Description
Accepted version
Size
296.24 KB
Format
Unknown
Checksum (MD5)
35656db34f6c7808e649ff4f641f1434
Author(s)
Kuhn, Fabian
Lynch, Nancy A.
Newport, Calvin Charles
Date Issued
2011
Journal
Distributed Computing
Publisher
Springer Nature America, Inc
Version
Original manuscript
Abstract
A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an abstract MAC layer. This service provides reliable local broadcast communication, with timing guarantees stated in terms of a collection of abstract delay functions applied to the relevant contention. Algorithm designers can analyze their algorithms in terms of these functions, independently of specific channel behavior. Concrete implementations of the abstract MAC layer over basic radio network models generate concrete definitions for these delay functions, automatically adapting bounds proven for the abstract service to bounds for the specific radio network under consideration. To illustrate this approach, we use the abstract MAC layer to study the new problem of Multi-Message Broadcast, a generalization of standard single-message broadcast in which multiple messages can originate at different times and locations in the network.We present and analyze two algorithms for Multi-Message Broadcast in static networks: a simple greedy algorithm and one that uses regional leaders. We then indicate how these results can be extended to mobile networks. © 2010 Springer-Verlag.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00446-010-0118-0
