A Position Sensitive Clustering Algorithm for VANET

Authors

  • Haiqing Liu Shandong University
  • Licai Yang Shandong University
  • Yao Zhang Shandong University
  • Lei Wu Shandong University

DOI:

https://doi.org/10.3991/ijoe.v10i1.3145

Keywords:

clustering, VANET, geography position, dynamic timestamp

Abstract


In order to overcome the defects such as too many cluster heads and large overhead in traditional single hop VANET clustering algorithms when there are high density vehicles, this article proposes a multi-hop cluster algorithm named the position sensitive clustering algorithm (PSCA). Based on the establishment of cluster structure, initial cluster head is selected following the â??Randomly Competition, First Declare Winâ?? principle. Cluster members transmit their expected status messages through the maintained multiple hop routings. After a series of information fusion and calculation work, the cluster head broadcasts the management messages based on dynamic timestamps. This article also gives the cluster maintaining strategy when the cluster head disappears or new nodes join. Tests performed in the simulation by NS-2 show that the proposed algorithm has less cluster heads and lower control overhead compared to the single hop-based approach (the Lowest-ID algorithm).

Downloads

Published

2014-02-01

How to Cite

Liu, H., Yang, L., Zhang, Y., & Wu, L. (2014). A Position Sensitive Clustering Algorithm for VANET. International Journal of Online and Biomedical Engineering (iJOE), 10(1), pp. 14–21. https://doi.org/10.3991/ijoe.v10i1.3145

Issue

Section

Special Focus Papers