Open Access iconOpen Access

ARTICLE

crossmark

Flag-Based Vehicular Clustering Scheme for Vehicular Ad-Hoc Networks

Fady Samann1,*, Shavan Askar2

1 Department of Energy Engineering, Technical College of Engineering, Duhok Polytechnic University, Duhok, 42001, Iraq
2 Department of Information System Engineering, Technical College of Engineering, Erbil Polytechnic University, Erbil, 44001, Iraq

* Corresponding Author: Fady Samann. Email: email

Computers, Materials & Continua 2023, 77(3), 2715-2734. https://doi.org/10.32604/cmc.2023.043580

Abstract

Clustering schemes in vehicular networks organize vehicles into logical groups. They are vital for improving network performance, accessing the medium, and enabling efficient data dissemination. Most schemes rely on periodically broadcast hello messages to provide up-to-date information about the vehicles. However, the periodic exchange of messages overwhelms the system and reduces efficiency. This paper proposes the Flag-based Vehicular Clustering (FVC) scheme. The scheme leverages a combination of Fitness Score (FS), Link Expiration Time (LET), and clustering status flags to enable efficient cluster formation in a hybrid manner. The FVC relies on the periodic broadcast of the basic safety message in the Dedicated Short-Range Communications (DSRC) standard for exchanging the vehicle’s status, FS, and joining request. Piggybacking extra information onto the existing periodic beacon reduces the overhead of exchanging additional control messages, which is the main contribution of this work. The scheme is implemented in a hybrid manner by utilizing a Road Side Unit (RSU) to implement a clustering algorithm. This work considered the FastPAM algorithm, a fast version of the Partitioning Around Medoids (PAM) clustering algorithm, to generate a list of potential cluster heads. The FVC scheme uses the LET as the clustering metric with the FastPAM algorithm. Moreover, the Lightweight FastPAM Vehicular Clustering (LFPVC) algorithm is considered by selecting the initial cluster heads based on the FS instead of the greedy FastPAM’s build stage. In the absence of the RSU, the vehicles utilize the FS with proper back-off time to self-elect the cluster head. The hybrid FVC scheme increased the cluster lifetime by 32% and reduced the control-message overhead by 63% compared to the related work. Moreover, the LFPVC algorithm achieved similar results to the FastPAM algorithm.

Keywords


Cite This Article

APA Style
Samann, F., Askar, S. (2023). Flag-based vehicular clustering scheme for vehicular ad-hoc networks. Computers, Materials & Continua, 77(3), 2715-2734. https://doi.org/10.32604/cmc.2023.043580
Vancouver Style
Samann F, Askar S. Flag-based vehicular clustering scheme for vehicular ad-hoc networks. Comput Mater Contin. 2023;77(3):2715-2734 https://doi.org/10.32604/cmc.2023.043580
IEEE Style
F. Samann and S. Askar, "Flag-Based Vehicular Clustering Scheme for Vehicular Ad-Hoc Networks," Comput. Mater. Contin., vol. 77, no. 3, pp. 2715-2734. 2023. https://doi.org/10.32604/cmc.2023.043580



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 742

    View

  • 320

    Download

  • 0

    Like

Share Link