From self- to self-stabilizing with service guarantee 1-hop weight-based clustering
Résumé
We propose a transformer building a silent self-stabilizing with service guarantee 1-hop clustering protocol TP of an input silent self-stabilizing 1-hop clustering protocol P. From an arbitrary con figuration, TP reaches a safe con figuration in at most 3 rounds, where the following useful minimal service is provided: "each node belongs to a 1-hop cluster having an effectual leader". During stabilization of TP protocol, 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 HTD. TP protocol reaches a terminal (also legitimate) con figuration in at most 4*SP rounds where SP is the stabilization time of P protocol. Moreover, TP requires only 2 bits per node more than P protocol.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...