The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Fundamental Limits of Caching in Wireless D2D Networks
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
Cited by
Mobile Edge Intelligence and Computing for the Internet of Vehicles
Zhang, J., & Letaief, K. B. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2947490 · Cited by 537
Mobility-Aware Edge Caching and Computing in Vehicle Networks: A Deep Reinforcement Learning
Tan, L. T., & Hu, R. Q. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2867191 · Cited by 356
Li, L., Zhao, G., & Blum, R. S. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2820021 · Cited by 282
Optimal and Scalable Caching for 5G Using Reinforcement Learning of Space-Time Popularities
Sadeghi, A., Sheikholeslami, F., & Giannakis, G. B. (2018) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2017.2787979 · Cited by 257
Proactive Content Caching by Exploiting Transfer Learning for Mobile Edge Computing
Hou, T., Feng, G., Qin, S., & Jiang, W. (2017) · GLOBECOM 2017 - 2017 IEEE Global Communications Conference · doi:10.1109/glocom.2017.8254636 · Cited by 85
Metadata
- Authors
- Ji, M., Caire, G., & Molisch, A. F.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2016-02
- Volume
- 62
- Issue
- 2
- Pages
- 849-869
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1606035500
- Cited by
- 596
- References
- 1
- FWCI
- 89.41
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fundamental Limits of Caching in Wireless D2D Networks. https://app.cochat.ai/papers/10.1109/tit.2015.2504556
- The paper
- Ji, M., Caire, G., & Molisch, A. F. (2016). Fundamental Limits of Caching in Wireless D2D Networks. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2015.2504556
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.