Joint Vehicle Scheduling and Power Allocation for V2X Communications

This paper studies a vehicle-to-everything (V2X) communication network, where the multi-antenna base station (BS) services mobile vehicles in the downlink. In actual networks, delay-sensitive vehicles (D-VEs) and high-throughput vehicles (H-VEs) coexist. In this paper, to ensure acceptable differentiated quality of service requirements, we consider joint power allocation and vehicle scheduling to maximize H-VEs' throughput while meeting the D-VEs' delay requirements. To solve this problem, we propose a iterative algorithm based on the successive convex approximation (SCA) method. Through the SCA method, the primal problem is converted into a convex problem. We can obtain a feasible solution for the primal problem by solving the convex problem. Through multiple iterations, the quality of the feasible solution is continuously improved. The approximate optimal solution of the primal problem is finally obtained. Numerical results show that the proposed algorithm achieves higher throughput compared with the conventional algorithms.