Topological Content Delivery with Feedback and Random Receiver Cache

04/28/2021
by   Alireza Vahid, et al.
0

We study the problem of content delivery in two-user interference channels with altering topology, random available cache at the receivers, and delayed channel knowledge at the transmitter. We establish a new set of outer-bounds on the achievable rates when each receiver has access to a random fraction of the message intended for the other receiver, and when each transmitter is aware of which part of its own message is known to the unintended receiver. The outer-bounds reveal the significant potential rate boost associated with even a small amount of side-information at each receiver. The key in deriving the bounds is to quantify the baseline entropy that will always become available to the unintended receiver given the altering topology and the already available side-information. We will also present matching achievable rates in certain scenarios and outline the challenges in more general settings.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/01/2021

Content Delivery over Broadcast Erasure Channels with Distributed Random Cache

We study the content delivery problem between a transmitter and two rece...
01/09/2018

Capacity Results for Finite-Field X-Channels with Delayed CSIT

We establish the capacity region of the two-user Finite-Field Fading X-C...
10/27/2020

Topological Interference Management with Confidential Messages

The topological interference management (TIM) problem refers to the stud...
03/15/2019

Wyner's Network on Caches: Combining Receiver Caching with a Flexible Backhaul

In this work, we study a large linear interference network with an equal...
06/02/2021

Cooperative Encoding and Decoding of Mixed Delay Traffic under Random-User Activity

This paper analyses the multiplexing gain (MG) achievable over Wyner's s...
08/20/2021

On Interference Channels with Gradual Data Arrival

We study memoryless interference channels with gradual data arrival in t...
12/20/2021

Relational hyperevent models for polyadic interaction networks

Polyadic (one-to-many) social interaction happens when one sender addres...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.