Conflict-Free Scheduling in Cellular V2X Communications

摘要

Cellular V2X, the "Vehicle to Everything" standard, defines a framework for information exchange among vehicles and other network entities. In one of the main modes, LTE V2X relies on a central scheduler to minimize the consumed resources in a conflict-free manner. This NP-hard problem leads to a scheduling strategy that assigns separate resources to the conflicting links and can enjoy from opportunistic resource reuse. In this paper, a novel polynomial-time heuristic, MUCS, is introduced, which models this scheduling as a Vehicle Routing Problem. The existing conflict-free schedulers face major incompetence in satisfying the LTE and 5G V2X requirements mainly due to their reliance on simplifications that are unnatural to the V2X environment. On the contrary, MUCS can flexibly accommodate general Device-to-Device topologies as the basis of V2X networks without imposing any packet segmentation. This way, MUCS minimizes the control information overhead in the cellular V2X standard. Due to scalability and a high quality resource utilization (near-optimal in certain conditions), compared to the existing literature, MUCS is desirable for LTE V2X and the 5G networks.