关键词: 连通性, 干扰车载网络, 资源分配, 图论

Abstract: The vehicular networks become denser with the expanding of various services. Therefore, the interference poses a big challenge for the connectivity of network. In the existing works, the connectivity is determined by the signal strength and the distance between the pair of vehicular, where the interference induced by resource allocation has not been considered. Unlike the existing works, in this study, firstly, to represent the influence of the resource and interference on the connectivity, it uses the graph theory to model the connectivity of network, and it gives the definitions of connectivity indices related with resource allocation and interference. Secondly, it analyzes the minimum number of resources that can guarantee the network connectivity by coloring theory. At last, it proposes a resource allocation algorithm based on the minimum spanning tree, which can improve the connectivity in the limited resources. The simulations show that the proposed algorithm can improve the connectivity compared with the comparative algorithm.

Key words: connectivity, interference vehicular networks, resource allocation, graph theory