Conflict-Free Scheduling in Cellular V2X Communications
- 27 October 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. PP (10636692) , 1-14
Abstract
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.Keywords
This publication has 28 references indexed in Scilit:
- A Survey of TDMA Scheduling Schemes in Wireless Multihop NetworksACM Computing Surveys, 2015
- Link Scheduling for Data Collection in Multichannel Wireless Sensor Networks2015
- Routing, spectrum access, and scheduling in multi-hop multi-channel wireless networks with MIMO linksEURASIP Journal on Wireless Communications and Networking, 2015
- An enhanced Gauss-Markov mobility model for simulations of unmanned aerial ad hoc networks2014
- Five disruptive technology directions for 5GIEEE Communications Magazine, 2014
- Agents Toward Vehicle Routing Problem With Time WindowsJournal of Intelligent Transportation Systems, 2013
- Position-based routing in vehicular networks: A surveyJournal of Network and Computer Applications, 2013
- On the complexity of scheduling in wireless networks2006
- The vehicle routing problem: An overview of exact and approximate algorithmsEuropean Journal of Operational Research, 1992
- Link scheduling in polynomial timeIEEE Transactions on Information Theory, 1988