Skip to Main content Skip to Navigation
Reports

A Note on Node Coloring in the SINR Model

Bilel Derbel 1, 2, * El-Ghazali Talbi 2
* Corresponding author
2 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : A $\xi$-coloring of a graph $G$ is a coloring of the nodes of $G$ with $\xi$ colors in such a way any two neighboring nodes have different colors. We prove that there exists a $O(\Delta \log n)$ time distributed algorithm computing a $O(\Delta)$-colroing for unit disc graphs under the signal-to-interference-plus-noise ratio (SINR)-based physical model ($\Delta$ is the maximum degree of the graph). We also show that, for a well defined constant $d$, a $d$-hop $O(\Delta)$-coloring allows us to schedule an interference free MAC protocol under the physical SINR constraints. For instance this allows us to prove that any point-to-point message passing algorithm with running time $\tau$ can be simulated in the SINR model in $O(\Delta (\log n + \tau))$ time using messages of well chosen size. All our algorithms are proved to be correct with high probability.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/inria-00408670
Contributor : Bilel Derbel <>
Submitted on : Thursday, October 22, 2009 - 2:11:16 PM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM
Document(s) archivé(s) le : Friday, September 24, 2010 - 11:21:54 AM

File

RR-7058.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00408670, version 4

Citation

Bilel Derbel, El-Ghazali Talbi. A Note on Node Coloring in the SINR Model. [Research Report] RR-7058, INRIA. 2009, pp.15. ⟨inria-00408670v4⟩

Share

Metrics

Record views

372

Files downloads

355