International Journal of Wireless and Microwave Technologies (IJWMT)
IJWMT Vol. 16, No. 3, 8 Jun. 2026
Cover page and Table of Contents: PDF (size: 1961KB)
A Comprehensive Survey on Partitional-Based Clustering Techniques in VANETs
PDF (1961KB), PP.14-39
Views: 0 Downloads: 0
Author(s)
K. Kalaiselvi
1,*
E. Karthikeyan
1
Index Terms
Vehicular Ad-Hoc Network, Cluster, Partitioning Algorithms, Distance Based Metrics, Cluster quality indices
Abstract
Vehicular Ad Hoc Networks enable dynamic and self-organizing communication among vehicles and roadside units, forming a fundamental backbone for advanced intelligent transportation systems. Efficient clustering plays a crucial role in VANETs by improving communication reliability, reducing network overhead, and enhancing scalability in highly dynamic environments. This study presents a comprehensive and critical survey of partitioning-based clustering algorithms in VANETs, explicitly addressing the lack of unified evaluation frameworks for distance metric selection and cluster quality assessment in dynamic vehicular environments. The significance of this work lies in its ability to bridge the gap between theoretical clustering approaches and their practical applicability in highly dynamic VANET scenarios through a structured and reproducible evaluation framework. Unlike existing surveys that primarily provide descriptive comparisons, this work introduces a structured and reproducible evaluation framework to systematically analyze the impact of distance metrics and clustering strategies under controlled simulation conditions. Widely adopted partitioning algorithms, including K-Means, K-Medoids, CLARA, and CLARANS, are systematically analyzed under diverse environmental conditions. Each algorithm is evaluated using multiple distance metrics, namely Euclidean, Manhattan, Minkowski, and Gaussian, to quantify similarity and dissimilarity among vehicles and to identify suitable clustering approaches for varying scenarios. The study identifies key research gaps, including the absence of standardized benchmarking, limited consideration of mobility-aware metrics, and insufficient analysis of distance metric sensitivity in highly dynamic scenarios. The quality of clustering is assessed using standard validation metrics, including Silhouette Score, Davies–Bouldin Index, and Calinski–Harabasz Index, along with cluster head lifetime to capture stability characteristics. Experimental results are presented as a supporting analytical component rather than a standalone contribution, with all simulation parameters, assumptions, and evaluation settings explicitly defined. The findings indicate that clustering performance is highly scenario-dependent, and while Euclidean distance and K-Means show strong performance under specific conditions, their effectiveness varies with network density, mobility patterns, and environmental dynamics. Overall, this study contributes to advancing the field by enabling more informed, reproducible, and context-aware clustering design, thereby supporting the development of more efficient and scalable intelligent transportation systems.
Cite This Paper
K. Kalaiselvi, E. Karthikeyan, "A Comprehensive Survey on Partitional-Based Clustering Techniques in VANETs", International Journal of Wireless and Microwave Technologies(IJWMT), Vol.16, No.3, pp. 14-39, 2026. DOI:10.5815/ijwmt.2026.03.02
Reference
[1]Mays Kareem Jabbar Alsabah and et al, “Survey on Clustering in VANET Networks, 18th International Multi-Conference on Systems”, Signals & Devices (SSD'21), IEEE, 2021, “doi: 10.1109/SSD52085.2021.9429353”.
[2]Nehad Hameed Hussein, CT Yaw, SP Koh, SK Tiong, and KH Chong, “A Comprehensive Survey on Vehicular Networking: Communications, Applications, Challenges, and Upcoming Research Directions”, IEEE, vol. 10, Aug 2022, “doi: 10.1109/ACCESS.2022.3198656”.
[3]Mays Kareem Jabbar, Hafedh Trabelsi, “A Review on Clustering in VANET: Algorithms, Phases, and Comparisons”, IEEE, 28, November 2022, “doi: 10.1109/SSD54932.2022.9955850”.
[4]Mohammad Mukhtaruzzaman, Mohammed Atiquzzaman, “Clustering in vehicular ad hoc network: Algorithms and challenges”, Elsevier, vol. 88, December 2020, “doi: 10.1016/j.compeleceng.2020.106851”.
[5]Kaur R, RK Ramachandran, R Doss, and L Pan, “The importance of selecting clustering parameters in VANETs: a survey”, Elsevier, vol.40, May 2021, “doi: 10. 1016/j. cosrev.2021.100392”.
[6]Karol Jurczenia, Jacek Rak, “A Survey of Vehicular Network Systems for Road Traffic Management”, IEEE, vol. 10, April 2022, “doi: 10.1109/ACCESS.2022.3168354”.
[7]Caizhi Zhang and et al, “Review of Clustering Technology and Its Application in Coordinating Vehicle Subsystems”, Springer, January 2023, “doi: 10.1007/s42154-022-00205-0”.
[8]Mostafa Raeisi, AB Sesay, “A Distance Metric for Uneven Clusters of Unsupervised K-Means Clustering Algorithm”, IEEE, vol.10, August 2022, “doi: 10.1109/ACCESS.2022.3198992”.
[9]H. Noori Abdulrazzak, GC Hock, Nam Radzi, and NML Tan, “A new unsupervised validation index model suitable for energy-efficient clustering techniques in VANET”, IEEE Access, vol. 11, pp. 74213–74228, 2023, “doi: 10.1109/ACCESS.2023.3281302”.
[10]Erich Schubert, Peter J. Rousseeuw, “Fast and eager k-medoids clustering: O(k) runtime improvement of the PAM, CLARA, and CLARANS algorithms”, Elsevier, Information Systems, vol. 101, November 2021, “doi: 10.1016/j.is.2021.101804”.
[11]M. Lee, T. Atkison, ”VANET applications: Past, present, and future”, Veh. Commun., vol. 1, Apr. 2020, Art. no. 100310, “doi: 10.1016/j.vehcom.2020.100310”.
[12]Khalid Kandali, L Bennis, and H Bennisand, “A New Hybrid Routing Protocol Using a Modified K-Means Clustering Algorithm and Continuous Hopfield Network for VANET”, IEEE, vol. 9, 2021, “doi:10.1109/ACCESS.2021.3068074”.
[13]Mohammed Ahmed Jubair and et al, “A QoS Aware Cluster Head Selection and Hybrid Cryptography Routing Protocol for Enhancing Efficiency and Security of VANETs”, IEEE, vol. 10, 2022, “doi: 10.1109/ACCESS.2022.3224466”.
[14]H. Karthikeyan, Dr.G. Usha, “Adaptive Clustering Algorithm for Stable Communication in Vanet”, Turkish Journal of Computer and Mathematics Education, vol.12 No.9 (2021), 1778- 1785.
[15]Yaser Ali Shah and et al, “An Evolutionary Algorithm-Based Vehicular Clustering Technique for VANETs”, IEEE, vol. 10, 2022, “doi: 10.1109/ACCESS.2022.3145905”.
[16]Raymond T. Ng, Jiawei Han, “CLARANS: A Method for Clustering Objects for Spatial Data Mining”, IEEE Transactions on Knowledge and Data Engineering, vol. 14, 2022.
[17]Khalid Kandali, L Bennis, O El Bannay, and H Bennis, “An Intelligent Machine Learning Based Routing Scheme for VANET”, IEEE, Vol. 10, 2022, “doi: 10.1109/ACCESS.2022.3190964”.
[18]Ankit Temurnikar, P Verma, and G Dhiman, “A PSO Enable Multi-Hop Clustering Algorithm for VANET”, International Journal of Swarm Intelligence Research, vol. 13, 2022, “doi: 10.4018/IJSIR.20220401.oa7”.
[19]Ahmed Salih Al-Obaidi1 and et al, “Cauchy Density-Based Algorithm for VANETs Clustering in 3D Road Environments”, IEEE, vol. 10, 2022, “doi: 10.1109/ACCESS.2022.3187698”.
[20]Saeid Pourroostaei Ardakani, CF Kwong, P Kar, Q Liu, and L Li, “CNN: A Cluster-Based Named Data Routing for Vehicular Networks”, IEEE Access, vol. 9, 2021, “doi: 10.1109/ACCESS.2021.3131198”.
[21]Reeya Agrawal and et al, “Classification and comparison of ad hoc networks: A review”, Egyptian Informatics Journal, 24 (2023) 1–25, 2022.
[22]Maryam Gillani, HA Niaz, MU Farooq, and A Ullahand, “Data collection protocols for VANETs: a survey”, Springer, Complex & Intelligent Systems (2022) 8:2593–2622, “doi: https://doi.org/10.1007/s40747-021-00629-x”.
[23]Narayan Khatri, S Lee, A Mateen, and SY Nam, “Event Message Clustering Algorithm for Selection of Majority Message in VANETs”, IEEE Access, vol. 11, 2023, “doi:10.1109/ACCESS.2023.3244327”.
[24]Hang Hu, Myung J. Lee, “Graph Neural Network-based Clustering Enhancement in VANET for Cooperative Driving”, IEEE Xplore, International Conference on Artificial Intelligence in Information and Communication (ICAIIC), 2022, “doi: 10.1109/ICAIIC54071.2022.9722625”.
[25]M. Saeid Haghighi Fard, Sinem Coleri, “Hierarchical Federated Learning in Multi-hop Cluster-Based VANETs”, IEEE explore, vol. 14, no. 8, August 2021.
[26]Manoj Sindhwani, C Singh, and R Singh, “Implementation of K-Means Algorithm and Dynamic Routing Protocol in VANET”, Computer Systems Science & Engineering, CSSE, 2022, vol.40, “doi:10.32604/csse.2022.018498”.
[27]Sami Abdul Jabbar Rashid, MM Hamdi, AJ AbdulElah, YJA Rajab, and KAH Zaaile, “Link stability based multipath routing and effective mobility prediction in cognitive radio enabled vehicular ad hoc network”, Bulletin of Electrical Engineering and Informatics, Vol. 13, No. 1, February 2024, pp. 215-221, “doi: 10.11591/eei.vl3il.5222”.
[28]Md. Monjur Ul Hasan, R Shahidi, DK Peters, L James, and R Gosine, “Piecemeal Clustering: A Self-Driven Data Clustering Algorithm”, IEEE Access, vol. 10, 2022, “doi: 10.1109/ACCESS.2022.3228238”.
[29]Mayank Sharma, P Kumar, and RS Tomar, “Weight-Based Clustering Algorithm for Military Vehicles Communication in VANET”, South African Institute Of Electrical Engineers, vol.114(1), March 2023.
[30]B. Ji and et al., “Survey on the Internet of vehicles: Network architectures and applications”, IEEE Commun. Standards Mag., vol. 4, no. 1, pp. 34_41, March. 2020.
[31]G.B.Santhi, SS Jacob, D Sheela, and P Kumaran, “Traffic coordination by reducing jamming attackers in VANET using probabilistic Manhattan Grid Topology for automobile applications”, Sci Rep 14, 8365 (2024). “doi: 10.1038/s41598-024-58240-2”.
[32]Ronald Adrian, S Sulistyo, IW Mustika, and S Alam, “MRV-M: A Cluster Stability in Highway VANET using Minimum Relative Velocity based on K-Medoids”, 2019 5th International Conference on Science and Technology (ICST), IEEE, “doi: 10.1109/ICST47872.2019.9166290”.
[33]Mohammed Saad Talib and et al, “A Novel Stable Clustering Approach based on Gaussian Distribution and Relative Velocity in VANETs”, (IJACSA) International Journal of Advanced Computer Science and Applications, vol. 9, No. 4, 2018.
[34]Y Li, L Guan, Z Zhang, G Vogiatzis, “LKSVC: A Novel VANET Caching Method by Integrating Location-Based K-Means Clustering into Spiking Neural Network”, Springer, vol. 245, pp. 195-208, April 2025.
[35]Radhakrishna Karne, Sreeja TK, "Clustering Algorithms and Comparisons in Vehicular Ad Hoc Networks”, Mesopotamian Journal of Computer Science, vol. 3, issue. 1, 2023, “doi: 10.58496/MJCSC/2023/014”.
[36]Khalid Kandali, Lamyae Bennis, Hanan Halaq, and Hamid Bennis, “A novel k-means powered algorithm for an efficient clustering in vehicular ad-hoc networks”, International Journal of Electrical and Computer Engineering (IJECE), vol. 13, pp. 3140-3148, No. 3, June 2023, “doi: 10.11591/ijece.v13i3”.
[37]Yuanqiu Mo, Ran Xing, and Huazhou Hou, “A Distributed Higher-Order K-Medoids Clustering Algorithm for Network Partition”, IEEE Xplore, vol.11, issue. 5, May 2024, “doi: 10.1109/TNSE.2024.3402383”.
[38]Raj Kannan C, Aghila Rajagopal, “A Survey on Multi Metric Clustering and Routing Optimization in Vehicular Ad Hoc Networks”, IEEE, 2025 International Conference on Sustainable Communication Networks and Application (ICSCN), 2025, “doi: 10.1109/ICSCN67106.2025.11308604”.
[39]Kumar, V., Manchanda, R., Patel, H. and et al., “Enhanced clustering approach for efficient relay vehicle selection in vehicular ad hoc networks”, Sci Rep, vol. 15, no. 38775, 2025, “doi: 10.1038/s41598-025-22623-w”.
[40]Haitham Albinhamad, Abdullah Alotibi, Ali Alagnam, Mohammed Almaiah, and Said Salloum, “Vehicular Ad-hoc Networks (VANETs): A Key Enabler for Smart Transportation Systems and Challenges”, Jordanian Journal of Informatics and Computing, vol. 1, 2025.
[41]Anish Shandilya, Varuna Gupta, and Bosco Paul Alapatt, “Comparative Performance Analysis of Clustering Algorithms for Scalable and Reliable Vehicular Ad-Hoc Networks (VANETs)”, IEEE Xplore, 5th International Conference on Advancement in Electronics & Communication Engineering (AECE), 2025.