No abstract

Abstract-The area of self-stabilization in large scale networks has been received increasing attention among researchers, since self-stabilization provides a foundation for self-properties, including self-healing, self-organizing and self-adaptive. This paper makes contributions in two areas. First, we describe a new extended approach of selfstabilization, called self-stabilization with service guarantee. Second, we propose a self-stabilizing protocol computing and preserving the knowledge of neighbor clusters, called CNK. A cluster-head maintains about each neighbor cluster: the identity of its head, paths leading to it, and the list of members. The most interesting property of CNK is the service guarantee during the stabilization phase. CNK quickly provides, in at most 4 rounds, the following minimal useful service: "each cluster-head knows valid paths leading to heads of all its neighbor clusters". CNK protocol preserves the minimal service despite changes in the clustering structure (creation of new clusters, restructuring or crumbling of existing clusters). The knowledge of neighbor clusters is thus highly available. This knowledge is enough to allow the continuity functioning of hierarchical protocols as hierarchical routing protocols.

Abstract. In this paper, we compare the two fault tolerant approaches: self-stabilization and robust self-stabilization, and we investigate their performances in dynamic networks. We study the behavior of four clustering protocols; two self-stabilizing GDMAC and BSC, and their robust self-stabilizing version R-GDMAC and R-BSC. The performances of protocols are compared in terms of their cluster-heads number, availability of both minimal and optimum services and the stabilization time.

No abstract

Abstract. We propose a transformer building a silent self-stabilizing with service guarantee 1-hop clustering protocol T P of an input silent self-stabilizing 1-hop clustering protocol P. From an arbitrary configuration, T P reaches a safe configuration in at most 3 rounds, where the following useful minimal service is provided: "each node belongs to a 1-hop cluster having an effective leader". During stabilization of T P, the minimal service is preserved, so the clustering structure is available throughout the entire network. The minimal service is also maintained despite the occurrences of some external disruptions, called highly tolerated disruptions, denoted HT D. T P reaches a terminal (also legitimate) configuration in at most 4 * SP rounds where SP is the stabilization time of P protocol. Moreover, T P requires only 2 bits per node more than P.

No abstract