Open Access iconOpen Access

ARTICLE

crossmark

Resource Allocation in V2X Networks: A Double Deep Q-Network Approach with Graph Neural Networks

Zhengda Huan1, Jian Sun2,*, Zeyu Chen1, Ziyi Zhang1, Xiao Sun1, Zenghui Xiao1

1 School of Computer Science and Technology, Shandong University of Technology, Zibo, 255000, China
2 School of Electrical and Electronics Engineering, Shandong University of Technology, Zibo, 255000, China

* Corresponding Author: Jian Sun. Email: email

Computers, Materials & Continua 2025, 84(3), 5427-5443. https://doi.org/10.32604/cmc.2025.065860

Abstract

With the advancement of Vehicle-to-Everything (V2X) technology, efficient resource allocation in dynamic vehicular networks has become a critical challenge for achieving optimal performance. Existing methods suffer from high computational complexity and decision latency under high-density traffic and heterogeneous network conditions. To address these challenges, this study presents an innovative framework that combines Graph Neural Networks (GNNs) with a Double Deep Q-Network (DDQN), utilizing dynamic graph structures and reinforcement learning. An adaptive neighbor sampling mechanism is introduced to dynamically select the most relevant neighbors based on interference levels and network topology, thereby improving decision accuracy and efficiency. Meanwhile, the framework models communication links as nodes and interference relationships as edges, effectively capturing the direct impact of interference on resource allocation while reducing computational complexity and preserving critical interaction information. Employing an aggregation mechanism based on the Graph Attention Network (GAT), it dynamically adjusts the neighbor sampling scope and performs attention-weighted aggregation based on node importance, ensuring more efficient and adaptive resource management. This design ensures reliable Vehicle-to-Vehicle (V2V) communication while maintaining high Vehicle-to-Infrastructure (V2I) throughput. The framework retains the global feature learning capabilities of GNNs and supports distributed network deployment, allowing vehicles to extract low-dimensional graph embeddings from local observations for real-time resource decisions. Experimental results demonstrate that the proposed method significantly reduces computational overhead, mitigates latency, and improves resource utilization efficiency in vehicular networks under complex traffic scenarios. This research not only provides a novel solution to resource allocation challenges in V2X networks but also advances the application of DDQN in intelligent transportation systems, offering substantial theoretical significance and practical value.

Keywords

Resource allocation; V2X; double deep Q-network; graph neural network

Cite This Article

APA Style
Huan, Z., Sun, J., Chen, Z., Zhang, Z., Sun, X. et al. (2025). Resource Allocation in V2X Networks: A Double Deep Q-Network Approach with Graph Neural Networks. Computers, Materials & Continua, 84(3), 5427–5443. https://doi.org/10.32604/cmc.2025.065860
Vancouver Style
Huan Z, Sun J, Chen Z, Zhang Z, Sun X, Xiao Z. Resource Allocation in V2X Networks: A Double Deep Q-Network Approach with Graph Neural Networks. Comput Mater Contin. 2025;84(3):5427–5443. https://doi.org/10.32604/cmc.2025.065860
IEEE Style
Z. Huan, J. Sun, Z. Chen, Z. Zhang, X. Sun, and Z. Xiao, “Resource Allocation in V2X Networks: A Double Deep Q-Network Approach with Graph Neural Networks,” Comput. Mater. Contin., vol. 84, no. 3, pp. 5427–5443, 2025. https://doi.org/10.32604/cmc.2025.065860



cc Copyright © 2025 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1164

    View

  • 653

    Download

  • 0

    Like

Share Link