arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1011.2953cs.DC
收藏

一种动态网络的分布式聚类算法

A Distributed Clustering Algorithm for Dynamic Networks

Thibault Bernard, Alain Bui, Laurence Pilard, Devan Sohier

摘要:

我们提出了一种算法,建立和维护集群在网络上的流动性。该算法是完全分散的,使所有不同的集群并发增长。该算法使用循环令牌,收集数据并根据随机行走遍历方案移动。他们的任务包括(i)使用它发现的节点创建一个集群,以及(ii)管理集群扩展;所有影响集群的决策都只由拥有令牌的节点做出。每个集群的大小保持高于$m$节点($m$是算法的参数)。所获得的聚类是局部最优的,在这个意义上,只有每个聚类的局部视图,它计算最大可能数量的聚类(\emph{ie},聚类的大小尽可能接近$m$)。该算法被设计为大规模网络的分散控制算法,并且具有移动性自适应性:经过一系列拓扑变化后,该算法收敛到聚类。这种重新计算只影响拓扑发生变化的簇中的节点以及相邻簇中的节点。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑