VANET Clustering Based on Weighted Trusted Cluster Head Selection
Grace Khayat, Constandinos X. Mavromoustakis, George Mastorakis, Jordi Mongay Batalla, Hoda Maalouf, Evangelos Pallis
Abstract
VANET is a spontaneous creation of a wireless network among vehicles to exchange data. Clustering is one of the most common networking protocols for data propagation in those networks. The application of the clustering algorithm is effective in VANET because the algorithm makes it a more robust and scalable network. However, due to the high mobility of nodes, it is difficult to obtain stable clusters. One of the major challenges in clustering is the cluster head (CH) election since the CH has a critical role in data routing. For stable cluster formation in VANET, some constraints such as vehicles' velocity and vehicles' separation distance must be considered while selecting the CH. This paper proposes a new clustering algorithm based on a weighted formula for calculating the probability of cluster head selection. The weighted formula is based on three parameters: the trust, the distance, and the velocity. The trust is a newly added metric that is calculated by each vehicle and broadcasted to all neighbors. Whereas, the distance and the velocity are previously treated by other papers.