The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Mobility-Aware Caching in D2D Networks
Open accessAbstract
Caching at mobile devices can facilitate device-to-device (D2D) communications, which may significantly improve spectrum efficiency and alleviate the heavy burden on backhaul links. However, most previous works ignored user mobility, thus having limited practical applications. In this paper, we take advantage of the user mobility pattern by the inter-contact times between different users, and propose a mobility-aware caching placement strategy to maximize thedata offloading ratio, which is defined as the percentage of the requested data that can be delivered via D2D links rather than through base stations. Given the NP-hard caching placement problem, we first propose an optimal dynamic programming algorithm to obtain a performance benchmark with much lower complexity than exhaustive search. We then prove that the problem falls in the category of monotone submodular maximization over a matroid constraint, and propose a time-efficient greedy algorithm, which achieves an approximation ratio as$\frac {1}{2}$. Simulation results with real-life data sets will validate the effectiveness of our proposed mobility-aware caching placement strategy. We observe that users moving at either a very low or very high speed should cache the most popular files, while users moving at a medium speed should cache less popular files to avoid duplication.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 1×
“Meanwhile, the case using the coded delivery scheme [27] was investigated in [19].”
MethodCache in the air: exploiting content caching and delivery techniques for 5G systems
Wang, X., Chen, M., Taleb, T., Ksentini, A., & Leung, V. (2014) · IEEE Communications Magazine · doi:10.1109/mcom.2014.6736753 · Cited by 1,063 · cited 1×
“Such local access can also reduce the download delay and improve the energy efficiency [6], [11].”
BackgroundMaximizing a Monotone Submodular Function Subject to a Matroid Constraint
Calinescu, G., Chekuri, C., Pál, M., & Vondrák, J. (2011) · SIAM Journal on Computing · doi:10.1137/080733991 · Cited by 795 · cited 2×
“A randomized algorithm was proposed in [45], which achieves a higher approximation ratio.”
BackgroundGroup Sparse Beamforming for Green Cloud-RAN
(2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.040214.131770 · Cited by 468
Self-citation
Cited by
A survey of device-to-device communications: research issues and challenges
Jameel, F., Hamid, Z., Jabeen, F., Zeadally, S., & Javed, M. A. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2828120 · Cited by 536
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
Self-citationMobility-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
Metadata
- Authors
- Wang, R., Zhang, J., Song, S. H., & Letaief, K. B.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2017-08
- Volume
- 16
- Issue
- 8
- Pages
- 5001-5015
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W2964316812
- Cited by
- 158
- References
- 4
- FWCI
- 20.00
- 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: Mobility-Aware Caching in D2D Networks. https://app.cochat.ai/papers/10.1109/twc.2017.2705038
- The paper
- Wang, R., Zhang, J., Song, S. H., & Letaief, K. B. (2017). Mobility-Aware Caching in D2D Networks. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2017.2705038
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.