Fast self-stabilizing k-independent dominating set construction
Résumé
We propose a fast silent self-stabilizing building a k-independent dominating set, named FID. The convergence of protocol FID is established for any computation under the unfair distributed scheduler. FID reaches a terminal (also legitimate) configuration in at most 4n+k rounds, where n is the network size.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...