A Position Sensitive Clustering Algorithm for VANET

Haiqing Liu, Licai Yang, Yao Zhang, Lei Wu

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).

Keywords


clustering; VANET; geography position; dynamic timestamp

Full Text:

PDF



International Journal of Online and Biomedical Engineering (iJOE) – eISSN: 2626-8493
Creative Commons License
Indexing:
Scopus logo Clarivate Analyatics ESCI logo IET Inspec logo DOAJ logo DBLP logo EBSCO logo Ulrich's logo Google Scholar logo MAS logo