A distributed hierarchical clustering algorithm for large-scale dynamic networks

Authors:
François Avril;Alain Bui;Devan Sohier
Affiliations:
Université de Versailles St-Quentin-en-Yvelines, Versailles, France;Université de Versailles St-Quentin-en-Yvelines, Versailles, France;Université de Versailles St-Quentin-en-Yvelines, Versailles, France
Venue:
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Year:
2013

Citing 14
Cited 0

Multicluster, mobile, multimedia radio network

Wireless Networks
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

Cluster Computing
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
A Mobility Based Metric for Clustering in Mobile Ad Hoc Networks

ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Brief announcement: virtual mobile nodes for mobile ad hoc networks

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Empire of colonies: Self-stabilizing and self-organizing distributed 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 randomized clustering of anonymous wireless ad hoc networks with an application to the initialization problem

The Journal of Supercomputing
Self-stabilization and virtual node layer emulations

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
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
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an algorithm that builds a hierarchical clustering in a network, in the presence of topological changes such as those that occur in wireless mobile networks. Clusters are built and maintained by random walks, that collect and dispatch information to ensure the consistency of clusters. We then implement distributed communication primitives allowing clusters to emulate distributed algorithms; those primitives ensure that messages sent by a cluster are received and treated only once by their recipient, even in the presence of topological changes. Decisions concerning the behavior of the cluster are taken by the node that owns the random walk at this time. Based on this abstraction layer and the overlay network it defines, we present a distributed hierarchical clustering algorithm, aimed at clustering large-scale dynamic networks.