The random walk construction of uniform spanning trees and uniform labelled trees
SIAM Journal on Discrete Mathematics
Fast distributed network decompositions and covers
Journal of Parallel and Distributed Computing
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Self-stabilizing deterministic network decomposition
Journal of Parallel and Distributed Computing
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks
IEEE Transactions on Mobile Computing
A self-organization structure for hybrid networks
Ad Hoc Networks
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
A multiple random walks based self-stabilizing k-exclusion algorithm in ad hoc networks
International Journal of Parallel, Emergent and Distributed Systems - Network and parallel computing
Topological adaptability for the distributed token circulation paradigm in faulty environment
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Decentralized resources management for grid
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
IEEE Transactions on Information Theory
Self-stabilizing hierarchical construction of bounded size clusters
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Nested clusters with intercluster routing
The Journal of Supercomputing
| Hi-index | 0.00 |
We propose an algorithm that builds and maintains clusters over a network subject to mobility. This algorithm is fully decentralized and makes all the different clusters grow concurrently. The algorithm uses circulating tokens that collect data and move according to a random walk traversal scheme. Their task consists in (i) creating a cluster with the nodes it discovers and (ii) managing the cluster expansion; all decisions affecting the cluster are taken only by a node that owns the token. The size of each cluster is maintained higher than m nodes (m is a parameter of the algorithm). The obtained clustering is locally optimal in the sense that, with only a local view of each clusters, it computes the largest possible number of clusters (i.e. the sizes of the clusters are as close to m as possible). This algorithm is designed as a decentralized control algorithm for large scale networks and is mobility-adaptive: after a series of topological changes, the algorithm converges to a clustering. This recomputation only affects nodes in clusters where topological changes happened, and in adjacent clusters.