Cache Enabled Cellular Network: Algorithm for Cache Placement and Guarantees

This letter presents a novel algorithm for content placement in the small base stations (SBSs) caches in a heterogeneous wireless network. The problem of maximizing the average rate of cache hit in a heterogeneous wireless network for a given probability distribution of content popularity and a given network topology, under the constraint of cache size at each SBS is proposed. The optimal cache placement algorithm turns out to be NP-Hard, and hence, a novel approximate solution is presented. Further, the theoretical guarantees on the performance of the proposed algorithm is also provided. Finally, simulation results demonstrate that the proposed edge caching strategy performs better than the conventional greedy caching policy, least recently used, and least frequently used algorithms.