Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Multicluster, mobile, multimedia radio network
Wireless Networks
Stabilizing time-adaptive protocols
Theoretical Computer Science
Self-stabilizing systems in spite of distributed control
Communications of the ACM
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
Cluster Computing
An Adaptive Maintenance of Hierarchical Structure in Ad Hoc Networks and Its Evaluation
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Self-Stabilization in Self-Organized Multihop Wireless Networks
ICDCSW '05 Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09
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
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
A survey on clustering algorithms for wireless sensor networks
Computer Communications
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
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
Fault-Containment in Weakly-Stabilizing Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
The Computer Journal
Journal of Parallel and Distributed Computing
A 1-strong self-stabilizing transformer
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Best-effort group service in dynamic networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A self-stabilizing k-clustering algorithm for weighted graphs
Journal of Parallel and Distributed Computing
A self-stabilizing minimal dominating set algorithm with safe convergence
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Self-stabilizing hierarchical construction of bounded size clusters
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
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
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
From self- to self-stabilizing with service guarantee 1-hop weight-based clustering
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
This paper makes contributions in two areas. First, we introduce an extended approach of self-stabilization, called self-stabilization with service guarantee. A self-stabilizing system tolerates transient faults: it automatically recovers to a correct behavior after a stabilization period. However, during stabilization periods, no property on the system behavior is guaranteed. A self-stabilizing protocol with service guarantee quickly provides a useful minimal service, and it maintains the minimal service during stabilization despite the occurrence of some disruptions. To illustrate our approach, we propose a clustering protocol (called SG-BSC), that builds 1-hop, bounded size and weight based clusters. SG-BSC protocol is self-stabilizing with service guarantee: it quickly reaches, in 4 rounds, a safe configuration from any arbitrary one. In a safe configuration, the following useful minimal service is provided: ''each node belongs to a cluster, and each cluster has a leader and at most SizeBound ordinary nodes that are at most at distance 1 from their cluster-head''. The convergence to a legitimate configuration (optimum service) is done in at most 7*N2+4 rounds, where N is the number of nodes. We prove that any self-stabilizing protocol building weight-based clusters requires O(N) rounds to stabilize. Once the optimum service is reached, any cluster-head has the highest weight in its cluster, and the number of clusters is locally optimal. During the stabilization period, the minimal service is preserved; so, the hierarchical organization stays available throughout the entire network. Simulation results show the interest of self-stabilization with service guarantee compared to self-stabilization.