Degrees of Freedom of Cache-Aided Wireless Interference Networks

• Published in: IEEE transactions on information theory Vol. 64; no. 7; pp. 5359 - 5380
• Main Authors: Hachem, Jad, Niesen, Urs, Diggavi, Suhas N.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01-07-2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: cache memory; Caching; Computer memory; Degrees of freedom; Information theory; Interference; Interference channels; Libraries; Multicast; network coding; Optimization; Physical layer; Receivers; Servers; Transmitters; Wireless communication; Wireless networks
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2018.2825321

We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor approximation of the system's degrees of freedom (DoF), for arbitrary number of transmitters, number of receivers, content library size, receiver cache size, and transmitter cache size (as long as the transmitters combined can store the entire content library among them). We demonstrate approximate optimality with respect to information-theoretic bounds that do not impose any restrictions on the caching and delivery strategies. Our characterization reveals three key insights. First, the approximate DoF is achieved using a strategy that separates the physical and network layers. This separation architecture is thus approximately optimal. Second, we show that increasing transmitter cache memory beyond what is needed to exactly store the entire library between all transmitters does not provide more than a constant-factor benefit to the DoF. A consequence is that transmit zero-forcing is not needed for approximate optimality. Third, we derive an interesting tradeoff between the receiver memory and the number of transmitters needed for approximately maximal performance. In particular, if each receiver can store a constant fraction of the content library, then only a constant number of transmitters are needed. Our solution to the caching problem requires formulating and solving a new communication problem, the symmetric multiple multicast X-channel, for which we provide an exact DoF characterization.