中国邮电高校学报(英文版) ›› 2019, Vol. 26 ›› Issue (3): 1-7.doi: 10.19682/j.cnki.1005-8885.2019.0011

• Wireless •    下一篇

Efficient caching strategy based on graph coloring for moving users in ultra dense networks

胡成佳1,李曦1,纪红2,张鹤立1   

  1. 1. 北京邮电大学
    2. 北邮199信箱
  • 收稿日期:2018-08-01 修回日期:2019-01-07 出版日期:2019-06-30 发布日期:2019-06-30
  • 通讯作者: 胡成佳 E-mail:915578776@qq.com

Efficient caching strategy based on graph coloring for moving users in ultra dense networks

Xi LI 2,Zhang Heli   

  • Received:2018-08-01 Revised:2019-01-07 Online:2019-06-30 Published:2019-06-30

摘要: Caching popular files in small-cell base stations (SBSs) is considered as a promising technique to meet the demand of ever growing mobile data traffic in ultra dense networks (UDNs). Considering the limited cache capacity and dense deployment of SBSs, how to support uninterrupted and successful caching downloading for moving users is still a challenging problem. In this paper, a graph-coloring-based caching (GCC) algorithm in UDN for moving user under limited SBS storage capacities is proposed. Firstly, considering there may be downloading interruption or even failure due to the random moving of users and small coverage of SBSs, graph coloring algorithm (GCA) is employed for grouping the SBS to cache fragments of several files. Then, the problem of how to conduct caching placement on SBSs is formulated aiming to maximize the amount of data downloaded from SBSs. Finally, an efficient heuristic solution is proposed to get an optimal result. Simulation results show that the algorithm performs better than other caching strategies in prior work, in terms of reducing both backhaul traffic and user download delay.

关键词: ultra dense network, graph coloring, caching, moving user, download delay

Abstract: Caching popular files in small-cell base stations (SBSs) is considered as a promising technique to meet the demand of ever growing mobile data traffic in ultra dense networks (UDNs). Considering the limited cache capacity and dense deployment of SBSs, how to support uninterrupted and successful caching downloading for moving users is still a challenging problem. In this paper, a graph-coloring-based caching (GCC) algorithm in UDN for moving user under limited SBS storage capacities is proposed. Firstly, considering there may be downloading interruption or even failure due to the random moving of users and small coverage of SBSs, graph coloring algorithm (GCA) is employed for grouping the SBS to cache fragments of several files. Then, the problem of how to conduct caching placement on SBSs is formulated aiming to maximize the amount of data downloaded from SBSs. Finally, an efficient heuristic solution is proposed to get an optimal result. Simulation results show that the algorithm performs better than other caching strategies in prior work, in terms of reducing both backhaul traffic and user download delay.

Key words: ultra dense network, graph coloring, caching, moving user, download delay