Dynamic Resource Allocation for Optimized Latency and Reliability in Vehicular Networks
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Supporting ultra-reliable and low-latency communications (URLLC) is crucial for vehicular traffic safety and other mission-critical applications. In this paper, a novel proximity and quality-of-service-aware resource allocation framework for vehicle-to-vehicle (V2V) communication is proposed. The proposed scheme incorporates the physical proximity and traffic demands of vehicles to minimize the total transmission power over the allocated resource blocks (RBs) under reliability and queuing latency constraints. A Lyapunov framework is used to decompose the power minimization problem into two interrelated sub-problems: RB allocation and power optimization. To minimize the overhead introduced by frequent information exchange between the vehicles and the roadside unit (RSU), the resource allocation problem is solved in a semi-distributed fashion. First, a novel RSU-assisted virtual clustering mechanism is proposed to group vehicles into disjoint zones based on mutual interference. Second, a per-zone matching game is proposed to allocate RBs to each vehicle user equipment (VUE) based on vehicles' traffic demands and their latency and reliability requirements. In the formulated one-to-many matching game, VUE pairs and RBs rank one another using preference relations that capture both the queue dynamics and interference. To solve this game, a semi-decentralized algorithm is proposed using which the VUEs and RBs can reach a stable matching. Finally, a latency-and reliability-aware power allocation solution is proposed for each VUE pair over the assigned subset of RBs. Simulation results for a Manhattan model show that the proposed scheme outperforms the state-of-art baseline and reaches up to 45% reduction in the queuing latency and 94% improvement in reliability.
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
College Admissions and the Stability of Marriage
Gale, D., & Shapley, L. S. (1962) · The American Mathematical Monthly · doi:10.1080/00029890.1962.11989827 · Cited by 5,985
A Proof for the Queuing Formula: L = λ W
Little, J. D. C. (1961) · Operations Research · doi:10.1287/opre.9.3.383 · Cited by 2,777
Research works printed but not linked: 37
- 2016, LTE-based V2X Services Work Item
- 2016, Study on scenarios and Requirements for Next Generation Access Technologies Technical Specification Group Radio Access Network Study on LTE-based V2X Services Release 14
- 10.1109/MCOM.2015.7105641 · DOI · Paper page
- roth, 1992, Two-sided Matching A Study in Game-theoretic Modeling and Analysis
- 10.1007/s11222-007-9033-z · DOI · Paper page
- 10.1109/ISIT.2006.262075 · DOI · Paper page
- 2010, D5 3 WINNER+ Final Channel Models, 1
- 10.2307/2312726 · doi:10.2307/2312726 · Paper page
- 10.1109/ICDSP.2011.6004983 · DOI
- 10.1109/MSP.2016.2598848 · DOI · Paper page
- 10.1109/TITS.2014.2377074 · DOI · Paper page
- 10.1109/PIMRC.2014.7136330 · DOI · Paper page
- 10.1109/TVT.2015.2479248 · DOI · Paper page
- 10.1109/WCNC.2014.6952482 · DOI · Paper page
- 10.1109/PIMRC.2016.7794859 · DOI
- 10.1109/JSAC.2011.110116 · DOI · Paper page
- 10.1109/TCOMM.2017.2699194 · DOI · Paper page
- 10.1109/VTCFall.2014.6966159 · DOI
- 10.1109/GLOCOMW.2016.7848885 · DOI · Paper page
- 10.1109/VTCFall.2015.7390845 · doi:10.1109/vtcfall.2015.7390845
- 10.1145/2942358.2942415 · doi:10.1145/2942358.2942415
- 10.1109/TIT.2006.876219 · doi:10.1109/tit.2006.876219
- condoluci, 2015, LTE for vehicular communications, Vehicular Ad Hoc Networks Standards Solutions and Research, 457
- 10.1109/CISS.2018.8362271 · DOI
- 2016, Study on scenarios and Requirements for Next Generation Access Technologies Technical Specification Group Radio Access Network Release 14
- 10.1109/Allerton.2013.6736645 · DOI
- 10.1109/MCOM.2014.6815890 · DOI · Paper page
- 2016, Nokia 5G highlights 5G Technology Workshop—Potential Technology for 3GPP Rel-15
- 10.1109/JPROC.2018.2867029 · DOI · Paper page
- 10.1109/WCL.2012.022012.120073 · DOI · Paper page
- 10.1109/MCOM.2013.6515060 · DOI · Paper page
- 10.1109/EuCNC.2017.7980743 · DOI
- 10.1109/TWC.2016.2531652 · DOI · Paper page
- 10.1109/MCOM.2017.1601092 · DOI · Paper page
- zeng, 2018, Joint communication and control for wireless autonomous vehicular platoon systems
- 10.1109/TWC.2015.2444385 · DOI
- 10.2200/S00271ED1V01Y201006CNT007 · doi:10.2200/s00271ed1v01y201006cnt007 · Paper page
Cited by
Spectrum 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 proximity and QoSaware resource allocation scheme for V2V communications has been developed in [16] that minimizes the total transmission power of all V2V links while satisfying latency and reliability requirements using a Lyapunov-based stochastic optimization framework.”
MethodDistributed Federated Learning for Ultra-Reliable Low-Latency Vehicular Communications
Samarakoon, S., Bennis, M., Saad, W., & Debbah, M. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2956472 · Cited by 459
Self-citationLi, X., Lu, L., Ni, W., Jamalipour, A., Zhang, D., & Du, H. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3173057 · Cited by 188
Survey on artificial intelligence (AI) techniques for vehicular ad-hoc networks (VANETs)
Mchergui, A., Moulahi, T., & Zeadally, S. (2022) · Vehicular Communications · doi:10.1016/j.vehcom.2021.100403 · Cited by 165
Multi-agent deep reinforcement learning based resource management in heterogeneous V2X networks
Zhao, J., Hu, F., Li, J., & Nie, Y. (2025) · Digital Communications and Networks · doi:10.1016/j.dcan.2023.06.003 · Cited by 21
Metadata
- Authors
- Ashraf, M. I., Liu, C.-F., Bennis, M., Saad, W., & Hong, C. S.
- Venue
- IEEE Access
- Published
- 2018
- Volume
- 6
- Pages
- 63843-63858
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2896161835
- Cited by
- 56
- References
- 2
- FWCI
- 2.82
- Type
- journal article
- Language
- en
- Open access
- gold
- Licence
- Funders
- National Science Foundation (CNS-1513697, CNS-1836802)
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.