From Self- to Self-stabilizing with Service Guarantee 1-hop Weight-Based Clustering

Abstract

We propose a transformer building a silent self-stabilizing with service guarantee 1-hop clustering protocol $\mathcal{TP}$ of an input silent self-stabilizing 1-hop clustering protocol $\mathcal{P}$. From an arbitrary configuration, $\mathcal{TP}$ 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 $\mathcal{TP}$, 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 $\mathcal{HTD}$. $\mathcal{TP}$ reaches a terminal (also legitimate) configuration in at most $4*S_\mathcal{P}$ rounds where $S_\mathcal{P}$ is the stabilization time of $\mathcal{P}$ protocol. Moreover, $\mathcal{TP}$ requires only 2 bits per node more than $\mathcal{P}$.

This work was partially supported by the ANR projects ALADDIN and Displexity.