5G for Future Wireless Networks. First International Conference, 5GWN 2017, Beijing, China, April 21-23, 2017, Proceedings

Research Article

Social-Aware Data Caching Mechanism in D2D-Enabled Cellular Networks

Download
190 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-72823-0_60,
        author={Miao Liu and Jun Li and Tingting Liu and Youjia Chen},
        title={Social-Aware Data Caching Mechanism in D2D-Enabled Cellular Networks},
        proceedings={5G for Future Wireless Networks. First International Conference, 5GWN 2017, Beijing, China, April 21-23, 2017, Proceedings},
        proceedings_a={5GWN},
        year={2018},
        month={1},
        keywords={Cellular network Content caching D2D Social property},
        doi={10.1007/978-3-319-72823-0_60}
    }
    
  • Miao Liu
    Jun Li
    Tingting Liu
    Youjia Chen
    Year: 2018
    Social-Aware Data Caching Mechanism in D2D-Enabled Cellular Networks
    5GWN
    Springer
    DOI: 10.1007/978-3-319-72823-0_60
Miao Liu1,*, Jun Li1,*, Tingting Liu1,*, Youjia Chen2,*
  • 1: Nanjing University of Science and Technology
  • 2: Fujian Normal University
*Contact email: miao.liu@njust.edu.cn, jun.li@njust.edu.cn, liutingting1026@hotmail.com, chenyoujia@fjnu.edu.cn

Abstract

In this paper, we investigate the problem of content caching in wireless cellular networks (CN) using device-to-device (D2D) transmission method to reduce subscriber’s download delay. We focus on how to efficiently allocate files to the selected important nodes (INs), and propose a novel approach for minimizing the downloading latency. In particular, we first model the problem of minimizing delay as a matching game. Then we tackle this game by exploiting the popularity of contents as well as users’ social properties to generate the utility functions of two-side players: INs and files. Based on the utility function, the preference lists of cache entities is developed. For solving this game, we design a user-file caching (UFC) algorithm to achieve a stable matching between INs and files. Simulation and analytical results show that the proposed mechanism is capable of offering a better delay performance than benchmarks, e.g., random caching and recent-used-file caching scheme.