MSRA: Mode Selection and Resource Allocation for Cooperative Vehicle-Infrastructure System

被引:0
作者
Tian, Jin [1 ]
Shi, Yan [1 ]
Xu, Yaqi [1 ]
Chen, Shanzhi [2 ,3 ]
Ge, Yuming [4 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[2] China Acad Telecommun Technol, Natl Engn Res Ctr Mobile Commun & Vehicular Networ, Beijing 100191, Peoples R China
[3] China Acad Telecommun Technol, State Key Lab Wireless Mobile Commun, Beijing 100191, Peoples R China
[4] Minist Ind & Informat Technol, Key Lab Internet Vehicle Tech Innovat & Testing CA, Beijing 100191, Peoples R China
基金
中国国家自然科学基金; 北京市自然科学基金;
关键词
Resource management; Quality of service; Reliability; Vehicle dynamics; Reliability engineering; Reinforcement learning; Optimization; Low latency communication; Buildings; Vehicular ad hoc networks; Cellular vehicle to everything (C-V2X); cooperative vehicle-infrastructure systems (CVISs); mode selection; multiagent reinforcement learning (MARL); resource allocation; CHALLENGES; TECHNOLOGIES; INTERNET;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cellular vehicle-to-everything (C-V2X) communication is essential for supporting diverse vehicle applications in cooperative vehicle-infrastructure systems (CVISs). However, various factors, such as building obstructions, signal blockages, and network conditions, severely affect the latency and reliability of V2V communication. To address this challenge, we propose a novel dynamic method for communication mode selection and resource allocation in C-V2X, termed MSRA, which enables vehicles to dynamically select and utilize different communication modes, such as V2V, Vehicle-to-Infrastructure (V2I), and Vehicle-to-Network (V2N) for direct, relay, or forwarding communication, based on real-time conditions. To this end, we formulate the joint optimization problem of mode selection and resource allocation as a Markov decision process (MDP) and propose a solution based on multiagent reinforcement learning (MARL) with centralized training and decentralized execution. Specifically, each vehicle acts as an agent, independently selecting communication modes and resources based on real-time network status and communication link quality, aiming to satisfy the latency and reliability requirements of V2V communication while maximizing the capacity of V2N communication based on heterogeneous Quality-of-Service (QoS) requirements. Simulation results indicate that the proposed algorithm significantly outperforms other decentralized baselines and demonstrates superior performance under various conditions.
引用
收藏
页码:9927 / 9939
页数:13
相关论文
共 43 条
[1]  
Abanto-Leon LF, 2018, VEH TECHNOL CONFE
[2]   A Novel Low-Latency V2V Resource Allocation Scheme Based on Cellular V2X Communications [J].
Abbas, Fakhar ;
Fan, Pingzhi ;
Khan, Zahid .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2019, 20 (06) :2185-2197
[3]   Resource Management for Collaborative 5G-NR-V2X RSUs to Enhance V2I/N Link Reliability [J].
An, SangHoon ;
Chang, KyungHi .
SENSORS, 2023, 23 (08)
[4]  
[Anonymous], 2018, Rep. TR 37.885
[5]  
[Anonymous], 2016, 36885 3GPP TR
[6]  
[Anonymous], 2007, IST-4-027756 WINNER II
[7]   Survey of Deep Reinforcement Learning for Motion Planning of Autonomous Vehicles [J].
Aradi, Szilard .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2022, 23 (02) :740-759
[8]   Ultrareliable and Low-Latency Wireless Communication: Tail, Risk, and Scale [J].
Bennis, Mehdi ;
Debbah, Merouane ;
Poor, H. Vincent .
PROCEEDINGS OF THE IEEE, 2018, 106 (10) :1834-1853
[9]   A Survey on Machine Learning-Based Misbehavior Detection Systems for 5G and Beyond Vehicular Networks [J].
Boualouache, Abdelwahab ;
Engel, Thomas .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2023, 25 (02) :1128-1172
[10]   BEV-V2X: Cooperative Birds-Eye-View Fusion and Grid Occupancy Prediction via V2X-Based Data Sharing [J].
Chang, Cheng ;
Zhang, Jiawei ;
Zhang, Kunpeng ;
Zhong, Wenqin ;
Peng, Xinyu ;
Li, Shen ;
Li, Li .
IEEE TRANSACTIONS ON INTELLIGENT VEHICLES, 2023, 8 (11) :4498-4514