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

Research Article

Probabilistic Caching in Wireless Device to Device Networks with Contention Based Multimedia Delivery

Download
166 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-72823-0_41,
        author={Xiaoshi Song and Yuting Geng and Xiangbo Meng and Ning Ye and Jun Liu and Weimin Lei},
        title={Probabilistic Caching in Wireless Device to Device Networks with Contention Based Multimedia Delivery},
        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={Cache-enabled D2D networks Contention based multimedia delivery protocol Optimal probabilistic caching strategy Stochastic geometry Transmission probability Cache hit probability Successful content delivery probability},
        doi={10.1007/978-3-319-72823-0_41}
    }
    
  • Xiaoshi Song
    Yuting Geng
    Xiangbo Meng
    Ning Ye
    Jun Liu
    Weimin Lei
    Year: 2018
    Probabilistic Caching in Wireless Device to Device Networks with Contention Based Multimedia Delivery
    5GWN
    Springer
    DOI: 10.1007/978-3-319-72823-0_41
Xiaoshi Song1,*, Yuting Geng1, Xiangbo Meng1, Ning Ye1, Jun Liu1, Weimin Lei1
  • 1: Northeastern University
*Contact email: songxiaoshi@cse.neu.edu.cn

Abstract

This paper studies the optimal probabilistic caching placement in large-scale cache-enabled D2D networks to maximize the cache hit performance, which is defined as the probability that a random user request can be served by mobile helpers (MHs) in the vicinity. To avoid collisions of the concurrent transmissions, a contention based multimedia delivery protocol is proposed, under which a MH is allowed to transmit only if its back-off timer is the smallest among its associated contenders. By applying tools from stochastic geometry, the optimal caching probability is derived and analyzed. It is shown that the optimal solution of the probabilistic caching placement depends on the density of MHs, the D2D communication range, and the user request distribution. With the derived optimal caching probabilities, we further characterize the transmission probability of MHs and thereby the successful content delivery probability of the cache-enabled D2D network. Simulations are provided to validate our analysis.