A Distributed Clustering Algorithm for Dynamic Networks

Details A Distributed Clustering Algorithm for Dynamic Networks A Distributed Clustering Algorithm for Dynamic Networks

2010-11-12

arxiv.org/abs/1011.2953v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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 (\emph{ie} 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 in which topological changes happened, and in adjacent clusters.

Affiliated with

Also associated with

No associations

Rating

A Distributed Clustering Algorithm for Dynamic Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Distributed Clustering Algorithm for Dynamic Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Distributed Clustering Algorithm for Dynamic Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-204485