Efficient Cache Retrieving Scheme in VANET via Online Reinforcement Learning

The implementation of intelligent driving technology is inseparable from reliable wireless communication and efficient cache scheduling in Vehicle Ad-hoc Networks (VANETs). The purpose of cache scheduling in VANETs is to provide efficient and fast data services to vehicles. In response to difficult to handle wireless communication interference and high requirements for communication delay and energy consumption optimization in vehicle-road cooperation, we propose a new communication model of “Retrieving-Cast” to simplify the cache scheduling process oriented by data requirements. In V2I mode, consider the uplink of all roadside units(RSUs) retrieving data from vehicles, and prioritize data retrieving based on factors such as the number, density, and urgency of vehicles within the communication coverage range of RSUs. We hope that as many high-priority RSUs as possible to complete cached data retrieving as soon as possible under wireless communication interference. To overcome the limitations of traditional heuristic algorithms with low scheduling efficiency and deep learning methods requiring a large amount of training data, we propose a double-<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\varepsilon$</tex-math></inline-formula> online reinforcement learning method, which efficiently solves the cache retrieval scheduling problem. Through experiments and analysis, our method achieved better scheduling results compared to traditional approximation algorithms and single <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\varepsilon$</tex-math></inline-formula>-greedy Deep Q-learning methods. The designed data transformation method also addresses the issue of requiring a large amount of training data, enabling rapid computation of scheduling requests in the network at an extremely low training cost, meeting the low-latency computation requirements in VANETs.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Vehicular Technology
Published
2025-02-13
DOI
https://doi.org/10.1109/tvt.2025.3532836
Citations
3
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
4.46

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Cache Retrieving Scheme in VANET via Online Reinforcement Learning

Lei Yang, Bin Chen, Zhenhao Tan, Ruidong Li et al.
3 citations
IEEE Transactions on Vehicular Technology
Caching and Content Delivery
4.46
article

Efficient Cache Retrieving Scheme in VANET via Online Reinforcement Learning

Lei Yang, Bin Chen, Zhenhao Tan, Ruidong Li, Xiaohua Xu
article en
3 citations

Abstract

The implementation of intelligent driving technology is inseparable from reliable wireless communication and efficient cache scheduling in Vehicle Ad-hoc Networks (VANETs). The purpose of cache scheduling in VANETs is to provide efficient and fast data services to vehicles. In response to difficult to handle wireless communication interference and high requirements for communication delay and energy consumption optimization in vehicle-road cooperation, we propose a new communication model of “Retrieving-Cast” to simplify the cache scheduling process oriented by data requirements. In V2I mode, consider the uplink of all roadside units(RSUs) retrieving data from vehicles, and prioritize data retrieving based on factors such as the number, density, and urgency of vehicles within the communication coverage range of RSUs. We hope that as many high-priority RSUs as possible to complete cached data retrieving as soon as possible under wireless communication interference. To overcome the limitations of traditional heuristic algorithms with low scheduling efficiency and deep learning methods requiring a large amount of training data, we propose a double-<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\varepsilon$</tex-math></inline-formula> online reinforcement learning method, which efficiently solves the cache retrieval scheduling problem. Through experiments and analysis, our method achieved better scheduling results compared to traditional approximation algorithms and single <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\varepsilon$</tex-math></inline-formula>-greedy Deep Q-learning methods. The designed data transformation method also addresses the issue of requiring a large amount of training data, enabling rapid computation of scheduling requests in the network at an extremely low training cost, meeting the low-latency computation requirements in VANETs.

IEEE Transactions on Vehicular TechnologyVol. 74(6)
Kanazawa University (JP), University of Science and Technology of China (CN), South China University of Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 6%
Caching and Content Delivery
4.46
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.