Design and Analysis of Coded Caching Schemes in Stochastic Wireless Networks

Coded caching is a technique that promises significant reductions in network traffic by exploiting the multicast opportunities among multiple cache-enabled users. Most works in this area investigate the fundamental performance limits of coded caching from an information-theoretic perspective. In this paper, from a practical perspective, we focus on the design and analysis of the coded caching scheme in large-scale stochastic networks with dynamic traffic. Aiming at the challenges of the large number of users, dynamic packet requests, and distance-dependent interference, the packet caching scheme and packet delivery scheme are jointly designed to ensure the availability of the coded caching gain. To characterize the coded caching performance, the queue dynamic of the packet requests and channel state are first analyzed. Then by combining the successive group decoding theory and stochastic geometry approach, the network interference is characterized and the successful transmission probability of the multicast coded signal is further derived. Moreover, the coded caching scheme is optimized to minimize the average delay of the packet request, which is proved to ensure service fairness and reduce the complexities of network performance analysis. The analytical and numerical results provide useful insights for the provisioning and planning of the coded caching network.