This paper studies the fundamental tradeoff between storage and latency in a general wireless interference network with caches equipped at all transmitters and receivers. The tradeoff is characterized by an information-theoretic metric, normalized delivery time (NDT), which is the worst-case delivery time of the actual traffic load at a transmission rate specified by degrees of freedom (DoF) of a given channel. We obtain both an achievable upper bound and a theoretical lower bound of the minimum NDT for any number of transmitters, any number of receivers, and any feasible cache size tuple. We show that the achievable NDT is exactly optimal in certain cache size regions, and is within a bounded multiplicative gap to the theoretical lower bound in other regions. In the achievability analysis, we first propose a novel cooperative transmitter/receiver coded caching strategy. It offers the freedom to adjust file splitting ratios for NDT minimization. We then propose a delivery strategy which transforms the considered interference network into a new class of cooperative X-multicast channels. It leverages local caching gain, coded multicasting gain, and transmitter cooperation gain (via interference alignment and interference neutralization) opportunistically. Finally, the achievable NDT is obtained by solving a linear programming problem. This study reveals that with caching at both transmitter and receiver sides, the network can benefit simultaneously from traffic load reduction and transmission rate enhancement, thereby effectively reducing the content delivery latency. Index TermsWireless cache network, coded caching, content delivery, multicast, and interference management.∪ mR i R,T c ,n : mR i R,T c ,n ∈ MR i R,T c [N + 1] , R ∪R i ∋ q, |T c | = t − 1 .
Caching is an effective technique to improve user perceived experience for content delivery in wireless networks. Wireless caching differs from traditional web caching in that it can exploit the broadcast nature of wireless medium and hence opportunistically change the network topologies. This paper studies a cache-aided MIMO interference network with 3 transmitters each equipped with M antennas and 3 receivers each with N antennas. With caching at both the transmitter and receiver sides, the network is changed to hybrid forms of MIMO broadcast channel, MIMO X channel, and MIMO multicast channels. We analyze the degrees of freedom (DoF) of these new channel models using practical interference management schemes. Based on the collective use of these DoF results, we then obtain an achievable normalized delivery time (NDT) of the network, an information-theoretic metric that evaluates the worst-case delivery time at given cache sizes. The obtained NDT is for arbitrary M , N and any feasible cache sizes. It is shown to be optimal in certain cases and within a multiplicative gap of 3 from the optimum in other cases. The extension to the network with arbitrary number of transmitters and receivers is also discussed. Index TermsCoded caching, degrees of freedom, interference management, multicast, linear transmission scheme.
This paper studies the storage-latency tradeoff in the 3 × 3 wireless interference network with caches equipped at all transmitters and receivers. The tradeoff is characterized by the so-called fractional delivery time (FDT) at given normalized transmitter and receiver cache sizes. We first propose a generic cooperative transmitter/receiver caching strategy with adjustable file splitting ratios. Based on this caching strategy, we then design the delivery phase carefully to turn the considered interference channel opportunistically into broadcast channel, multicast channel, X channel, or a hybrid form of these channels. After that, we obtain an achievable upper bound of the minimum FDT by solving a linear programming problem of the file splitting ratios. The achievable FDT is a convex and piece-wise linear decreasing function of the cache sizes. Receiver local caching gain, coded multicasting gain, and transmitter cooperation gain (interference alignment and interference neutralization) are leveraged in different cache size regions.
Abstract-In this paper, we consider the arbitrary MIMO two-way relay channels, where there are K source nodes, each equipped with Mi antennas, for i = 1, 2, · · · , K, and one relay node, equipped with N antennas. Each source node can exchange independent messages with arbitrary other source nodes assisted by the relay. We extend our newly-proposed transmission scheme, generalized signal alignment (GSA) in [1], to arbitrary MIMO two-way relay channels when N > Mi + Mj, ∀i = j. The key idea of GSA is to cancel the interference for each data pair in its specific subspace by two steps. This is realized by jointly designing the precoding matrices at all source nodes and the processing matrix at the relay node. Moreover, the aligned subspaces are orthogonal to each other. By applying the GSA, we show that a necessary condition on the antenna configuration to achieve the DoF upper bound min{Mi − Ms − Mt + ds,t | ∀s, t}. Here, ds,t denotes the DoF of the message exchanged between source node s and t. In the special case when the arbitrary MIMO two-way relay channel reduces to the K-user MIMO Y channel, we show that our achievable region of DoF upper bound is larger than the previous work.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.