Location oblivious distributed unit disk graph coloring

Authors:
Mathieu Couture;Michel Barbeau;Prosenjit Bose;Paz Carmi;Evangelos Kranakis
Affiliations:
School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada
Venue:
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Year:
2007

Citing 5
Cited 2

Unit disk graph recognition is NP-hard

Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Smallest-last ordering and clustering and graph coloring algorithms

Journal of the ACM (JACM)
Robust algorithms for restricted domains

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
A tight bound for online coloring of disk graphs

SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Independence and coloring problems on intersection graphs of disks

Efficient Approximation and Online Algorithms

Building (1-ε) dominating sets partition as backbones in wireless sensor networks using distributed graph coloring

DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Wireless scheduling with power control

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorithm is at most three times the chromatic number of the graph). This is an improvement over the standard sequential coloring algorithm since we present a new lower bound of 10/3 for the worst-case performance ratio of the sequential coloring algorithm. The previous greatest lower bound on the performance ratio of the sequential coloring algorithm was 5/2. Using simulation, we also compare our algorithm with other existing unit disk graph coloring algorithms.