Notice

This is not the latest version of this item. The latest version can be found at:https://dspace.mit.edu/handle/1721.1/134460.2

Show simple item record

dc.contributor.authorKuhn, Fabian
dc.contributor.authorLynch, Nancy
dc.contributor.authorNewport, Calvin
dc.date.accessioned2021-10-27T20:05:06Z
dc.date.available2021-10-27T20:05:06Z
dc.date.issued2011
dc.identifier.urihttps://hdl.handle.net/1721.1/134460
dc.description.abstractA 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.
dc.language.isoen
dc.publisherSpringer Nature America, Inc
dc.relation.isversionof10.1007/s00446-010-0118-0
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.sourceMIT web domain
dc.titleThe abstract MAC layer
dc.typeArticle
dc.relation.journalDistributed Computing
dc.eprint.versionOriginal manuscript
dc.type.urihttp://purl.org/eprint/type/JournalArticle
eprint.statushttp://purl.org/eprint/status/NonPeerReviewed
dc.date.updated2019-06-13T14:30:00Z
dspace.orderedauthorsKuhn, F; Lynch, N; Newport, C
dspace.date.submission2019-06-13T14:30:01Z
mit.journal.volume24
mit.journal.issue3-4
mit.metadata.statusAuthority Work and Publication Information Needed


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

VersionItemDateSummary

*Selected version