User Scheduling and Power Allocation for Content Delivery in Caching Helper Networks
User Scheduling and Power Allocation for Content Delivery in Caching Helper Networks
复制标题
DOI：
10.1109/icc40277.2020.9148874
复制
发表时间：
2020-06
期刊：
影响因子：
--
通讯作者：
Minseok Choi;A. Molisch;Joongheon Kim
中科院分区：
文献类型：
--
作者：
Minseok Choi;A. Molisch;Joongheon Kim
提出了一种在无线缓存辅助网络中进行内容分发的用户调度和功率分配方法，该方法对干扰模型没有任何严格的约束。为了支持延迟敏感和时变的用户需求，请求内容的实际交付量应该通过高级调度和功率分配来动态控制。此外，由于缺乏对整个时变网络的了解，中央单元难以控制内容交付;因此，提出了一种基于置信传播（BP）的算法，该算法便于在每个缓存助手处对用户调度和功率分配进行分布式决策。所提出的传输方案最大限度地提高了功率效率，同时通过管理用户之间的干扰，限制用户请求满足的平均延迟。仿真结果表明，所提出的方案提供了几乎相同的延迟性能的穷举找到最佳的代价是很少的功耗。
This paper proposes a user scheduling and power allocation method for content delivery in wireless caching helper networks without any stringent constraint on the interference model. For supporting delay-sensitive and time-varying user demands, the actual delivery quantity of the requested content should be dynamically controlled by advanced scheduling and power allocation. In addition, it is difficult for a central unit to control the content delivery due to a lack of knowledge of the entire time-varying network; therefore, a belief-propagation (BP)-based algorithm that facilitates distributed decisions on user scheduling and power allocation at every caching helper is presented. The proposed delivery scheme maximizes power efficiency while limiting the average delay of user request satisfactions by managing interference among users well. Simulation results show that the proposed scheme provides almost the same delay performance as the exhaustively found optimal one at the expense of little power consumption.