The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Deep Learning Based Caching for Self-Driving Cars in Multi-Access Edge Computing
Abstract
Without steering wheel and driver's seat, the self-driving cars will have new interior outlook and spaces that can be used for enhanced infotainment services. For traveling people, self-driving cars will be new places for engaging in infotainment services. Therefore, self-driving cars should determine themselves the infotainment contents that are likely to entertain their passengers. However, the choice of infotainment contents depends on passengers' features such as age, emotion, and gender. Also, retrieving infotainment contents at data center can hinder infotainment services due to high end-to-end delay. To address these challenges, we propose infotainment caching in self-driving cars, where caching decisions are based on passengers' features obtained using deep learning. First, we proposed deep learning models to predict the contents need to be cached in self-driving cars and close proximity of self-driving cars in multi-access edge computing servers attached to roadside units. Second, we proposed a communication model for retrieving infotainment contents to cache. Third, we proposed a caching model for retrieved contents. Fourth, we proposed a computation model for the cached contents, where cached contents can be served in different formats/qualities based on demands. Finally, we proposed an optimization problem whose goal is to link the proposed models into one optimization problem that minimizes the content downloading delay. To solve the formulated problem, a block successive majorization-minimization technique is applied. The simulation results show that the accuracy of prediction for the contents that need to be cached is 97.82% and our approach can minimize the delay.
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
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Sun, Y., Babu, P., & Palomar, D. P. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601299 · Cited by 1,820
Learn to Cache: Machine Learning for Network Edge Caching in the Big Data Era
Chang, Z., Lei, L., Zhou, Z., Mao, S., & Ristaniemi, T. (2018) · IEEE Wireless Communications · doi:10.1109/mwc.2018.1700317 · Cited by 212
Cited by
Convergence of Edge Computing and Deep Learning: A Comprehensive Survey
Wang, X., Han, Y., Leung, V. C. M., Niyato, D., Yan, X., & Chen, X. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2970550 · Cited by 1,498
Federated Learning for Internet of Things: Recent Advances, Taxonomy, and Open Challenges
Khan, L. U., Saad, W., Han, Z., Hossain, E., & Hong, C. S. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3090430 · Cited by 892
Self-citationMobile 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
Federated Learning in Edge Computing: A Systematic Survey
Abreha, H. G., Hayajneh, M., & Serhani, M. A. (2022) · Sensors · doi:10.3390/s22020450 · Cited by 342
Mobility-Aware Proactive Edge Caching for Connected Vehicles Using Federated Learning
Yu, Z., Hu, J., Min, G., Zhao, Z., Miao, W., & Hossain, M. S. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.3017474 · Cited by 332
Metadata
- Authors
- Ndikumana, A., Tran, N. H., Kim, D. H., Kim, K. T., & Hong, C. S.
- Venue
- IEEE Transactions on Intelligent Transportation Systems
- Published
- 2021-05
- Volume
- 22
- Issue
- 5
- Pages
- 2862-2877
- ISSN
- 1524-9050 (ISSN-L)
- 1558-0016
- OpenAlex
- W3009247246
- Cited by
- 171
- References
- 2
- FWCI
- 13.32
- Type
- journal article
- Language
- en
- Open access
- closed
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: Deep Learning Based Caching for Self-Driving Cars in Multi-Access Edge Computing. https://app.cochat.ai/papers/10.1109/tits.2020.2976572
- The paper
- Ndikumana, A., Tran, N. H., Kim, D. H., Kim, K. T., & Hong, C. S. (2021). Deep Learning Based Caching for Self-Driving Cars in Multi-Access Edge Computing. IEEE Transactions on Intelligent Transportation Systems. https://doi.org/10.1109/tits.2020.2976572
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.