Self-stabilizing hierarchical construction of bounded size clusters

Authors:
Alain Bui;Simon Clavière;Ajoy K. Datta;Lawrence L. Larmore;Devan Sohier
Affiliations:
PRiSM, UMR, CNRS, Université de Versailles St-Quentin-en-Yvelines;PRiSM, UMR, CNRS, Université de Versailles St-Quentin-en-Yvelines;School of Computer Science, University of Nevada, Las Vegas, NV;School of Computer Science, University of Nevada, Las Vegas, NV;PRiSM, UMR, CNRS, Université de Versailles St-Quentin-en-Yvelines
Venue:
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Year:
2011

Citing 15
Cited 2

Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Location Management Handoff Overhead in Hierarchically Organized Mobile Ad hoc Networks

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
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
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm

Theoretical Computer Science
Robust self-stabilizing weight-based clustering algorithm

Theoretical Computer Science
Design Issues and Performance Analysis of Location-Aided Hierarchical Cluster Routing on the MANET

CMC '09 Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02
A Fully Distributed Clustering Algorithm Based on Random Walks

ISPDC '09 Proceedings of the 2009 Eighth International Symposium on Parallel and Distributed Computing
A Self-Stabilizing O(k)-Time k-Clustering Algorithm

The Computer Journal
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
Distributed Construction of Nested Clusters with Inter-cluster Routing

IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Hierarchical clustering algorithm based on mobility in mobile ad hoc networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
A distributed clustering algorithm for large-scale dynamic networks

Cluster Computing

Nested clusters with intercluster routing

The Journal of Supercomputing
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a self-stabilizing clustering algorithm for asynchronous networks. Our algorithms works under any scheduler and is silent. The sizes of the clusters are bounded by a parameter of the algorithm. Our solution also avoids constructing a large number of small clusters. Although the clusters are disjoint (no node belongs to more than one cluster), the clusters are connected to form a tree so that the resulting overlay graph is connected. The height of the tree of clusters is bounded by the diameter of the network.