Multicluster, mobile, multimedia radio network
Wireless Networks
Self-stabilizing systems in spite of distributed control
Communications of the ACM
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Self-Stabilization in Self-Organized Multihop Wireless Networks
ICDCSW '05 Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09
Self-stabilizing extensions for message-passing systems
Distributed Computing - Special issue: Self-stabilization
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
A Fault-Local Self-Stabilizing Clustering Service for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Self-Stabilizing Construction of Bounded Size Clusters
ISPA '08 Proceedings of the 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications
A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Theoretical Computer Science
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
Snap-Stabilization in Message-Passing Systems
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
The Computer Journal
From self- to snap- stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A self-stabilizing k-clustering algorithm for weighted graphs
Journal of Parallel and Distributed Computing
Robust self-stabilizing construction of bounded size weight-based clusters
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Loop-free super-stabilizing spanning tree construction
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Self-Stabilizing Computation and Preservation of Knowledge of Neighbor Clusters
SASO '11 Proceedings of the 2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems
Self-stabilizing wireless connected overlays
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
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}$.