Abstract
In the autonomous sidelink resource scheduling for Cellular V2X (C-V2X), the standard sensing-based semi-persistent scheduling (SPS) algorithm relies on several mechanisms such as random resource selection, resource utilization pattern monitoring, and probabilistic reselection to minimize packet collisions and to cope with vehicular topology changes. Even so, the collision probability is still not negligible, and its performance is far from the projected requirements for low latency and high reliability applications for future C-V2X communication. In this article, we propose a reservation mechanism that supplements the standard SPS for C-V2X Sidelink Mode 4, which visibly improves the performance in face of congestion and in the fringe of the communication range. In particular, we demonstrate that the reservation achieves the best performance if made much earlier than actual use of the reserved resource at least by an average of one second.
Highlights
The cellular vehicle-to-everything (C-V2X) communication is expected to become one of the essential components of highly automated driving in the future
The possibility of failed coordination in distributed resource selection stemming from various reasons such as vehicle topology change makes the resource reselection feature in semi-persistent scheduling (SPS) indispensable to reduce packet collisions in Cellular V2X (C-V2X) Sidelink Mode 4
It adds to the uncertainty of the resource usage whose pattern is exploited to select the least likely resource to be used by other vehicles
Summary
The cellular vehicle-to-everything (C-V2X) communication is expected to become one of the essential components of highly automated driving in the future. The biggest problem in the current autonomous resource scheduling algorithm for Mode 4, called the sensing-based semi-persistent scheduling (SB-SPS; SPS) [2], is that each vehicle may change the time-frequency resource as frequently as every second to avoid half-duplex collisions with other vehicles In these resource reselection events, they do not explicitly announce their internal choice as to the location of the new resource to be used for the next. Since the uncertainty of the resource locations chosen by neighbor vehicles is a main source of packet collisions in the distributed resource allocation algorithm defined in the standard, the explicit reservation can significantly contribute to resolving the performance issue of SPS.
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call