Cache-aided Interference Management Using Hypercube Combinatorial Cache Designs

01/31/2019
by   Xiang Zhang, et al.
0

We consider a cache-aided interference network which consists of a library of N files, K_T transmitters and K_R receivers (users), each equipped with a local cache of size M_T and M_R files respectively, and connected via a discrete-time additive white Gaussian noise channel. Each receiver requests an arbitrary file from the library. The objective is to design a cache placement without knowing the receivers' requests and a communication scheme such that the sum Degrees of Freedom (sum-DoF) of the delivery is maximized. This network model has been investigated by Naderializadeh et al., who proposed a prefetching and a delivery schemes that achieves a sum-DoF of {M_TK_T+K_RM_R/N, K_R}. One of biggest limitations of this scheme is the requirement of high subpacketization level. This paper is the first attempt in the literature (according to our knowledge) to reduce the file subpacketization in such a network. In particular, we propose a new approach for both prefetching and linear delivery schemes based on a combinatorial design called hypercube. We show that required number of packets per file can be exponentially reduced compared to the state of the art scheme proposed by Naderializadeh et al., or the NMA scheme. When M_TK_T+K_RM_R ≥ K_R, the achievable one-shot sum-DoF using this approach is M_TK_T+K_RM_R/N , which shows that 1) the one-shot sum-DoF scales linearly with the aggregate cache size in the network and 2) it is within a factor of 2 to the information-theoretic optimum. Surprisingly, the identical and near optimal sum-DoF performance can be achieved using the hypercube approach with a much less file subpacketization.

READ FULL TEXT
research
12/16/2017

Degrees of Freedom of Interference Networks with Transmitter-Side Caches

This paper studies cache-aided interference networks with arbitrary numb...
research
03/11/2018

Cache-Assisted Broadcast-Relay Wireless Networks: A Delivery-Time Cache-Memory Tradeoff

An emerging trend of next generation communication systems is to provide...
research
12/04/2018

Centralized and Decentralized Cache-Aided Interference Management in Heterogeneous Parallel Channels

We consider the problem of cache-aided interference management in a netw...
research
06/19/2018

Rate-Memory Trade-Off for Caching and Delivery of Correlated Sources

This paper studies the fundamental limits of content delivery in a cache...
research
12/06/2018

A Converse Bound for Cache-Aided Interference Networks

In this paper, an interference network with arbitrary number of transmit...
research
02/26/2020

Symmetric uncoded caching schemes with low subpacketization levels

Caching is a commonly used technique in content-delivery networks which ...

Please sign up or login with your details

Forgot password? Click here to reset