Index Coding Algorithms: Cooperative Caching and Delivery for F-RANs

In a Fog Radio Access Network (F-RAN), fog access points (F-APs) are equipped with caches that can store popular files during off-peak hours. Besides, they are densely deployed to have overlapping radio coverage so that requested files can be delivered cooperatively using beamforming. The bottleneck of the network is typically in the bandwidth-limited wireless fronthaul, which connects a cloud server to the F-APs. This work studies index coding design for cooperative caching and delivery in F-RAN to minimize fronthaul traffic and transmit energy. Index coding algorithms are designed considering the cached content at the F-APs and the possibility of beamforming in the access network under coded and uncoded caching schemes. An optimal polynomial-time index coding algorithm for uncoded and repetition caching and an efficient heuristic for Maximum Distance Separable (MDS) coded caching are designed, and their superior performance is verified by simulations. The study is further extended to consider the tradeoff between the traffic load of the fronthaul link and the transmit energy consumed in the access network. At the expense of more fronthaul traffic, beamforming opportunities can be increased, significantly reducing energy consumption. Algorithms to achieve the tradeoff are crafted, and simulation results show that uncoded caching well balances the tradeoff.

Automated summary

This study focuses on cooperative caching and delivery in Fog Radio Access Networks (F-RAN), and designs index coding algorithms to minimize fronthaul traffic and transmit energy. The study also considers the tradeoff between fronthaul link traffic load and transmit energy consumption, and crafts algorithms to achieve this tradeoff.