Graph-based Time-critical Message Dissemination Maximization Scheme for 5G NR-V2X Networks

Existing broadcast techniques are challenging to meet the low-latency high-reliability requirements of advanced V2X applications. As an enhancement to broadcast, unicast mode has been introduced in 5G NR-V2X. The strategy of unicast V2V message dissemination is investigated, and the problem of maximizing k-vertex reachable nodes within h-hop is proposed. A maximum matching-based algorithm named HKVR is presented to solve the problem. Experimental results indicate that HKVR has better performance than traditional centrality-based strategies. With a few source nodes, HKVR can achieve 100% coverage for small networks; average hops can be reduced by 33% for large-scale networks with thousands of nodes.