Abstract—Clustering is an important research topic in wireless networks, because cluster structures can facilitate resource reuse and increase system capacity. In this paper, we present a new clustering algorithm that considers both node position and node mobility in vehicular ad hoc environments. The proposed algorithm intends to create stable clusters by reducing reclustering overhead, prolonging cluster lifetime, and shortening the average distance between cluster heads and their cluster members. Most important, this algorithm supports single and multiple cluster heads. Simulation results show the superiority of our clustering algorithm over the other three well-known algorithms.
—VANET, clustering, multi-head, head election, mobility.
Shou-Chih Lo and Jhih-Siao Gao are with the Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan (e-mail: firstname.lastname@example.org, email@example.com).
Yi-Jen Lin was with the Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien, Taiwan (e-mail: firstname.lastname@example.org).
Cite: Shou-Chih Lo, Yi-Jen Lin, and Jhih-Siao Gao, "A Multi-Head Clustering Algorithm in Vehicular Ad Hoc Networks," International Journal of Computer Theory and Engineering
vol. 5, no. 2, pp. 242-247, 2013.