Backoff-Based Coded Random Access for Intelligent Connected Vehicles

Abstract

The rapid growth in the scale of the intelligent connected vehicles (ICVs) brings about the need for novel random access schemes that realize collision avoidance and reliable communication. The coded random access (CRA) scheme utilizes successive interference cancellation (SIC) across slots to enable the extraction of multiple users' packets from the collision slots and proves to be an efficient solution to collision resolution. In this paper, we propose a random backoff-based CRA scheme to achieve a tradeoff between the access success probability and access delay for CRA. Specifically, we partition the traditional CRA frame into subframes, so that the user access delay is reduced to the same scale of the subframe length. In addition, the backoff operation among subframes is introduced so that access failures originated from the subframe length limit can be reduced with the retransmission in subsequent subframes. In particular, we consider practical Nakagami-m fading channel in the CRA performance analysis and take into account the capture effect in the iterative interference cancellation process. Simulation results show that backoff-based CRA can significantly reduce the average access delay without severe negative effect on the access success probability for moderate system load compared with traditional CRA. Comparisons with the state-of-the-art non-orthogonal random access (NORA) scheme proposed for 5G indicates that backoff-based CRA provides a feasible solution for random access of large-scale ICVs.