Tongxin xuebao (Mar 2021)
Vehicular cache nodes selection algorithm under load constraint in C-V2X
Abstract
In order to solve the problem that the C-V2X vehicle topology in urban environment was highly dynamic and the load capacity of vehicle nodes was limited, and improve the utilization of vehicular cache resources and reduce the load of base station, a vehicle cache nodes selection algorithm under load constraints was proposed.Firstly, by defining the link stability metric, the predicted weight adjacency matrix was constructed to describe the vehicular micro-topology in essence.Next, the objective function was further constructed under the load constraints and non-overlapping coverage constraint, which maximized the average link weight of the clusters by using the least cache nodes.Finally, the greedy concept was then introduced and the node states were reasonably defined.As a result, the minimum dominating set of the vehicle topology was figured out under the load constraints.Besides, the serviced neighbor nodes were then determined preferentially.The simulation results show that the proposed algorithm is close to the global optimal results in terms of the number of cache nodes and the average weight of cluster links.Moreover, the repeated response ratio of the proposed algorithm is always zero while the request response ratio can achieve the theoretical upper bound.Furthermore, the response times of cache resources can be also effectively improved.
