Geo-Based Scheduling for C-V2X Networks

Abstract

Cellular vehicle-to-everything (C-V2X) networks can operate without cellular infrastructure support. Vehicles can autonomously select their radio resources using the sensing-based semi-persistent scheduling (SPS) algorithm specified by the Third Generation Partnership Project. The sensing nature of the SPS scheme makes C-V2X communications prone to the well-known hidden-terminal problem. To address this problem, this paper proposes a novel geo-based scheduling scheme that allows vehicles to autonomously select their radio resources based on the location and ordering of neighboring vehicles on the road. The proposed scheme results in an implicit resource selection coordination between vehicles (even with those outside the sensing range) that reduces packet collisions. This paper evaluates analytically and through simulations the proposed scheduling scheme. The obtained results demonstrate that it reduces packet collisions and significantly increases the C-V2X performance, compared to when using the sensing-based SPS scheme