arXiv:2607. 20554v1 Announce Type: new Abstract: Reliable and low-latency NR-V2X communications are essential for smart mobility in dense urban environments.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
The paper introduces an AI-driven Learning-to-Optimise framework that uses Graph Neural Networks to select real‑time multi‑hop relays in NR‑V2X networks for smart cities. By modelling the vehicular network as a graph and training a GINE model with MILP‑derived optimal decisions, the method achieves near‑optimal connectivity, improving connectivity by up to 11.3% and speeding up computation by up to 100×. This enables scalable, real‑time network control suitable for Industry 4.0 and smart‑city deployments.
arXiv:2607. 14176v1 Announce Type: new Abstract: Reliable, low-latency uplink connectivity is a key requirement for C-V2X networks in dense urban environments, where fast channel variations and blockages often degrade direct vehicle-to-infrastructure links.
The paper proposes that Learning-to-Optimize (L2O) should serve as a missing architectural layer in AI-native communication networks, bridging optimisation and AI intelligence. It redefines optimisation algorithms as offline knowledge generators that produce supervisory data for neural surrogate models, enabling low‑latency inference in dynamic environments. A four‑stage workflow—optimisation, knowledge generation, surrogate learning, and runtime inference—is introduced, and demonstrated on an NR‑V2X relay‑selection problem where a Graph Neural Network learns near‑optimal decisions from MILP solutions.
arXiv:2603. 06607v2 Announce Type: replace-cross Abstract: Radio resource allocation (RRA) is a critical function in cellular vehicle-to-everything (C-V2X) networks, where vehicles must share limited wireless resources to support safety-critical communications.
arXiv:2607. 19270v1 Announce Type: cross Abstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.
The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning. While Graph Neural Networks have emerged as fast, data-driven surrogates, their practical deployment is severely constrained by a spatial generalization gap.