arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.11318eess.SPcs.SYeess.SY
收藏

基于移动边缘缓存的内容感知用户关联和多用户MIMO波束成形

Content-Aware User Association and Multi-User MIMO Beamforming over Mobile Edge Caching

Susanna Mosleh, Qiang Fan, Lingjia Liu, Jonathan D. Ashdown, Erik Perrins, Kurt Turck

摘要:

移动边缘缓存(MEC)已被引入以支持不断增长的最终用户需求。为了减少回程流量需求和内容交付延迟,基站(BS)上启用缓存的边缘服务器被用来在网络边缘提供流行内容。在本文中,多输入多输出(MIMO)操作和用户关联策略被链接到底层缓存放置策略,以确保负载平衡和回程流量之间的良好权衡,同时考虑到底层无线信道和边缘服务器的有限缓存容量。由于移动台之间的耦合干扰,底层的缓存布局和用户关联矩阵的二进制性质,所得到的混合时标混合整数优化问题是非凸的和NP-难的。为了解决这个问题,我们将联合优化问题分解为一个长期的内容放置子问题和一个短期的内容分发子问题。利用乘子交替方向法和随机并行逐次凸逼近算法,提出了一种新的迭代算法。引入的计划,使所有的BS并行更新其优化变量,通过解决一系列的凸子问题。仿真结果表明了该策略的有效性。

英文摘要:

Mobile edge caching (MEC) has been introduced to support ever-growing end-users' needs. To reduce the backhaul traffic demand and content delivery latency, cache-enabled edge servers at base stations (BSs) are employed to provision popular contents at the network edge. In this paper, multiple-input-multiple-output (MIMO) operation and user association policy are linked to the underlying cache placement strategy to ensure a good trade-off between load balancing and backhaul traffic taking into account the underlying wireless channel and the finite cache capacity at edge servers. Due to the coupled interference among mobile stations, the binary nature of the underlying cache placement and user association matrices, the resulting mixed-timescale mixed integer optimization problem is nonconvex and NP-hard. To solve this problem, we decompose the joint optimization problem into a long-term content placement sub-problem and a short-term content delivery sub-problem. A novel iterative algorithm is introduced by leveraging the alternating direction method of multipliers together with a stochastic parallel successive convex approximation-based algorithm. The introduced scheme enables all BSs to update their optimization variables in parallel by solving a sequence of convex subproblems. Simulation evaluation demonstrates the efficiency of our strategy.

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

↑