🤖 AI Summary
In ultra-massive, high-mobility vehicular-to-everything (V2X) scenarios envisioned for 6G, achieving real-time, reliable communication among dynamically moving vehicles within integrated space-air-ground networks remains challenging.
Method: We propose a low-complexity, heuristic cooperative relay selection algorithm grounded in rigorous channel capacity upper-bound analysis, which eliminates fixed relay-count constraints and enables efficient, adaptive resource scheduling. Our approach innovatively unifies cooperative vehicular communications with the integrated space-air-ground architecture.
Contribution/Results: Through formal theoretical derivation and system-level simulations, we demonstrate that the proposed scheme significantly improves both achievable channel capacity and link stability over state-of-the-art methods. It robustly supports millisecond-level real-time information exchange under ultra-dense, highly dynamic V2X conditions, thereby providing a scalable, foundational communication enabler for 6G intelligent transportation systems.
📝 Abstract
This paper introduces a novel cooperative vehicular communication algorithm tailored for future 6G ultra-massive vehicle-to-everything (V2X) networks leveraging integrated space-air-ground communication systems. Specifically, we address the challenge of real-time information exchange among rapidly moving vehicles. We demonstrate the existence of an upper bound on channel capacity given a fixed number of relays, and propose a low-complexity relay selection heuristic algorithm. Simulation results verify that our proposed algorithm achieves superior channel capacities compared to existing cooperative vehicular communication approaches.