Energy-Efficient NOMA Multicasting System for Beyond 5G Cellular V2X Communications With Imperfect CSI

The integration of non-orthogonal multiple access (NOMA) in vehicle-to-everything (V2X) communications has recently shown great potential to improve traffic efficiency, control, and reliability of beyond 5G transportation systems. In V2X communications, it is vital to inspect imperfect channel state information (CSI) because the high mobility of vehicles leads to more channel estimation uncertainties. This paper proposes an energy-efficient power allocation scheme for the road-side unit (RSU) assisted NOMA multicasting in beyond 5G cellular V2X networks. In particular, the energy efficiency maximization problem is investigated under the outage probability of vehicles under imperfect CSI, quality of services (QoS), and power limit constraints. Since the problem is non-convex and difficult to solve directly, we first convert outage probability constraint to non-probabilistic constraint through approximation and adopt a low complexity gradient assisted binary search (GABS) method to obtain the efficient power allocation at RSUs. Then, a successive convex approximation (SCA) technique is exploited to transform the power allocation problem of vehicles associated with each RSU into a tractable concave-convex fractional programming (CCFP) problem. The optimal solution to the CCFP problem is achieved through Dinkelbach and the dual decomposition method. The global optimal power allocation through the GABS-Exhaustive scheme act as a benchmark, which has considerable computational complexity. Simulation results unveil that the proposed suboptimal scheme (GABS-Dinkelbach) can achieve near-optimal performance with very low complexity.

Automated summary

In this paper, an energy-efficient power allocation scheme for NOMA multicasting in V2X networks beyond 5G is proposed, utilizing successive convex approximation and a low complexity gradient assisted binary search method to optimize power allocation. The optimal solution to the problem is achieved through Dinkelbach and the dual decomposition method. Simulation results show that the proposed suboptimal scheme can achieve near-optimal performance with very low complexity.