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 Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
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 Distributed Self-Stabilizing Algorithm for Finding a Connected Dominating Set in a Graph
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
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
A Self-Stabilizing O(n)-Round k-Clustering Algorithm
SRDS '09 Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems
Capacitated domination and covering: a parameterized perspective
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
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 wireless connected overlays
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing hierarchical construction of bounded size clusters
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Self-stabilization versus robust self-stabilization for clustering in ad-hoc network
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
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
Nested clusters with intercluster routing
The Journal of Supercomputing
| Hi-index | 0.00 |
We propose the first robust self-stabilizing protocol building 1-hop clusters whose size is bounded, moreover the clusterhead selection is weight-based. The protocol reaches quickly (in 4 rounds) a safe configuration, where the safety property is satistfied: network nodes are partitionned into bounded clusters (clusterheads are not the most suitable nodes). During the convergence to a legitimate configuration, where more desired properties are guaranteed, the safety property is preserved, ensuring then the continuity functioning of hierarchical protocols.