Resource Allocation Strategy Based on Tripartite Graph in Vehicular Social Networks

Abstract

Owing to the limited spectrum of vehicular social networks and the fragmented distribution of caching resources, problems such as low vehicle data transmission rate, poor service quality, and low service content delivery efficiency of streaming media are encountered. To solve these problems, we propose a resource allocation strategy based on tripartite graph in vehicular social networks (RATG). This strategy establishes a mobile vehicular social networks model based on vehicle mobility and social similarity. To maximize the content delivery efficiency and transmission rate, one-to-one stable matching based on mobile social connections and one-to-one stable matching based on channel state are established. The proposed strategy incorporates a heuristic optimization algorithm based on the maximum spanning tree, such that the matching results of the two tripartite graphs can reach the approximate global optimal simultaneously and further improve the service quality of vehicles. The simulation results show that the content delivery efficiency of the RATG strategy is 6.05%, 5.00%, and 10.64% higher than those of the randomized resources allocation strategy, local search strategy, and local ratio strategy, respectively, and the average transmission rate is at least 2.7% higher for the RATG strategy, relative to those of the other strategies.