Given two functions f and g mapping nodes to non-negative integers, we give a silent self-
stabilizing algorithm that computes a minimal (f, g)-alliance in an asynchronous network with …

We propose a self-stabilizing reset algorithm working in anonymous networks. This
algorithm resets the network in a distributed non-centralized manner, as each process …

We propose the first polynomial self-stabilizing distributed algorithm for the minimal total
dominating set problem in an arbitrary graph. Then, we generalize the proposed algorithm …

In this chapter, we introduce the self-stabilizing algorithm model and present several
definitive examples that illustrate the simplicity and elegance of this algorithmic paradigm …

This paper deals with the problem of finding dominating set using self-stabilization paradigm
in distributed systems. Usually, members of a dominating set are selected to be as cluster …

We study the deterministic silent self-stabilizing construction of two disjoint minimal
dominating sets (MDSs) in anonymous networks. We focus on algorithms where nodes …

Dynamic distributed systems are used widely in everyday life by dealing with exploitation
and treatment on information, documents, services, medias, and all entertainment means …

A set S of vertices in a graph G=(V, E) is a defensive alliance if for every vertex in v∈ S,| N
v∩ S|≥| N (v)∩ S¯|| N v ∩ S| ≧| N (v) ∩ S|. That is, every vertex in S has at least as many …

A self-stabilizing algorithm for the minimal $\alpha $-dominating set is proposed in this
paper. The $\alpha $-domination parameter has not used before in self-stabilization …

Self-stabilization is an optimistic paradigm to provide autonomous resilience against an un-
limited number of transient faults in distributed systems. A self-stabilizing system guarantees …