Decomposing broadcast algorithms using abstract MAC layers

Majid Khabbazian, Fabian Kuhn, Dariusz R. Kowalski, Nancy Lynch

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Scopus citations

Abstract

In much of the theoretical literature on wireless algorithms, issues of message dissemination are considered together with issues of contention management. This combination leads to complicated algorithms and analysis, and makes it difficult to extend the work to harder communication problems. In this paper, we present results of a current project aimed at simplifying such algorithms and analysis by decomposing the treatment into two levels, using abstract "MAC layer" specifications to encapsulate the contention management. We use two different abstract MAC layers: the basic one of [14, 15] and a new probabilistic layer. We first present a typical randomized contention-manageent algorithm for a standard graph-based radio network model We show that it implements both abstract MAC layers. We combine this algorithm with greedy algorithms for single-message and multi-message global broadcast and analyze the combination, using both abstract MAC layers as intermediate layers. Using the basic MAC layer, we prove a bound of O(D log(n/ε) log Δ) for the time to deliver a single message everywhere with probability 1 - ε, where D is the network diameter, n is the number of nodes, and Δ is the maximum node degree. Using the probabilistic layer, we prove a bound of O((D + log(n/ε)) log Δ), which matches the best previously-known bound for single-message broadcast over the physical network model. For multi-message broadcast, we obtain bounds of O((D + kΔ) log(n/ε) log Δ) using the basic layer and O((D + kΔ log(n/ε)) log Δ) using the probabilistic layer, for the time to deliver a message everywhere in the presence of at most k concurrent messages.

Original languageEnglish (US)
Title of host publicationProceedings of the 6th International Workshop on Foundations of Mobile Computing, DIALM-POMC '10
Pages13-22
Number of pages10
DOIs
Publication statusPublished - Nov 25 2010
Externally publishedYes
Event6th ACM SIGACT-SIGMOBILE International Workshop on Foundations of Mobile Computing, DIALM-POMC 2010 - Cambridge, MA, United States
Duration: Sep 16 2010Sep 16 2010

Publication series

NameProceedings of the 6th International Workshop on Foundations of Mobile Computing, DIALM-POMC '10

Conference

Conference6th ACM SIGACT-SIGMOBILE International Workshop on Foundations of Mobile Computing, DIALM-POMC 2010
CountryUnited States
CityCambridge, MA
Period9/16/109/16/10

    Fingerprint

Keywords

  • contention management
  • MAC layer
  • multi-message broadcast
  • wireless network algorithms

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Khabbazian, M., Kuhn, F., Kowalski, D. R., & Lynch, N. (2010). Decomposing broadcast algorithms using abstract MAC layers. In Proceedings of the 6th International Workshop on Foundations of Mobile Computing, DIALM-POMC '10 (pp. 13-22). (Proceedings of the 6th International Workshop on Foundations of Mobile Computing, DIALM-POMC '10). https://doi.org/10.1145/1860684.1860690