Please use this identifier to cite or link to this item:
https://bura.brunel.ac.uk/handle/2438/34116| Title: | Communication-Aware Distributed Control for Cooperative Ramp Merging in Vehicular Networks |
| Authors: | Shen, Qianju Wu, Qiong Fan, Pingyi Wang, Kezhi Chen, Wen Zhang, Cui Mao, Guoqiang Letaief, Khaled B |
| Keywords: | ramp merging;distributed control;NR V2X;resource re-evaluation;communication-aware control |
| Issue Date: | 6-Oct-2026 |
| Publisher: | Institute of Electrical and Electronics Engineers (IEEE) |
| Citation: | Shen, Q. et al. (2026) 'Communication-Aware Distributed Control for Cooperative Ramp Merging in Vehicular Networks', IEEE Transactions on Mobile Computing, 0(early access), pp. 1–18. doi: 10.1109/tmc.2026.3739758. |
| Abstract: | Cooperative ramp merging requires reliable coordination among connected vehicles, but practical NR V2X Mode 2 communications may suffer from delay, packet loss, and resource collision due to distributed sidelink resource selection. Existing distributed control methods often assume ideal communication or treat communication impairments as external disturbances, without explicitly linking communication states to vehicle safety constraints. Accordingly, this paper proposes a communication aware distributed model predictive control (CA-DMPC) frame work for cooperative ramp merging. A Markov-chain-based model is developed to characterize NR V2X Mode 2 resource reservation and re-evaluation, including collision persistence, resource reselection, and re-evaluation failure. Predicted communication states are converted into spatial prediction uncertainty and incorporated into MPC safety constraints through an adaptive safety margin. To improve real-time performance, the communication-control optimization problem is decomposed into tractable subproblems, and the vehicle-control component is reformulated as a quadratic programming problem. Simulation results show that the proposed framework achieves smoother control, more stable inter-vehicle spacing, better trajectory tracking, and lower computational cost than benchmark methods. |
| URI: | https://bura.brunel.ac.uk/handle/2438/34116 |
| DOI: | https://doi.org/10.1109/tmc.2026.3739758 |
| ISSN: | 1536-1233 |
| Appears in Collections: | Department of Computer Science Research Papers |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| FullText.pdf | Copyright ‘For the purpose of open access, the author has applied a ‘Creative Commons Attribution (CC BY) licence to any Author Accepted Manuscript version arising.’ | 2.35 MB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License