A hybrid backbone based clustering algorithm for vehicular ad-hoc networks

Citations of this article
Mendeley users who have this article in their library.


In recent years, Vehicular Ad-Hoc Networks (VANETs) have become an active area of research due to their applications in Intelligent Transportation System (ITS). By creating a vehicular network, vehicles can send warning messages to alert drivers in other vehicles about the dynamically varying road condition thus further improving human safety on roads. VANETs exhibits unique characteristic like dynamically changing topology that should be managed for managing the network for applications related to timely delivery of sensitive messages. Clustering is a most effective way of managing and stabilizing such networks. A stable clustering algorithm reduces the overhead of re-clustering and makes the network management task easier. In this paper a hybrid backbone based clustering algorithm for VANETs is proposed. The concept of number of links and vehicular mobility is used for cluster formation and cluster head selection. During cluster formation, nodes with relatively higher degree of connectivity, initially form a backbone that is designated as leadership. The leadership than participates in cluster-head election and efficient cluster re-organization using aggregate relative velocity of vehicles in the leadership. Simulation results show that the proposed algorithm exhibits comparable cluster stability in urban scenarios.




Singh, J. P., & Bali, R. S. (2015). A hybrid backbone based clustering algorithm for vehicular ad-hoc networks. In Procedia Computer Science (Vol. 46, pp. 1005–1013). Elsevier B.V. https://doi.org/10.1016/j.procs.2015.01.011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free