Naming a Channel with Beeps

TL;DR

This paper presents optimal randomized algorithms for assigning contiguous integer names to anonymous nodes in a beep communication channel, with known or unknown node counts, achieving efficiency in time and randomness.

Contribution

It introduces the first optimal naming algorithms for anonymous beep channels, handling both known and unknown node counts with proven efficiency.

Findings

Expected time complexity of O(n log n)

Number of random bits used is O(n log n)

Algorithms are provably optimal in error probability

Abstract

We consider a communication channel in which the only possible communication mode is transmitting beeps, which reach all the nodes instantaneously. Nodes are anonymous, in that they do not have any individual identifiers. The algorithmic goal is to randomly assign names to the nodes in such a manner that the names make a contiguous segment of positive integers starting from $1$. We give a Las Vegas naming algorithm for the case when the number of nodes $n$ is known, and a Monte Carlo algorithm for the case when the number of nodes $n$ is not known. The algorithms are provably optimal with respect to the expected time $O(n\log n)$, the number of used random bits $O(n\log n)$, and the probability of error.