Fundamental limits of caching in wireless D2D networks
We consider a wireless device-to-device (D2D) network where communication is restricted
to be single-hop. Users make arbitrary requests from a finite library of files and have pre …
to be single-hop. Users make arbitrary requests from a finite library of files and have pre …
Order-optimal rate of caching and coded multicasting with random demands
We consider the canonical shared link caching network formed by a source node, hosting a
library of m information messages (files), connected via a noiseless multicast link to n user …
library of m information messages (files), connected via a noiseless multicast link to n user …
Coded caching under arbitrary popularity distributions
Caching plays an important role in reducing the backbone traffic when serving high-volume
multimedia content. Recently, a new class of coded caching schemes have received …
multimedia content. Recently, a new class of coded caching schemes have received …
Adding transmitters dramatically boosts coded-caching gains for finite file sizes
E Lampiris, P Elia - IEEE Journal on Selected Areas in …, 2018 - ieeexplore.ieee.org
In the context of coded caching in the K-user broadcast channel, our work reveals the
surprising fact that having multiple (L) transmitting antennas, dramatically ameliorates the …
surprising fact that having multiple (L) transmitting antennas, dramatically ameliorates the …
Finite-length analysis of caching-aided coded multicasting
We study a noiseless broadcast link serving K users whose requests arise from a library of N
files. Every user is equipped with a cache of size M files each. It has been shown that by …
files. Every user is equipped with a cache of size M files each. It has been shown that by …
Fundamental limits of coded caching with multiple antennas, shared caches and uncoded prefetching
E Parrinello, A Ünsal, P Elia - IEEE Transactions on Information …, 2019 - ieeexplore.ieee.org
The work explores the fundamental limits of coded caching in the setting where a transmitter
with potentially multiple (N 0) antennas serves different users that are assisted by a smaller …
with potentially multiple (N 0) antennas serves different users that are assisted by a smaller …
Fog-aided wireless networks for content delivery: Fundamental latency tradeoffs
A Sengupta, R Tandon… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
A fog-aided wireless network architecture is studied in which edge nodes (ENs), such as
base stations, are connected to a cloud processor via dedicated fronthaul links while also …
base stations, are connected to a cloud processor via dedicated fronthaul links while also …
Coded caching with linear subpacketization is possible using Ruzsa-Szeméredi graphs
K Shanmugam, AM Tulino… - 2017 IEEE International …, 2017 - ieeexplore.ieee.org
Coded caching is a problem where encoded broadcasts are used to satisfy users requesting
popular files and having caching capabilities. Recent work by Maddah-Ali and Niesen …
popular files and having caching capabilities. Recent work by Maddah-Ali and Niesen …
Fundamental limits of caching with secure delivery
A Sengupta, R Tandon… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
Caching is emerging as a vital tool for alleviating the severe capacity crunch in modern
content-centric wireless networks. The main idea behind caching is to store parts of the …
content-centric wireless networks. The main idea behind caching is to store parts of the …
Coded caching for multi-level popularity and access
J Hachem, N Karamchandani… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
To address the exponentially rising demand for wireless content, the use of caching is
emerging as a potential solution. It has been recently established that joint design of content …
emerging as a potential solution. It has been recently established that joint design of content …