On Distributed Computing with Beeps

Abstract

We consider networks of processes which interact with beeps. Various beeping models are used. The basic one, defined by Cornejo and Kuhn [CK10], assumes that a process can choose either to beep or to listen; if it listens it can distinguish between silence or the presence of at least one beep. The aim of this paper is the study of the resolution of paradigms such as collision detection, computation of the degree of a vertex, colouring, or 2-hop-colouring in the framework of beeping models. For each of these problems we present Las Vegas or Monte Carlo algorithms and we analyse their complexities expressed in terms of the number of slots. We present also efficient randomised emulations of more powerful beeping models on the basic one. We illustrate emulation procedures with an efficient degree computation algorithm in the basic beeping model; this algorithm was given initially in a more powerful model.

Distributed Voting in Beep Model

“…Although beep model is almost a newly developed communication protocol, it has been received much attention in recent years and various algorithms have been proposed for different distributed problems in this model. As examples of these problems, we can mention interval coloring and graph coloring [5], [14], [15], [16], leader election [17], [18], [19], [20], [21], [22], [23], maximal independent set [24], [25], [26], [27], [28], [29], minimum connected dominating set [30], network size approximation and counting [31], [32], [33], [34], deterministic rendezvous problem [35], naming problem [36], membership problem [37], [38], broadcasting [39], [40], [41], and consensus [42].…”