Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
K-clustering in wireless ad hoc networks
Proceedings of the second ACM international workshop on Principles of mobile computing
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
Self-Stabilizing Leader Election in Optimal Space
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
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
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
The Computer Journal
Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Self-stabilizing hierarchical construction of bounded size clusters
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
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
Self-stabilizing k-hops clustering algorithm for wireless ad hoc networks
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Mobile ad hoc networks as well as grid platforms are distributed, changing, and error prone environments. Communication costs within such infrastructure can be improved, or at least bounded, by using k-clustering. A k-clustering of a graph, is a partition of the nodes into disjoint sets, called clusters, in which every node is distance at most k from a designated node in its cluster, called the clusterhead. A self-stabilizing asynchronous distributed algorithm is given for constructing a k-clustering of a connected network of processes with unique IDs and weighted edges. The algorithm is comparison based, takes O(nk) time, and uses O(logn+logk) space per process, where n is the size of the network. To the best of our knowledge, this is the first solution to the k-clustering problem on weighted graphs.