Geo-Based Scheduling for C-V2X Networks

June 25, 2019 Β· Declared Dead Β· πŸ› IEEE Transactions on Vehicular Technology

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Rafael Molina-Masegosa, Miguel Sepulcre, Javier Gozalvez arXiv ID 1906.10370 Category cs.NI: Networking & Internet Citations 50 Venue IEEE Transactions on Vehicular Technology Last Checked 5 months ago
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 (3GPP). 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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Networking & Internet

Died the same way β€” πŸ‘» Ghosted