Abstract
Vehicular ad hoc network (VANET) is a spontaneous creation of wireless network among vehicles to exchange data. Breakdown or interruption of communication is one of the most immediate and significant impacts of natural disasters. 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. For stable cluster formation in VANET, some constraints such as vehicles' velocity and vehicles' separation distance must be considered while selecting the cluster head which is the node responsible for data propagation to the infrastructure. In damaged VANET, the cluster head might be unable to successfully transmit the packets to the infrastructure. In such cases, overlapping clusters with double cluster heads is one of the best solutions to guarantee successful packet delivery to the destination. One of the major challenges in clustering is the cluster head (CH) election since the CH has a critical role in data routing.
This chapter discusses a new clustering algorithm based on a weighted formula for cluster head election. The weighted formula is based on three parameters: the trust, the distance, and the velocity. This protocol will elect two cluster heads to ensure an end-to-end communication path between source and destination.