Communications and Networking. 13th EAI International Conference, ChinaCom 2018, Chengdu, China, October 23-25, 2018, Proceedings

Research Article

Cluster-Based Caching Strategy with Limited Storage in Ultra Dense Networks

Download
87 downloads
  • @INPROCEEDINGS{10.1007/978-3-030-06161-6_11,
        author={Chengjia Hu and Xi Li and Hong Ji and Heli Zhang},
        title={Cluster-Based Caching Strategy with Limited Storage in Ultra Dense Networks},
        proceedings={Communications and Networking. 13th EAI International Conference, ChinaCom 2018, Chengdu, China, October 23-25, 2018, Proceedings},
        proceedings_a={CHINACOM},
        year={2019},
        month={1},
        keywords={Ultra dense network Clustering Caching Download delay Hit ratio},
        doi={10.1007/978-3-030-06161-6_11}
    }
    
  • Chengjia Hu
    Xi Li
    Hong Ji
    Heli Zhang
    Year: 2019
    Cluster-Based Caching Strategy with Limited Storage in Ultra Dense Networks
    CHINACOM
    Springer
    DOI: 10.1007/978-3-030-06161-6_11
Chengjia Hu1,*, Xi Li1,*, Hong Ji1,*, Heli Zhang1,*
  • 1: Beijing University of Posts and Telecommunications
*Contact email: hcj@bupt.edu.cn, lixi@bupt.edu.cn, jihong@bupt.edu.cn, zhangheli@bupt.edu.cn

Abstract

Ultra dense network (UDN) is considered as one of the key techniques to boost the network capacity in 5G. In order to reduce the huge backhaul cost and end-to-end transmission delay, caching the popular content at the edge of UDNs is an inspiring approach. Considering that the storage capacity of a single small base station (SBS) in UDNs is usually limited, SBSs cooperation to store respective file fragments is an interesting approach that needs further investigation. In this paper, we propose a cluster-based caching strategy (CBCS) for limited storage SBSs in UDNs. A novel clustering scheme based on SBSs’s load capacity and location is designed with consideration on files fragments and SBSs cooperation. We target the minimum average download delay under the constraint of the number of SBSs in a cluster. The simulation results show that the proposed algorithm could achieve a better hit ratio and has a lower average download delay.