Fundamental Limits of Distributed Caching in D2D Wireless Networks
arXiv:1304.5856
Abstract
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 possible files and user devices cache information in the form of linear combinations of packets from the files in the library (coded caching). We consider the combined effect of coding in the caching and delivery phases, achieving "coded multicast gain", and of spatial reuse due to local short-range D2D communication. Somewhat counterintuitively, we show that the coded multicast gain and the spatial reuse gain do not cumulate, in terms of the throughput scaling laws. In particular, the spatial reuse gain shown in our previous work on uncoded random caching and the coded multicast gain shown in this paper yield the same scaling laws behavior, but no further scaling law gain can be achieved by using both coded caching and D2D spatial reuse.
5 pages, 3 figures, submitted to ITW 2013
References in corpus (3)
Cited by in corpus (13)
- Speeding Up Distributed Machine Learning Using Codes
- Adaptive Video Streaming for Wireless Networks with Multiple Users and Helpers
- Fundamental Limits of Caching: Improved Bounds For Small Buffer Users
- Wireless Multihop Device-to-Device Caching Networks
- Fundamental Limits of Caching
- On the Average Performance of Caching and Coded Multicasting with Random Demands
- Caching and Coded Multicasting: Multiple Groupcast Index Coding
- Coded Caching and Content Delivery with Heterogeneous Distortion Requirements
- Cache-Enabled Broadcast Packet Erasure Channels with State Feedback
- Wireless Coded Caching: A Topological Perspective
- Centralized Coded Caching for Heterogeneous Lossy Requests
- Mixed-Timescale Online PHY Caching for Dual-Mode MIMO Cooperative Networks
- The Interplay between Massive MIMO and Underlaid D2D Networking