Hierarchical Affinity Propagation for Reliable Integrated Multilayer V2X Networks

The integration of IEEE802.11p and 5G New Radio for the backbone transmission of vehicle-to-everything (V2X) technology has served as a novel type of intelligent transportation system with an efficient low-cost and high-coverage area. This integrated scheme implements a V2X end-to-end data delivery system in a multilayer mechanism. However, the dynamic nature of vehicular networks leads to numerous network outages and frequent network renewal requests, which considerably diminishes the overall performance. Hence, efficient routing management is required to maximize reliable communication. Optimizing routing management is categorized as a nonlinear problem with a very high computational load, making a practical solution very challenging. To cope with the complicated routing problem, we develop a low-complexity distributed algorithm based on a hierarchical affinity propagation framework. The proposed algorithm exchanges small-sized messages among local vehicles to determine data routing more efficiently. The distributive optimization of the proposed algorithm requires a small computational load for each node. The main advantage of the proposed algorithm is that each vehicle autonomously determines its best routing options without the help of any network coordinators. Extensive simulation results verify that the proposed algorithm outperforms conventional algorithms in terms of vehicle mobility, network scalability, the level of network overhead, and the algorithm convergence rate.

Automated summary

The integration of IEEE802.11p and 5G New Radio has enabled the development of an efficient and cost-effective vehicle-to-everything (V2X) technology for intelligent transportation systems. However, the dynamic nature of vehicular networks leads to frequent network outages and renewal requests, thereby diminishing overall performance. To address this problem, a low-complexity distributed algorithm based on hierarchical affinity propagation is proposed to determine data routing more efficiently among local vehicles.