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

基于最优传输理论的移动网络容量约束动态分簇

Capacitated Kinetic Clustering in Mobile Networks by Optimal Transportation Theory

Chien-Chun Ni, Zhengyu Su, Jie Gao, Xianfeng David Gu

摘要:

我们考虑的问题,其中$n$移动终端和$k$基站与各自的操作能力的能力限制的动力学集群。任务是将移动终端分配给基站,使得从每个终端到其分配的基站的总平方距离最小化,并且满足容量约束。本文重点介绍了\emph{distributed}的发展和计算效率高的算法,适应终端和基站的运动。建议的最优运输理论,我们利用的结构特性的最优解,它可以表示为一个功率图的基站,使每个功率单元内的节点的总使用量等于相应的基站的容量。通过使用动力学数据结构框架,我们展示了最优解中变化次数的第一个分析上限,即,它的稳定性。在算法方面,使用功率图制定,我们表明,该解决方案可以表示成比例的基站数量的大小,可以解决一个迭代,本地算法。特别是,该算法可以自然地利用运动的连续性,并且比使用最小成本匹配和线性规划的现有解决方案快几个数量级,因此能够处理移动性下的大规模数据。

英文摘要:

We consider the problem of capacitated kinetic clustering in which $n$ mobile terminals and $k$ base stations with respective operating capacities are given. The task is to assign the mobile terminals to the base stations such that the total squared distance from each terminal to its assigned base station is minimized and the capacity constraints are satisfied. This paper focuses on the development of \emph{distributed} and computationally efficient algorithms that adapt to the motion of both terminals and base stations. Suggested by the optimal transportation theory, we exploit the structural property of the optimal solution, which can be represented by a power diagram on the base stations such that the total usage of nodes within each power cell equals the capacity of the corresponding base station. We show by using the kinetic data structure framework the first analytical upper bound on the number of changes in the optimal solution, i.e., its stability. On the algorithm side, using the power diagram formulation we show that the solution can be represented in size proportional to the number of base stations and can be solved by an iterative, local algorithm. In particular, this algorithm can naturally exploit the continuity of motion and has orders of magnitude faster than existing solutions using min-cost matching and linear programming, and thus is able to handle large scale data under mobility.

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

↑