English

On D2D Caching with Uncoded Cache Placement

Information Theory 2021-06-15 v1 math.IT

Abstract

We consider a cache-aided wireless device-to-device (D2D) network under the constraint of one-shot delivery, where the placement phase is orchestrated by a central server. We assume that the devices' caches are filled with uncoded data, and the whole file database at the server is made available in the collection of caches. Following this phase, the files requested by the users are serviced by inter-device multicast communication. For such a system setting, we provide the exact characterization of load-memory trade-off, by deriving both the minimum average and the minimum peak sum-loads of links between devices, for a given individual memory size at disposal of each user.

Keywords

Cite

@article{arxiv.2106.06635,
  title  = {On D2D Caching with Uncoded Cache Placement},
  author = {Çağkan Yapar and Kai Wan and Rafael F. Schaefer and Giuseppe Caire},
  journal= {arXiv preprint arXiv:2106.06635},
  year   = {2021}
}

Comments

This paper was presented in the IEEE International Symposium on Information Theory (ISIT 2019) in Paris, France. Longer version available at arXiv:1901.05921

R2 v1 2026-06-24T03:07:12.344Z