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.
A Local-Ratio-Based Power Control Approach for Capacitated Access Points in Mobile Edge Computing
终端设备(TD)通过集成到边缘服务器中的接入点(AP)连接到网络。这为TD将任务上传到云数据中心或卸载到边缘服务器执行提供了先决条件。在这个过程中,信号覆盖、数据传输和任务执行都要消耗能量,信号覆盖的能耗随着半径的增大而急剧增加。较低的功率导致在给定时间段内的较少的能量消耗。因此,AP的功率控制对于降低能耗至关重要。我们的目标是确定功率分配为每个AP具有相同的容量约束,使所有的TD被覆盖,总功率最小化。我们定义这个问题为一个\emph{minimum power capacitated cover }(MPCC)的问题,并提出了一个\emph{minimum local ratio}(MLR)的功率控制方法,这个问题在多项式时间获得准确的结果。权力分配是在一系列回合中选择的。在每一轮中,我们选择功率分配,使其功率与其包含的当前未覆盖TD的数量之比最小化。在平局的情况下,我们选择实现最小比率的任意功率分配。我们继续选择功率分配,直到覆盖所有TD。最后通过实验验证了该方法的有效性。
Towards Edge-Based Data Lake Architecture for Intelligent Transportation System
Federal University of Alagoas(阿拉戈斯联邦大学);Federal University of Minas Gerais(米纳斯吉拉斯联邦大学);Univ Lyon, Inria, INSA Lyon, CITI(里昂大学、法国国家信息与自动化研究所、里昂国立应用科学学院、CITI实验室)
ZipNet-GAN: Inferring Fine-grained Mobile Traffic Patterns via a Generative Adversarial Neural Network
大规模移动流量分析对于数字基础设施配置、公共交通、活动规划和其他领域变得至关重要。然而,监控全市范围的移动流量是一个复杂而昂贵的过程,依赖于专用探头。其中一些探测器的精度或覆盖范围有限,另一些每天收集数十GB的日志,这些日志独立提供有限的见解。提取细粒度的模式涉及昂贵的测量、存储和后处理的空间聚合。在本文中,我们提出了一种移动流量超分辨率技术,克服了这些问题,通过推断狭隘的本地化的流量消费从粗糙的测量。我们从图像处理中汲取灵感,设计了一个针对移动网络的深度学习架构,它结合了Zipper网络(ZipNet)和生成对抗神经网络(GAN)模型。这使得能够唯一地捕获在广泛覆盖区域上常规监测的交通量快照(“低分辨率”)与通常在密集计算之后获得的0.05 km $^2$水平上的相应消耗(“高分辨率”)之间的时空关系。我们进行的实验与现实世界的数据集表明,拟议的ZipNet(-GAN)推断流量消耗具有显着的准确性和高达100 $\times$更高的粒度相比,标准的探测,同时优于现有的数据插值技术。据我们所知,这是第一次将超分辨率概念应用于大规模移动交通分析,我们的解决方案是第一个从粗聚合物中推断细粒度城市交通模式的解决方案。