Fast self-stabilizing k-independent dominating set construction

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.

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00839357
Author Johnen, Colette
Maintainer CCSD
Last Updated May 9, 2026, 13:07 (UTC)
Created May 9, 2026, 13:07 (UTC)
Identifier hal-00839357
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Laboratoire Bordelais de Recherche en Informatique (LaBRI) ; Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)
creator Johnen, Colette
date 2013-06-27T00:00:00
harvest_object_id c94925cd-539c-4729-b4a8-aadbfabff0fb
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-05-26T00:00:00
set_spec type:REPORT