A Storage-Latency Tradeoff Study for Cache-Aided MIMO Interference Networks

Abstract

Caching is an effective technique to improve user perceived experience for massive content delivery in wireless networks. An essential problem in cache-aided wireless networks is to find what and how much gain can be achieved by caching. This paper provides a study of the fundamental storage-latency tradeoff for a cache-aided MIMO interference network with 3 transmitters and 3 receivers and each node equipped with antennas. By using a newly proposed novel file splitting and caching strategy, the network topology during the content delivery phase is turned opportunistically to MIMO X channel, MIMO broadcast channel, MIMO multicast channel, or a hybrid form of these channels. Linear-precoding based interference management schemes such as interference alignment and neutralization over finite symbol extension are designed for these channels. We characterize the storage-latency tradeoff by fractional delivery time (FDT), a metric to evaluate the worst-case delivery time of the actual traffic load at a rate specified by the degrees of freedom (DoF) of the considered channel. The achievable FDT of our proposed scheme decreases piecewise linearly with the normalized cache sizes and is inversely proportional to the number of antennas. It is also shown that the achievable FDT is optimal at certain cache size regions and is within a multiplicative gap of 2 from the optimum at other regions.