【24h】

Mobility aware caching incentive scheme for D2D cellular networks

机译:D2D蜂窝网络的移动感知缓存激励方案

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

摘要

Device-to-device (D2D) caching network is proposed to cope with the explosively growing traffic of next-generation mobile networks. Given the limited mobile users' (MU) caching capacity, it is significant to decide which contents and how much proportion of each content should be cached. Based on the selfish nature and varied content preference of MUs, we propose a mobility aware caching incentive scheme, in which base stations (BS) reward MUs for sharing contents with others through D2D communication. By solving the problem of maximizing MU utility and minimizing BS cost at the same time, we obtain each MU's caching strategy and optimal unit reward provided by BS with adapted gradient projection algorithm. Comparisons are deliberated with several baseline caching schemes without incentive, in order to measure the performance of the proposed scheme. Simulation results show that under our settings, BS serving cost can be reduced by up to 45.6% when the optimal reward is selected compared with the fair caching scheme, the advantage is more obvious when MUs' mobility speed gets higher. Furthermore, the proposed scheme outperforms greedy caching, fair caching and random caching scheme in terms of MU utility under different distributions of content popularity.
机译:提出了设备到设备(D2D)缓存网络,以应对下一代移动网络爆炸性增长的流量。考虑到有限的移动用户(MU)缓存容量,决定应缓存哪些内容以及每种内容应占多少比例非常重要。基于MU的自私性质和多样的内容偏好,我们提出了一种移动感知缓存激励方案,其中基站(BS)奖励MU通过D2D通信与他人共享内容。通过同时解决最大化MU利用率和最小化BS成本的问题,我们获得了每个MU的缓存策略以及由BS提供的自适应梯度投影算法的最优单位奖励。为了评估提议的方案的性能,在没有激励的情况下,使用几种基线缓存方案进行了比较研究。仿真结果表明,在这种情况下,与公平缓存方案相比,选择最优奖励可以使BS服务成本降低多达45.6%,当MU的移动速度提高时,优势更加明显。此外,在内容受欢迎程度不同的情况下,就MU效用而言,该方案优于贪婪缓存,公平缓存和随机缓存方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号