...
首页> 外文期刊>Signal Processing, IET >Joint service improvement and content placement for cache-enabled heterogeneous cellular networks
【24h】

Joint service improvement and content placement for cache-enabled heterogeneous cellular networks

机译:启用缓存的异构蜂窝网络的联合服务改进和内容放置

获取原文
获取原文并翻译 | 示例
           

摘要

Caching popular contents in the storage of base stations (BSs) has emerged as a promising solution for reducing the transmission latency and providing extra-high throughput. This study tackles the optimal trade-off problem between the sum of effective rates and backhaul saving through joint service improvement and content placement in cache-enabled heterogeneous cellular networks while guaranteeing the quality-of-service requirements of all user terminals (UTs) and backhaul traffic constraints of all BSs. However, there exists an intractable issue of mixing the integer nature into the feasible region in the nonlinear optimisation problem. To this end, the authors decompose the optimisation problem into three subproblems by alternately fixing two of three classes of variables (i.e. UT association, power control, and content placement). Aiming at these subproblems, they, respectively, convert them into the tractable forms and propose the corresponding algorithms. By combining them, they propose a three-tier iterative algorithm for jointly optimising UT association and cache placement. Finally, numerical results have verified the effectiveness of proposed schemes.
机译:在基站(BS)的存储中缓存流行的内容已成为一种有希望的解决方案,用于减少传输延迟并提供超高吞吐量。这项研究通过在启用缓存的异构蜂窝网络中通过联合服务改进和内容放置来解决有效速率和回程节省之间的最佳权衡问题,同时保证所有用户终端(UT)和回程的服务质量要求所有基站的流量限制。然而,在非线性优化问题中存在将整数性质混合到可行区域中的棘手问题。为此,作者通过交替固定三个类别的变量中的两个类别(即UT关联,功率控制和内容放置)将优化问题分解为三个子问题。针对这些子问题,它们分别将它们转换为易于处理的形式并提出相应的算法。通过组合它们,他们提出了三层迭代算法,以共同优化UT关联和缓存放置。最后,数值结果验证了所提方案的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号