@article {104806,
	title = {Self-Stabilizing Algorithms for Computing Maximal Distance-2 Independent Sets and Minimal Dominating Sets in Networks},
	journal = {Ing{\'e}nierie des Syst{\`e}mes d{\textquoteright}Information},
	volume = {29},
	number = {2},
	year = {2024},
	pages = {581-590},
	abstract = {
	This study devises self-stabilizing algorithms that leverage the expression distance-2 paradigm to compute (i) a maximal distance-2 independent set, wherein selected nodes maintain a separation exceeding two edges, ensuring non-adjacency; and (ii) a minimal dominating set, wherein each external node has at least one node as a neighbor in the dominating set. The efficacy and convergence of the algorithms are established through rigorous proofs within the framework of the expression model. Extensive simulation tests validate the algorithms{\textquoteright} proficiency in selecting a minimal subset of nodes across expansive network topologies. These algorithms find practical applications in network operations, particularly in ad hoc and wireless sensor networks for the selection of cluster heads that facilitate critical services. Moreover, the self-stabilizing property of the algorithms guarantees the robust reconfiguration of cluster heads post-failure, thereby preserving network functionality amidst disruptions.

},
	url = {https://doi.org/10.18280/isi.290219},
	author = {Bouhata, Djamila and Souheila Bouam and Hamouma Moumen and Badreddine Benreguia and Chafik Arar}
}
