Beeping a Deterministic Time-Optimal Leader Election
Résumé
The beeping model is an extremely restrictive broadcast communication model that relies only on carrier sensing. In this model, we solve the leader election problem with an asymptotically optimal round complexity of O(D + log n), for a network of unknown size n and unknown diameter D (but with unique identifiers). Contrary to the best previously known algorithms in the same setting, the proposed one is deterministic. The techniques we introduce give a new insight as to how local constraints on the exchangeable messages can result in efficient algorithms, when dealing with the beeping model. Using this deterministic leader election algorithm, we obtain a randomized leader election protocol for anonymous networks with an asymptotically optimal round complexity of O(D + log n) w.h.p. In previous works, this complexity was obtained in expectation only. Moreover, using deterministic leader election, we obtain efficient algorithms for symmetry-breaking and communication procedures: O(log n) time MIS and 5-coloring for tree networks (which is time-optimal), as well as k-source multi-broadcast for general graphs in O(min{k, log n} · D + k log nM k) rounds (for messages in {1,. .. , M }). This latter result improves on previous solutions when the number of sources is sublogarithmic (k < log n).
Origine : Fichiers produits par l'(les) auteur(s)
Loading...