Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback

Zhang, Jingjing; Elia, Petros

doi:10.1109/allerton.2016.7852333

Cited by 50 publications

(110 citation statements)

References 46 publications

Supporting

Mentioning

107

Contrasting

Order By: Relevance

“…Note that the above relaxation is commonly used to obtain outer bounds in cache-aided setups, e.g. [6], [16], [20], [26]. Next, we follow the same general footsteps of [16, Sec.…”

Section: Appendix a Proof Of Lemmamentioning

confidence: 99%

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

Piovano

Joudeh

Clerckx

2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

We consider the problem of cache-aided interference management in a network consisting of K T single-antenna transmitters and K R single-antenna receivers, where each node is equipped with a cache memory. Transmitters communicate with receivers over two heterogenous parallel subchannels: the Psubchannel for which transmitters have perfect instantaneous knowledge of the channel state, and the N-subchannel for which the transmitters have no knowledge of the instantaneous channel state. Under the assumptions of uncoded placement and separable one-shot linear delivery over the two subchannels, we characterize the optimal degrees-of-freedom (DoF) to within a constant multiplicative factor of 2. We extend the result to a decentralized setting in which no coordination is required for content placement at the receivers. In this case, we characterize the optimal one-shot linear DoF to within a factor of 3.

show abstract

“…Note that the above relaxation is commonly used to obtain outer bounds in cache-aided setups, e.g. [6], [16], [20], [26]. Next, we follow the same general footsteps of [16, Sec.…”

Section: Appendix a Proof Of Lemmamentioning

confidence: 99%

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

Piovano

Joudeh

Clerckx

2020

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…We adopt a latency-oriented performance metric, called the normalized delivery time (NDT), introduced in [25], [27], [33], and widely used in the literature [30]- [32], [36], [38]- [40]. It is defined as the worstcase latency required to serve any possible user demand vector d, normalized by the required time to transmit a single file in a point-to-point baseline channel, in the high signal-to-noise ratio (SNR) regime.…”

Section: Performance Metricmentioning

confidence: 99%

“…In [19] and [20], content delivery over an erasure broadcast channel is considered, while a Gaussian broadcast channel is studied in [21], [22] and [23]. Erasure and Gaussian broadcast delivery channels with feedback are studied in [24] and [25], respectively. Main challenge in these works is to exploit the broadcast channel in a non-trivial manner, that goes beyond reducing the problem to delivery over a shared link whose rate is dictated by the user with the worst channel quality.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Content Caching and Delivery in Wireless Radio Access Networks

Tao

Gündüz

et al. 2019

IEEE Trans. Commun.

View full text Add to dashboard Cite

Today's mobile data traffic is dominated by content-oriented traffic. Caching popular contents at the network edge can alleviate network congestion and reduce content delivery latency. This paper provides a comprehensive and unified study of caching and delivery techniques in wireless radio access networks (RANs) with caches at all edge nodes (ENs) and user equipments (UEs). Three cache-aided RAN architectures are considered: RANs without fronthaul, with dedicated fronthaul, and with wireless fronthaul. It first reviews in a tutorial nature how caching facilitates interference management in these networks by enabling interference cancellation (IC), zero-forcing (ZF), and interference alignment (IA). Then, two new delivery schemes are presented. One is for RANs with dedicated fronthaul, which considers centralized cache placement at the ENs but both centralized and decentralized placement at the UEs. This scheme combines IA, ZF, and IC together with soft-transfer fronthauling. The other is for RANs with wireless fronthaul, which considers decentralized cache placement at all nodes. It leverages the broadcast nature of wireless fronthaul to fetch not only uncached but also cached contents to boost transmission cooperation among the ENs. Numerical results show that both schemes outperform existing results for a wide range of system parameters, thanks to the various caching gains obtained opportunistically. Index TermsCoded caching, delivery time, fog radio access networks, interference alignment, interference cancellation, interference management, wireless edge caching, zero-forcing.

show abstract

“…4. (26), (27). The transmitter sends x n d , from C d,n , which corresponds to m d ,m d,1 , andm d,2 , i.e., x n d m d ,m…”

mentioning

confidence: 99%

The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II

Nafea

Yener

2018

2018 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

This paper introduces the notion of cache-tapping into the information theoretic models of coded caching. In particular, the wiretap II channel model in the presence of multiple receivers equipped with fixed-size cache memories, and an adversary who is able to choose symbols to tap into from cache placement, in addition to or in lieu of, delivery transmission, is introduced. The model is hence termed the caching broadcast channel with a wire and cache tapping adversary of type II. The legitimate parties know neither whether cache placement, delivery, or both phases are tapped, nor the positions in which they are tapped. Only the size of the overall tapped set is known. For the instance of two receivers and two library files, the strong secrecy capacity of the model, i.e., the maximum achievable file rate while keeping the overall library strongly secure, is identified. Lower and upper bounds on the achievable strong secrecy file rate are derived when the library has more than two files. Achievability schemes in this paper rely on a code design which combines wiretap coding, security embedding codes, one-time pad keys, and coded caching. A genie-aided upper bound, in which a genie provides the transmitter with user demands before cache placement, establishes the converse for the two files instance. For the library of more than two files, the upper bound is constructed by three successive channel transformations. Our results establish that strong information theoretic security is possible against a powerful adversary who optimizes its attack over both phases of communication in a cache-aided system. Fig. 1: The caching broadcast channel with a wire and cache tapping adversary of type II (CBC-WCT II). The adversary chooses tapping sets S 1 and S 2 in placement and delivery. receiver requests two files from the library.The remainder of the paper is organized as follows. Section II describes the communication system proposed in this paper. Section III presents the main results. The proofs for these results are provided in Sections IV, V, and VI. Section VII provides a discussion about the communication model in question and the presented results. Section VIII concludes the paper.

show abstract

Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedback

Cited by 50 publications

References 46 publications

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

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

Content Caching and Delivery in Wireless Radio Access Networks

The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II

Contact Info

Product

Resources

About