A dynamic single-hop clustering algorithm (DSCA) in VANET

Abstract

Road accident, traffic jam, and bad traffic conditions are some important issues, which traveler frequently faces, during their road journey. To handle these issues to a great extent and availing other commercial services during the journey, Vehicular Ad Hoc Network (VANET) is looking like a one of an optimum and feasible solution. The communication establishes in a flat vehicle-to-vehicle network scenario faces the challenge of high delay, low packet delivery ratio, and less throughput. With the motive to handle these challenges, the clustering technique is introduced in the VANET. The number of clustering algorithms is suggested in the literature for the vehicular environment. These clustering algorithms use the various metric in their model to select the best cluster head (CH). The best CH selection mainly contributes to improve clustering performance. To further improve the clustering performance, the efficient cluster head selection algorithm and cluster merging procedure are proposed in the suggested Dynamic Single-hop Clustering Algorithm (DSCA). The simulation result indicates the strength of the algorithm as compared to other popular algorithms in terms of CH duration and an average number of clusters.