Variable Neighborhood Search-based Resource Allocation for Vehicle-to-Everything Communications

Third Generation Partnership Project (3GPP) introduced Vehicle-to-Everything (V2X) in Long Term Evolution (LTE) Release 14 and Release 15. The present work aimed to investigate the resource allocation problem for V2X communications. To this end, we proposed applying the Variable Neighborhood Search (VNS) algorithm to solve the resource allocation problem. The proposed method aims to maximize the total throughput in the system while maintaining a minimum latency and reliability for both Cellular User Equipment (CUEs) and Vehicle User Equipment (VUEs). To verify the effectiveness of the proposed method, the VNS-based resource allocation scheme was compared to two other schemes; the first is based on the Particle Swarm Optimization (PSO) algorithm, and the second on the Ant Colony Optimization (ACO) Algorithm. The simulation was carried out using MATLAB software. The obtained results prove the performance of the proposed scheme in terms of resource allocation for V2X communications. The performance gains of the proposed approach demonstrate its feasibility and utility for V2X communications.