User Association for Load Balancing in Vehicular Networks: An Online Reinforcement Learning Approach
The DOI matches its Crossref record.
Abstract
Recently, a number of technologies have been developed to promote vehicular networks. When vehicles are associated with the heterogeneous base stations (e.g., macrocells, picocells, and femtocells), one of the most important problems is to make load balancing among these base stations. Different from common mobile networks, data traffic in vehicular networks can be observed having regularities in the spatial-temporal dimension due to the periodicity of urban traffic flow. By taking advantage of this feature, we propose an online reinforcement learning approach, called ORLA. It is a distributed user association algorithm for network load balancing in vehicular networks. Based on the historical association experiences, ORLA can obtain a good association solution through learning from the dynamic vehicular environment continually. In the long run, the real-time feedback and the regular traffic association patterns both help ORLA cope with the dynamics of network well. In experiments, we use QiangSheng taxi movement to evaluate the performance of ORLA. Our experiments verify that ORLA has higher quality load balancing compared with other popular association methods.
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
Cited by
Survey on 6G Frontiers: Trends, Applications, Requirements, Technologies and Future Research
Alwis, C. D., Kalla, A., Pham, Q.-V., Kumar, P., Dev, K., Hwang, W.-J., & Liyanage, M. (2021) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2021.3071496 · Cited by 788
Noor-A-Rahim, M., Liu, Z., Lee, H., Khyam, M. O., He, J., Pesch, D., Moessner, K., Saad, W., & Poor, H. V. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3173031 · Cited by 737
Application of Machine Learning in Wireless Networks: Key Techniques and Open Issues
Sun, Y., Peng, M., Zhou, Y., Huang, Y., & Mao, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2924243 · Cited by 678
“This issue can be overcome by reinforcement learning approaches in [16], [87], [97], which evaluate each action based on its past performance.”
BackgroundMethodInfluentialSpectrum Sharing in Vehicular Networks Based on Multi-Agent Reinforcement Learning
Liang, L., Ye, H., & Li, G. Y. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2933962 · Cited by 559
“A distributed user association approach based on RL has been developed in [27] for vehicular networks with heterogeneous BSs.”
MethodZhao, N., Liang, Y.-C., Niyato, D., Pei, Y., Wu, M., & Jiang, Y. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2933417 · Cited by 461
Metadata
- Authors
- Li, Z., Wang, C., & Jiang, C.-J.
- Venue
- IEEE Transactions on Intelligent Transportation Systems
- Published
- 2017-08
- Volume
- 18
- Issue
- 8
- Pages
- 2217-2228
- ISSN
- 1524-9050 (ISSN-L)
- 1558-0016
- OpenAlex
- W2625483604
- Cited by
- 106
- References
- 0
- FWCI
- 4.14
- 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: User Association for Load Balancing in Vehicular Networks: An Online Reinforcement Learning Approach. https://app.cochat.ai/papers/10.1109/tits.2017.2709462
- The paper
- Li, Z., Wang, C., & Jiang, C.-J. (2017). User Association for Load Balancing in Vehicular Networks: An Online Reinforcement Learning Approach. IEEE Transactions on Intelligent Transportation Systems. https://doi.org/10.1109/tits.2017.2709462
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.