An Efficient Fair Content Delivery Scheme for Coded Caching

Coded caching has emerged as one of the promising solutions to deal with an exponentially increasing video traffic. This breakthrough builds on a careful design of file placement such that the total transmission time is minimized by multicasting sub-files simultaneously useful to many users. A number of follow-up works recently studied the extension of coded caching, initially assuming a perfect bottleneck link, to practical wireless channels. However, most of existing works address either the scalability of the cached wireless networks by assuming that each user requests a single file or the dynamic arrival of user requests by ignoring the scalability. In this work, we propose a low-complexity gradient- based scheduling that exploits multicast opportunities offered by coded caching, while keeping a number of multicast groups linear in the number of users. Simulation results illustrate that the proposed algorithm outperforms both coded caching and opportunistic scheduling over time-varying fading channels.