Random Caching Based Cooperative Transmission in HetNets in the Presence of Popularity Prediction Errors

Abstract

In this paper, we jointly explore random caching and cooperative transmission based on cooperative radius in HetNets. Using tools from stochastic geometry, we obtain the tractable expression of the average successful transmission probability (STP) under our proposed scheme. By maximizing the average STP, we formulate the optimization problem to find the optimal policy. Given the existence of popularity prediction errors in practice, we then examined two types of errors: errors in file popularity prediction and errors in file library size estimation. By comparing with several existing caching policies in the literature (e.g., the most popular caching and the uniform caching), we demonstrated the robustness of our proposed scheme in the presence of errors.