Research on Optimization of Intelligent Vehicle Channel Allocation Based on Game Theory in Intersection Scene

In recent years, intelligent transportation systems (ITS) and vehicle to vehicle (V2X) communication have experienced rapid development. For example, Cisco released that the global mobile network traffic showed a growth by 74% in 2016 compared with that of the previous year. The sharp increase in the number of users has intensified the demand for efficient spectrum resource allocation in high-density urban traffic scenarios, which is evident at urban intersections. Recent studies, such as, highlights the challenges currently faced by intelligent driving systems. Traditional static channel allocation methods may not be able to meet the dynamic vehicle distribution and real-time communication requirements at this time, resulting in suboptimal resource allocation, increased latency, and potential security risks. To further mitigate the aforementioned risks, this study proposes a dynamic channel allocation algorithm based on cooperative game theory and simulates it in urban intersection scenarios. This algorithm reduces latency by dynamically allocating resource blocks (RBs), optimizing system throughput while implementing fairness constraints and interference control. This study utilized a joint simulation of Prescan and MATLAB, and the framework was rigorously tested under different vehicle densities (5-25 vehicles). The results show that compared with traditional static methods, the dynamic channel allocation algorithm based on cooperative game theory exhibits significantly reduced latency, and the fairness index remains above 0.8. The algorithm greatly alleviates the "Matthew effect" in resource allocation by integrating real-time vehicle behavior adjustment and resource monopoly punishment mechanisms, ensuring fair access for edge vehicles. This work not only provides a theoretical basis for dynamic spectrum management in vehicle networks, but also offers actionable insights for deploying intelligent transportation systems in urban environments. Efficient communication is crucial for collision avoidance, traffic coordination, and autonomous driving in urban environments. The future directions of this research include applying reinforcement learning to achieve adaptive optimization, and extending the framework to multi base station scenarios to support large-scale smart city applications.

Authors

Institutions

Publication Details

Journal
Applied and Computational Engineering
Published
2025-07-24
DOI
https://doi.org/10.54254/2755-2721/2025.po25373
Primary Topic
Simulation and Modeling Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Optimization of Intelligent Vehicle Channel Allocation Based on Game Theory in Intersection Scene

Liang Jin, Bohao Huang, Zheng Zhang, Qifeng Lin
Applied and Computational Engineering
Simulation and Modeling Applications
article

Research on Optimization of Intelligent Vehicle Channel Allocation Based on Game Theory in Intersection Scene

Liang Jin, Bohao Huang, Zheng Zhang, Qifeng Lin
article en

Abstract

In recent years, intelligent transportation systems (ITS) and vehicle to vehicle (V2X) communication have experienced rapid development. For example, Cisco released that the global mobile network traffic showed a growth by 74% in 2016 compared with that of the previous year. The sharp increase in the number of users has intensified the demand for efficient spectrum resource allocation in high-density urban traffic scenarios, which is evident at urban intersections. Recent studies, such as, highlights the challenges currently faced by intelligent driving systems. Traditional static channel allocation methods may not be able to meet the dynamic vehicle distribution and real-time communication requirements at this time, resulting in suboptimal resource allocation, increased latency, and potential security risks. To further mitigate the aforementioned risks, this study proposes a dynamic channel allocation algorithm based on cooperative game theory and simulates it in urban intersection scenarios. This algorithm reduces latency by dynamically allocating resource blocks (RBs), optimizing system throughput while implementing fairness constraints and interference control. This study utilized a joint simulation of Prescan and MATLAB, and the framework was rigorously tested under different vehicle densities (5-25 vehicles). The results show that compared with traditional static methods, the dynamic channel allocation algorithm based on cooperative game theory exhibits significantly reduced latency, and the fairness index remains above 0.8. The algorithm greatly alleviates the "Matthew effect" in resource allocation by integrating real-time vehicle behavior adjustment and resource monopoly punishment mechanisms, ensuring fair access for edge vehicles. This work not only provides a theoretical basis for dynamic spectrum management in vehicle networks, but also offers actionable insights for deploying intelligent transportation systems in urban environments. Efficient communication is crucial for collision avoidance, traffic coordination, and autonomous driving in urban environments. The future directions of this research include applying reinforcement learning to achieve adaptive optimization, and extending the framework to multi base station scenarios to support large-scale smart city applications.

Applied and Computational EngineeringVol. 178(1)
Guangdong University of Technology (CN), Wuhan University of Technology (CN), Wuhan University (CN), Wuhan College (CN)
Openalex Percentile: Top 79%
Simulation and Modeling Applications
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.