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

作     者：Hu Chengjia Li Xi Ji Hong Zhang Heli 

作者机构：Key Laboratory of Universal Wireless CommunicationsBeijing University of Posts and Telecommunications 

出 版 物：《The Journal of China Universities of Posts and Telecommunications》 (中国邮电高校学报（英文版）)

年 卷 期：2019年第26卷第3期

页      面：1-7页

核心收录：

学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 

基　　金：supported by the National Natural Science Foundation of China (61771070 61671088) 

主　　题：ultra dense network graph coloring caching moving user download delay 

摘      要：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.