This work investigates the degrees of freedom (DoF) of a downlink cache-aided cellular network where the locations of base stations (BSs) are modeled as a grid topology and users within a grid cell can only communicate with four nearby BSs. We adopt a cache placement method with uncoded prefetching tailored for the network with partial connectivity. According to the overlapped degree of cached contents among BSs, we propose transmission schemes with no BS cooperation, partial BS cooperation, and full BS cooperation, respectively, for different cache sizes. In specific, the common cached contents among BSs are utilized to cancel some undesired signals by interference neutralization while interference alignment is used to coordinate signals of distinct cached contents. Our achievable results indicate that the reciprocal of per-user DoF of the cellular network decreases piecewise linearly with the normalized cache size µ at each BS, and the gain of BS caching is more significant for the small cache region. Under the given cache placement scheme, we also provide an upper bound of per-user DoF and show that our achievable DoF is optimal when µ ∈ 1 2 , 1 , and within an additive gap of 4 39 to the optimum when µ ∈ 1 4 , 1 2 .
Index TermsCache-aided cellular network, partial connectivity, degrees of freedom, interference alignment and neutralization, cooperative transmission.
I. INTRODUCTIONContent delivery applications such as video streaming have occupied a significant proportion in mobile wireless data traffic. It amounts for more than 63% of the total mobile data in 2019 and is foreseen to contribute 76% in 2025 [2]. Wireless caching [3]-[5] is considered as one of the most effective techniques to cope with this increasing content oriented traffic. Its main idea is to exploit the under-utilized network resources during the off-peak hours by prefetching the popular contents in the local memory of edge nodes in order to accelerate the content delivery. Caching is first studied from an information-theoretic framework, known as coded caching [6] where a server communicates with multiple cache-enabled receivers over a shared error-free link. Receiver caching has been shown as an effective way to reduce the traffic load by creating coded multicast opportunities for the memory-equipped networks [6]- [8]. Then the authors in [9] investigate the role of transmitter caching in a 3 × 3 interference channel, and show that transmitter caching can bring transmit cooperation gain and hence provide an opportunity to increase the degrees of freedom (DoF) of the interference channel. The works [10]- [12] consider caching in a general cacheaided interference network with arbitrary number of transmitters and arbitrary number of receivers. It is found in [10] that with a novel cooperative transmitter and receiver caching strategy, the interference network can be turned opportunistically into a new class of channels, namely, cooperative X-multicast channels. The works [13]-[16] study the caching gain by considering multiple antennas depl...