Fundamental Limits of Caching in Wireless D2D Networks
Top Cited Papers
- 1 December 2015
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 62 (2), 849-869
- https://doi.org/10.1109/tit.2015.2504556
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 files and have pre-cached information on their devices, subject to a per-node storage capacity constraint. A similar problem has already been considered in an infrastructure setting, where all users receive a common multicast (coded) message from a single omniscient server (e.g., a base station having all the files in the library) through a shared bottleneck link. In this paper, we consider a D2D infrastructureless version of the problem. We propose a caching strategy based on deterministic assignment of subpackets of the library files, and a coded delivery strategy where the users send linearly coded messages to each other in order to collectively satisfy their demands. We also consider a random caching strategy, which is more suitable to a fully decentralized implementation. Under certain conditions, both approaches can achieve the information theoretic outer bound within a constant multiplicative factor. In our previous work, we showed that a caching D2D wireless network with one-hop communication, random caching, and uncoded delivery (direct file transmissions) achieves the same throughput scaling law of the infrastructure-based coded multicasting scheme, in the regime of large number of users and files in the library. This shows that the spatial reuse gain of the D2D network is order-equivalent to the coded multicasting gain of single base station transmission. It is, therefore, natural to ask whether these two gains are cumulative, i.e., if a D2D network with both local communication (spatial reuse) and coded multicasting can provide an improved scaling law. Somewhat counterintuitively, we show that these gains do not cumulate (in terms of throughput scaling law). This fact can be explained by noticing that the coded delivery scheme creates messages that are useful to multiple nodes, such that it benefits from broadcasting to as many nodes as possible, while spatial reuse capitalizes on the fact that the communication is local, such that the same time slot can be reused in space across the network. Unfortunately, these two issues are in contrast with each other.Keywords
Other Versions
Funding Information
- Intel Video Aware Wireless Networks Program
- National Science Foundation (CCF-1423140, CIF-1161801)
This publication has 54 references indexed in Scilit:
- Fundamental Limits of Caching With Secure DeliveryIEEE Transactions on Information Forensics and Security, 2014
- On the average performance of caching and coded multicasting with random demandsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Hierarchical coded cachingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Multi-level coded cachingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Coded caching with nonuniform demandsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- Fundamental limits of distributed caching in D2D wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Network-coded caching-aided multicast for efficient content deliveryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Dynamic in-network caching for energy efficient content deliveryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- FlashLinQ: A synchronous distributed scheduler for peer-to-peer ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Raptor codesIEEE Transactions on Information Theory, 2006