Distributed coloring and the local structure of unit-disk graphs

by   Louis Esperet, et al.

Coloring unit-disk graphs efficiently is an important problem in the global and distributed setting, with applications in radio channel assignment problems when the communication relies on omni-directional antennas of the same power. In this context it is important to bound not only the complexity of the coloring algorithms, but also the number of colors used. In this paper, we consider two natural distributed settings. In the location-aware setting (when nodes know their coordinates in the plane), we give a constant time distributed algorithm coloring any unit-disk graph G with at most (3+ϵ)ω(G)+6 colors, for any constant ϵ>0, where ω(G) is the clique number of G. This improves upon a classical 3-approximation algorithm for this problem, for all unit-disk graphs whose chromatic number significantly exceeds their clique number. When nodes do not know their coordinates in the plane, we give a distributed algorithm in the LOCAL model that colors every unit-disk graph G with at most 5.68ω(G) colors in O(log^3 log n) rounds. Moreover, when ω(G)=O(1), the algorithm runs in O(log^* n) rounds. This algorithm is based on a study of the local structure of unit-disk graphs, which is of independent interest. We conjecture that every unit-disk graph G has average degree at most 4ω(G), which would imply the existence of a O(log n) round algorithm coloring any unit-disk graph G with (approximatively) 4ω(G) colors.


page 1

page 2

page 3

page 4


Coloring Fast Without Learning Your Neighbors' Colors

We give an improved randomized CONGEST algorithm for distance-2 coloring...

Superfast Coloring in CONGEST via Efficient Color Sampling

We present a procedure for efficiently sampling colors in the model. It...

Optimal Spanners for Unit Ball Graphs in Doubling Metrics

Resolving an open question from 2006, we prove the existence of light-we...

Distributed coloring of graphs with an optimal number of colors

This paper studies sufficient conditions to obtain efficient distributed...

Noisy Beeping Networks

We introduce noisy beeping networks, where nodes have limited communicat...

Dynamic Conflict-Free Colorings in the Plane

We study dynamic conflict-free colorings in the plane, where the goal is...

Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs

Graph coloring, also known as vertex coloring, considers the problem of ...