License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2015.30
URN: urn:nbn:de:0030-drops-66195
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6619/
Czumaj, Artur ;
Davies, Peter
Communicating with Beeps
Abstract
The beep model is a very weak communications model in which devices in a network can communicate only via beeps and silence. As a result of its weak assumptions, it has broad applicability to many different implementations of communications networks. This comes at the cost of a restrictive environment for algorithm design.
Despite being only recently introduced, the beep model has received considerable attention, in part due to its relationship with other communication models such as that of ad-hoc radio networks. However, there has been no definitive published result for several fundamental tasks in the model. We aim to rectify this with our paper.
We present algorithms for the tasks of broadcast, gossiping, and multi-broadcast, and also, as intermediary results, means of depth-first search and diameter estimation. Our O(D+log(M)-time algorithm for broadcasting is a simple formalization of a concept known as beep waves, and is asymptotically optimal. We give an O(n*log(L))-time depth-first search procedure, and show how this can be used as the basis for an O(n*log(L*M))-time gossiping algorithm. Finally, we approach the more general problem of multi-broadcast. We differentiate between two variants of this problem: one where nodes must know the origin of all source messages, and another where this information is not required. In the first instance we achieve an algorithm running in time O(k*log((L*M)/k)+D*log(L)), and in the second an O(k*log(M/k)+D*log(L))-time algorithm (or O(M+D*log(L)) when M <= k). We then give corresponding lower bounds: Omega(k*log((L*M)/k)+D) in the case where nodes must know message origins, and Omega(k*log(M/k)+D) and Omega(M+D) in the other case, for M > k and M <= k respectively. These lower bounds demonstrate that our algorithms are optimal except for the D*log(L) additive term. In these running-time expressions, n represents network size, D network diameter, L range of node labels, M range of source messages, and k number of sources.
Our algorithms are all explicit, deterministic, and practical, and give efficient means of communication while making arguably the minimum possible assumptions about the network.
BibTeX - Entry
@InProceedings{czumaj_et_al:LIPIcs:2016:6619,
author = {Artur Czumaj and Peter Davies},
title = {{Communicating with Beeps}},
booktitle = {19th International Conference on Principles of Distributed Systems (OPODIS 2015)},
pages = {1--16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-98-9},
ISSN = {1868-8969},
year = {2016},
volume = {46},
editor = {Emmanuelle Anceaume and Christian Cachin and Maria Potop-Butucaru},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6619},
URN = {urn:nbn:de:0030-drops-66195},
doi = {10.4230/LIPIcs.OPODIS.2015.30},
annote = {Keywords: Beep model, Communication networks, Broadcasting, Gossiping, Leader election}
}
|
Keywords: |
|
Beep model, Communication networks, Broadcasting, Gossiping, Leader election |
|
Collection: |
|
19th International Conference on Principles of Distributed Systems (OPODIS 2015) |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
13.10.2016 |
