In this paper, we consider a dense vehicular communication network where each vehicle broadcasts its safety information to its neighborhood in each transmission period. Such applications require low latency and high reliability, and thus, we exploit non-orthogonal multiple access to reduce the access latency and to improve the packet reception probability. In the proposed two-fold scheme, the BS performs semi-persistent scheduling and allocates time-frequency resources in a nonorthogonal manner while the vehicles autonomously perform distributed power control with iterative signaling control. We formulate the centralized scheduling and resource allocation problem as equivalent to a multi-dimensional stable roommate matching problem, in which the users and time/frequency resources are considered as disjoint sets of objects to be matched with each other. We then develop a novel rotation matching algorithm, which converges to an L-rotation stable matching after a limited number of iterations. Simulation results show that the proposed scheme outperforms the traditional orthogonal multiple access scheme in terms of the access latency and reliability. Index Terms-Non-orthogonal multiple access, V2X broadcasting, resource allocation, scheduling problem, matching theory.
In the context of vehicle-to-everything (V2X) communications, NOMA has been explored in REF where the Base Station (BS) performs semi-persistent scheduling and allocates time-frequency resources in a non-orthogonal manner, while the vehicles autonomously perform distributed power control when broadcasting their safety information to the neighborhood.
Non-Orthogonal Multiple Access for High-Reliable and Low-Latency V2X Communications in 5G Systems
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Computer Science