Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction

Résumé

We propose a memory efficient self-stabilizing protocol building k-independent dominating sets. A k-independent dominating set is a k-independent set and a k-dominating set. A set of nodes, I, is k-independent if the distance between any pair of nodes in I is at least k+1. A set of nodes, D, is a k-dominating if every node is within distance k of a node of D. Our algorithm, named SID, is silent; it converges under the unfair distributed scheduler (the weakest scheduling assumption). The built k-independent dominating sets contains at most 2n/(k+2) nodes, n being the network size. The protocol SID is memory efficient : it requires only 2log((k+1)n+1)+1 bits per node. The correctness and the termination of the protocol SID is proven.
Fichier principal
Vignette du fichier
rr-1473-13.pdf (208.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00843995 , version 1 (12-07-2013)
hal-00843995 , version 2 (01-10-2013)

Identifiants

Citer

Colette Johnen. Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction. Third International Conference on Networked Systems - NETYS 2015, May 2015, Agadir, Morocco. ⟨10.1007/978-3-319-26850-7_24⟩. ⟨hal-00843995v2⟩

Collections

CNRS ANR
86 Consultations
173 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More