An enhanced priority-based multi-hop clustering algorithm for vehicular ad hoc networks
by S. Rakhi; Kanakanahalli Ramanna Shobha
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 30, No. 1, 2024

Abstract: The importance of intelligence transportation system is increasing as it improves road safety and efficacy by means of vehicular ad hoc networks (VANET). The nodes in VANET are intelligent machines that can communicate with each other. Due to high mobility and frequent network fragmentation, stability is always a challenge in VANET. Even though traditional clustering methods address this issue, they exhibit less stability in highly dynamic scenarios. To improve the stability of the clusters, a new multi-hop clustering method named enhanced priority-based multi-hop clustering algorithm (EPMCA) is proposed. The best neighbours are chosen using neighbour following method. Then, stable clusters are established based on the average velocity of the cluster and the association lifetime between the nodes by the cluster head. The proposed algorithm shows significant improvement in average cluster head and cluster member duration, average cluster head changes, and number of clusters for varying communication ranges compared to existing techniques.

Online publication date: Thu, 30-Nov-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com