HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

addresses this weakness of distributed self-stabilizing systems by introducing the notion of fault containment. Informally, a fault-containing self-stabilizing algorithm is one that contains the effects of limited transient faults while retaining the property of self-stabilization. The paper begins with a

), where D is the diameter of the network. Moreover, time-optimal self-stabilizing algorithms for computing the orientation on tori, rings, hypercubes, CCC, butterflies, stars and outerplanar graphs are presented. This gives an affirmative answer to the problem 15:4 for tori stated in [Tel 94b]. Key Words

The problem of locating centers and medians of graphs has a variety of applications in the areas of transportation and communication in distributed systems. This paper presents simple self-stabilizing algorithms for locating centers and medians of trees. Since the algorithms are selfstabilizing

In the self-stabilizing algorithmic paradigm for distributed computing each node has only a local view of the system, yet in a finite amount of time the system converges to a global state, satisfying some desired property. In a graph G = (V, E), a subset S ⊆ V is a 2-packing if ∀u ∈ V: |N [u

A k-forward numbering of a graph is a labeling of the nodes with integers such that each node has less than k neighbors whose labels are equal or larger. Distributed algorithms that reach a legitimate state, starting from any illegitimate state, are called self-stabilizing. We obtain three self-stabilizing

) three recent, high-performance PSO-variants. The new algorithm is shown to be statistically significantly better on a seven-function test suite for the following performance measures: solution quality, time to find the solution, frequency of finding the solution, and scalability. Categories and Subject

. Traditional approaches to fault tolerance like replication or global resets are not feasible. In this work, the concept of self-stabilization is applied to WSNs. The majority of self-stabilizing algorithms found in the literature is based on models not suitable for WSNs: shared memory model, central daemon

algorithms which utilize distance-k knowledge. Our transformation has both a slowdown and space overhead in n O(log k), and might be thought of as a distance-k resource allocation algorithm. Our main application is a polynomial-time self-stabilizing algorithm for finding maximal irredundant sets, a problem

self-stabilizing algorithms which utilize distancek knowledge, with a slowdown of n O(log k). Our main application is a polynomial-time self-stabilizing algorithm for finding maximal irredundant sets, a problem which seems to require distance-4 information. We also show how to find maximal k