Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Parallel and Distributed Systems Year : 2019

Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks

(1) , (2) , (2)
1
2

Abstract

This paper considers distributed vertex-coloring in broadcast/receive networks suffering from conflicts and collisions. (A collision occurs when, during the same round, messages are sent to the same process by too many neighbors; a conflict occurs when a process and one of its neighbors broadcast during the same round.) More specifically, the paper focuses on multi-channel networks, in which a process may either broadcast a message to its neighbors or receive a message from at most γ of them. The paper first provides a new upper bound on the corresponding graph coloring problem (known as frugal coloring) in general graphs; proposes an exact bound for the problem in trees; presents a deterministic, parallel, color-optimal, collision-and conflict-free distributed coloring algorithm for trees; proves the correctness of this algorithm; and finally evaluates experimentally its performance using simulations that show our solution clearly outperforms a reference protocol for distributed TDMA slot-allocation.
Fichier principal
Vignette du fichier
CCMC-journal-version.V3_1_FT_final_main.pdf (1.03 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02376726 , version 1 (22-11-2019)

Identifiers

Cite

Hicham Lakhlef, Michel Raynal, François Taïani. Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks. IEEE Transactions on Parallel and Distributed Systems, 2019, 30 (7), pp.1672-1686. ⟨10.1109/TPDS.2018.2889688⟩. ⟨hal-02376726⟩
49 View
184 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More