Dijkstra defined a distributed system to be self-stabilizing if, regardless of the initial state, the
system is guaranteed to reach a legitimate (correct) state in a finite time. Even though the …

Self-stabilizing algorithms for optimization problems can often be solved more easily using
the distance-two model in which each vertex can instantly see the state information of all …

A self-stabilizing algorithm, after transient faults hit the system and place it in some arbitrary
global state, causes the system to recover in finite time without external (eg, human) …

Mobile ad hoc networks as well as grid platforms are distributed, changing, and error prone
environments. Communication costs within such infrastructure can be improved, or at least …

Given an arbitrary network G of processes with unique IDs and no designated leader, and
given a k-dominating set ICG, we propose a silent self-stabilizing distributed algorithm that …

In this paper, we give a silent self-stabilizing algorithm for constructing a k-clustering of any
asynchronous connected network with unique IDs. Our algorithm stabilizes in O (n) rounds …

We give a silent self-stabilizing algorithm for the generalized minimal k-dominating set
problem in a connected distributed network G. Given a positive integer k and two sets of …

In this paper, we propose a silent self-stabilizing asynchronous distributed algorithm for
constructing a kclustering of any connected network with unique IDs. Our algorithm …

We propose a group membership service for dynamic ad hoc networks. It maintains as long
as possible the existing groups and ensures that each group diameter is always smaller …

Mobile ad hoc networks as well as grid platforms are distributed, changing and error prone
environments. Communication costs within such infrastructures can be improved, or at least …