Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems


We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make only weak assumptions on the communication: every process is infinitely often able to communicate with other processes (not necessarily directly). Our contribution is threefold. First, we propose a new definition of minimal dominating set suitable for the context of time-varying graphs that seems more relevant than existing ones. Next, we provide a necessary and sufficient topological condition for the existence of a deterministic algorithm for minimal dominating set construction in our settings. Finally, we propose a new measure of time complexity in time-varying graph in order to to allow fair comparison between algorithms. Indeed, this measure takes account of communication delays attributable to dynamicity of the graph and not to the algorithms.
Fichier principal
Vignette du fichier
RR.pdf (494.58 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01111610 , version 1 (01-02-2015)



Swan Dubois, Mohamed Hamza Kaaouachi, Franck Petit. Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems. 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'15), Aug 2015, Edmonton, AB, Canada. pp.51-66, ⟨10.1007/978-3-319-21741-3_4⟩. ⟨hal-01111610⟩
203 View
198 Download



Gmail Mastodon Facebook X LinkedIn More