...
首页> 外文期刊>IEEE transactions on wireless communications >Multidimensional Cooperative Caching in CoMP-Integrated Ultra-Dense Cellular Networks
【24h】

Multidimensional Cooperative Caching in CoMP-Integrated Ultra-Dense Cellular Networks

机译:CoMP集成的超密集蜂窝网络中的多维协作缓存

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

摘要

Small base stations (BSs) equipped with caching units are potential to provide improved quality of service (QoS) for multimedia service in ultra-dense cellular networks (UDCNs). In addition, the Coordinated MultiPoint (CoMP) transmission method, allowing multiple BSs to jointly serve users, is proposed to increase the throughput of cell-edge mobile terminals (MTs). Yet, the combination of content caching and CoMP in UDCNs is still not well explored for future networks. In this paper, we focus on the application of caching in CoMP-integrated UDCNs, where the cache-enabled BSs can collaboratively serve each MT using either joint transmission or single transmission. We propose a multidimensional cooperative caching (MDCC) scheme, supporting storage-dimension and transmission-dimension cooperations for the content placement. In particular, we analyze the delivery delay based on request patterns, transmission method, and the proposed cooperation strategy. Then the content placement problem is formulated as a problem of minimizing the overall expected delay. The problem is a mixed binary integer linear programming (BILP) problem, which is NP-hard. Therefore, we address the problem with approximation and substitution, and design a genetic algorithm (GA) based method to solve it. Simulation results demonstrate that the proposed MDCC scheme contributes performance gain in terms of content delivery delay in both cell-core and cell-edge areas.
机译:配备有缓存单元的小型基站(BS)可能会为超密集蜂窝网络(UDCN)中的多媒体服务提供更高的服务质量(QoS)。另外,提出了允许多个BS共同为用户服务的协作多点(CoMP)传输方法,以增加小区边缘移动终端(MT)的吞吐量。然而,UDCN中内容缓存和CoMP的结合对于未来的网络仍未得到很好的探索。在本文中,我们将重点放在缓存在CoMP集成的UDCN中的应用,其中启用缓存的BS可以使用联合传输或单个传输来协同服务每个MT。我们提出了一种多维协作缓存(MDCC)方案,该协议支持用于内容放置的存储维度和传输维度合作。特别是,我们根据请求模式,传输方法和提出的合作策略来分析交付延迟。然后,将内容放置问题表述为使总预期延迟最小化的问题。问题是一个混合二进制整数线性规划(BILP)问题,这是NP难题。因此,我们用逼近和替代来解决该问题,并设计一种基于遗传算法(GA)的方法来解决该问题。仿真结果表明,所提出的MDCC方案在小区核心和小区边缘区域的内容传递延迟方面均有助于提高性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号