Hierarchical Routing for Vehicular Ad Hoc Networks via Reinforcement Learning
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Vehicular ad hoc network is a collection of vehicles and associated road-side infrastructure, which is able to provide mobile wireless communication services. This highly dynamic topology structure is still open to many routing and message forwarding challenges. This paper addresses the issue of message delivery from vehicle to a fixed destination, by hopping over neighboring vehicles. We propose a reinforcement-learning-based hierarchical protocol called QGrid to improve the message deliver ratio with minimum possible delay and hops. The protocol works at two levels. First, it divides the geographical area into smaller grids and finds the next optimal grid toward the destination. Second, it discovers a vehicle inside or moving toward the next optimal grid for message relaying. There is no need of routing tables as the protocol builds a Q-value table based on the traffic flow in neighbor grids, which is then used for the grid selection. The vehicle selection process can employ different strategies, like, greedy selection of nearest neighbor, or solution based on the two-order Markov chain prediction of neighbor movement. This combination makes QGrid an offline and online solution. QGrid is further improved giving higher priority to vehicles with fixed routes and better communication capabilities, like buses, when making the vehicle selection. We have carried out extensive simulation evaluation by using real-world vehicular traces to measure the performance of our proposed schemes. The simulation comparisons among QGrid with/without bus aid, and existing position-based routing protocols, show the great improvement in the delivery percentage by our proposed routing protocol.
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
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
Cited by
Blockchain and Machine Learning for Communications and Networking Systems
Liu, Y., Yu, F. R., Li, X., Ji, H., & Leung, V. C. M. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2975911 · Cited by 313
Self-citationDeep Reinforcement Learning for Internet of Things: A Comprehensive Survey
Chen, W., Qiu, X., Cai, T., Dai, H.-N., Zheng, Z., & Zhang, Y. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3073036 · Cited by 311
Alalwany, E., & Mahgoub, I. (2024) · Sensors · doi:10.3390/s24020368 · Cited by 130
Novel Online Sequential Learning-Based Adaptive Routing for Edge Software-Defined Vehicular Networks
Zhao, L., Zhao, W., Hawbani, A., Al-Dubai, A. Y., Min, G., Zomaya, A. Y., & Gong, C. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3046275 · Cited by 95
“A reinforcement learning-based hierarchical protocol is proposed in [21] which uses Q-learning to select grid-shaped regions or relay nodes hierarchically.”
Method
Metadata
- Authors
- Li, F., Song, X., Chen, H., Li, X., & Wang, Y.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2019-02
- Volume
- 68
- Issue
- 2
- Pages
- 1852-1865
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2972619860
- Cited by
- 98
- References
- 1
- FWCI
- 3.01
- 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
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.