New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks
- Institute of Electrical and Electronics Engineers
- Publication Type:
- Journal Article
- IEEE Transactions on Intelligent Transportation Systems, 2019, 20, (4), pp. 1517-1530
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is new to OPUS and is not currently available.
IEEE As a hierarchical network architecture, the cluster architecture can improve the routing performance greatly for vehicular ad hoc networks (VANETs) by grouping the vehicle nodes. However, the existing clustering algorithms only consider the mobility of a vehicle when selecting the cluster head. The rapid mobility of vehicles makes the link between nodes less reliable in cluster. A slight change in the speed of cluster head nodes has a great influence on the cluster members and even causes the cluster head to switch frequently. These problems make the traditional clustering algorithms perform poorly in the stability and reliability of the VANET. A novel passive multi-hop clustering algorithm (PMC) is proposed to solve these problems in this paper. The PMC algorithm is based on the idea of a multi-hop clustering algorithm that ensures the coverage and stability of cluster. In the cluster head selection phase, a priority-based neighbor-following strategy is proposed to select the optimal neighbor nodes to join the same cluster. This strategy makes the inter-cluster nodes have high reliability and stability. By ensuring the stability of the cluster members and selecting the most stable node as the cluster head in the N-hop range, the stability of the clustering is greatly improved. In the cluster maintenance phase, by introducing the cluster merging mechanism, the reliability and robustness of the cluster are further improved. In order to validate the performance of the PMC algorithm, we do many detailed comparison experiments with the algorithms of N-HOP, VMaSC, and DMCNF in the NS2 environment.
Please use this identifier to cite or link to this item: