The abstract MAC layer
Name
KLNabsmac-1.pdf
Size
212.52 KB
Format
Adobe PDF
Checksum (MD5)
cd20018306cbd70b637625d080a00b89
Author(s)
Kuhn, Fabian
Lynch, Nancy A.
Newport, Calvin Charles
Date Issued
September 2009
Journal
Proceedings of the 23rd International Conference on Distributed Computing, (DISC '09)
Publisher
Association for Computing Machinery
Citation
Kuhn, Fabian, Nancy Lynch and Calvin Newport. "The abstract MAC layer." Proceedings of the 23rd international conference on Distributed computing, Elche, Spain, Sept. 23-25, 2009. p.48-62.
Version
Author's final 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 any number of messages arrive at any processes at any times. 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.
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
http://dl.acm.org/citation.cfm?id=1813176
