Fast Beeping Protocols for Deterministic MIS and ($∆ + 1$)-Coloring in Sparse Graphs (Extended Version)

The beeping model is an extremely restrictive broadcast communication model that relies only on carrier sensing. We consider two problems in this model: ($∆+1$)-vertex coloring and maximal independent set (MIS), for a network of unknown size n and unknown maximum degree ∆. Solving these problems allows to overcome communication interferences, and to break symmetry, a core component of many distributed protocols. The presented results apply to general graphs, but are efficient in graphs with low edge density (sparse graphs), such as bounded degree graphs, planar graphs and graphs of bounded arboricity. We present $O(∆^2 log(n) + ∆^3)$ time deterministic uniform MIS and coloring protocols, which are asymptotically time optimal for bounded degree graphs. Furthermore, we devise $O(a^2 log^2(n)+a^3 log(n))$ time MIS and coloring protocols, as well as $O(a^2 ∆^2 log^2(n) + a^3 ∆^3 log(n))$ time 2-hop MIS and 2-hop coloring protocols, where a is the arboricity of the communication graph. Building upon the 2-hop coloring protocols, we show how the strong CONGEST model can be simulated and by using this simulation we obtain an O(a)-coloring protocol. No results about coloring with less than $∆ + 1$ colors were known up to now in the beeping model.