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
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
Hi-index | 0.00 |
The clustering problem consists of partitioning network nodes into groups called clusters. Each cluster has a single clusterhead that acts as local coordinator of cluster. A technique for designing solutions that tolerate transient faults is selfstabilization. Self-stabilizing protocols are attractive because they need not be initialized: they converge from any configuration to a legitimate one. Also, they are adaptive to topological changes. If the current configuration is inconsistent with the network topology, the self-stabilizing protocol eventually converges to a legitimate configuration. Nevertheless, self-stabilizing protocols do not guarantee any property during the convergence period. In addition, the convergence time may be proportional to the size of the network; particularly, in weight-based clustering protocols. In order to overcome these drawbacks, we are interested to the robust stabilization. Robust stabilization guarantees that from an illegitimate configuration, the system reaches quickly a safe configuration, in which the safety property is satisfied. The safety property has to be defined such that the system performs correctly its task in a safe configuration. During the convergence to a legitimate configuration, the safety property stays always verified.