The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks
Open accessAbstract
We consider a wireless device-to-device (D2D) network where the nodes have precached information from a library of available files. Nodes request files at random. If the requested file is not in the on-board cache, then it is downloaded from some neighboring node via one-hop local communication. An outage event occurs when a requested file is not found in the neighborhood of the requesting node, or if the network admission control policy decides not to serve the request. We characterize the optimal throughput-outage tradeoff in terms of tight scaling laws for various regimes of the system parameters, when both the number of nodes and the number of files in the library grow to infinity. Our analysis is based on Gupta and Kumar protocol model for the underlying D2D wireless network, widely used in the literature on capacity scaling laws of wireless networks without caching. Our results show that the combination of D2D spectrum reuse and caching at the user nodes yields a per-user throughput independent of the number of users, for any fixed outage probability in (0, 1). This implies that the D2D caching network is scalable: even though the number of users increases, each user achieves constant throughput. This behavior is very different from the classical Gupta and Kumar result on ad hoc wireless networks, for which the per-user throughput vanishes as the number of users increases. Furthermore, we show that the user throughput is directly proportional to the fraction of cached information over the whole file library size. Therefore, we can conclude that D2D caching networks can turn memory into bandwidth (i.e., doubling the on-board cache memory on the user devices yields a 100% increase of the user throughout).
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
Fundamental Limits of Caching in Wireless D2D Networks
Ji, M., Caire, G., & Molisch, A. F. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2504556 · Cited by 596
Self-citationLi, L., Zhao, G., & Blum, R. S. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2820021 · Cited by 282
The Role of Caching in Future Communication Systems and Networks
Paschos, G. S., Iosifidis, G., Tao, M., Towsley, D., & Caire, G. (2018) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2018.2844939 · Cited by 259
Self-citation
Metadata
- Authors
- Ji, M., Caire, G., & Molisch, A. F.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2015-12
- Volume
- 61
- Issue
- 12
- Pages
- 6833-6859
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2964101002
- Cited by
- 168
- References
- 1
- FWCI
- 34.15
- 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: The Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks. https://app.cochat.ai/papers/10.1109/tit.2015.2490226
- The paper
- Ji, M., Caire, G., & Molisch, A. F. (2015). The Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2015.2490226
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.