arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.06495cs.NI
收藏

小小区网络中的盲最优用户关联

Blind Optimal User Association in Small-Cell Networks

Livia Elena Chatzieleftheriou, Apostolos Destounis, Georgios Paschos, Iordanis Koutsopoulos

摘要:

我们学习最佳的用户关联策略的流量从不同的位置接入点(AP),在存在未知的动态流量需求。我们的目标是最大限度地减少一个广泛的家庭的$α$ -公平的成本函数,表示在无线下行链路中的负载分配的各种目标,如总负载或总延迟最小化。在动态环境中寻找最优的用户关联策略是具有挑战性的,因为交通需求随时间的波动是非平稳的,并且难以统计地表征,这阻碍了具有成本效益的关联的计算。假设任意的流量模式随着时间的推移,我们制定的最佳用户关联策略的在线学习的问题,使用在线凸优化(OCO)框架。我们引入了一个定期的基准OCO问题,概括了国家的最先进的基准。我们利用固有的属性的在线用户关联问题,并提出PerOnE,一个简单的在线学习计划,动态适应任意流量需求变化的关联策略。我们比较PerOnE对我们的定期基准,并证明它享有无遗憾的财产,与网络大小的额外的次线性依赖。据我们所知,这是第一个工作,介绍了一个定期的基准OCO问题和一个无遗憾算法的在线用户关联问题。我们的理论研究结果通过一个真实的跟踪数据集的结果进行验证。

英文摘要:

We learn optimal user association policies for traffic from different locations to Access Points(APs), in the presence of unknown dynamic traffic demand. We aim at minimizing a broad family of $α$-fair cost functions that express various objectives in load assignment in the wireless downlink, such as total load or total delay minimization. Finding an optimal user association policy in dynamic environments is challenging because traffic demand fluctuations over time are non-stationary and difficult to characterize statistically, which obstructs the computation of cost-efficient associations. Assuming arbitrary traffic patterns over time, we formulate the problem of online learning of optimal user association policies using the Online Convex Optimization (OCO) framework. We introduce a periodic benchmark for OCO problems that generalizes state-of-the-art benchmarks. We exploit inherent properties of the online user association problem and propose PerOnE, a simple online learning scheme that dynamically adapts the association policy to arbitrary traffic demand variations. We compare PerOnE against our periodic benchmark and prove that it enjoys the no-regret property, with additional sublinear dependence of the network size. To the best of our knowledge, this is the first work that introduces a periodic benchmark for OCO problems and a no-regret algorithm for the online user association problem. Our theoretical findings are validated through results on a real-trace dataset.

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

↑