Vehicle Clustering Algorithm based on Reliable Node Screening

In order to solve the problem of unstable communication between high-speed moving vehicles in the Internet of Vehicles, a clustering algorithm based on reliable node screening was proposed in this paper. The algorithm screened the neighbor nodes according to the vehicle direction and the vehicle link survival time, and formed a list of reliable nodes. Furthermore, a cluster head election method was proposed based on node reliability degree. Through NS3 and Sumo co-simulation, it is found that the proposed algorithm has better cluster stability compared with the traditional algorithm in the environment of high speed and high vehicle density.