Channel Aware Greedy Algorithm for MISO Cache-Aided Communication

Abstract

We present novel schemes for cache-aided communication over networks with a multi-antenna base station (BS) that serves multiple single-antenna users. The schemes are based on a greedy scheduling [1], which simultaneously transmits coded messages to disjoint groups of users. The proposed algorithms use the channel state information to opportunistically choose the groups to be served together and to allocate power to each coded message in order to minimize the overall communication delay. Numerical study shows that the new schemes outperform the previously known schemes.