MhCA: A novel Multi-Hop Clustering Algorithm for VANET
##plugins.themes.academic_pro.article.main##
Abstract
Clustering has been proved to be a useful mechanism in ad-hoc networks due to the distributed hierarchical network it provides. In Vehicular Ad-hoc Networks (VANET) clustering has been proved to be useful in managing the network by improving the scalability of the large-scale network and also in load balancing and efficient resource consumption/ allocation with low overhead. In this paper, we introduce a multi-hop cluster-based algorithm (MhCA ) for VANET. MhCA is a novel clustering technique that uses the rank-index-based CH selection strategy to choose the node with the highest rank index as the cluster-head and the rank index is calculated using fuzzy logic. The paper below consists of various algorithms along with a detailed description of those algorithms. To show the performance of the proposed algorithm extensive simulation experiments using ns3 and SUMO are carried out. At the end of the paper, the results are shown along with the conclusion and the future scope.
##plugins.themes.academic_pro.article.details##
This work is licensed under a Creative Commons Attribution 4.0 International License.
References
- Basagni, S. 1999. Distributed clustering for ad hoc networks. 310–315.
- Campolo, Claudia, M. A. S. R. 2015. Vehicular ad hoc networks, standards, solutions, and research. Springer,Intelligent Transportation Systems V2I Resources. DOI: https://doi.org/10.1007/978-3-319-15497-8
- D. Zhang, Hui Ge, T. Z. Y. Y. C. X. L. G. M. 2018. New multi-hop clustering algorithm for vehicular adhoc networks. IEEE Transactions on Intelligent Transportation Systems.
- et al, A. B. T. 2019. Enhanced weight-based clustering algorithm to provide reliable delivery for vanet safety applications. PLOS ONE .
- G. H. Alsuhi, A. Khattab, Y. A. F. 2019. Double- head clustering for resilient vanets. DOI: https://doi.org/10.1155/2019/2917238
- Hindawi Wireless Communications and Mobile Computing .
- Kuklinski, S. and G. Wolny.., pages 1–6, A. . 2009. Density based clustering algorithm for vanets. 1–6.
- L. Zhang, H. E.-S. 2012. A novel cluster-based protocol for topology discovery in vehicular ad-hoc network. Computer Science, 525–534. DOI: https://doi.org/10.1016/j.procs.2012.06.067
- M. Ren, J. Zhang, L. K. H. L. V. V. 2017. A unified framework of clustering approach in vehicular ad hoc networks. IEEE Transactions on Intelligent Transportation Systems, 1–14.
- Rasmeet S Bali, Neeraj Kumar, J. J. R. 2014. Clustering in vehicular ad hoc networks: Taxonomy, challenges, and solutions. Vehicular Communications.
- Seyhan Ucar, S.C. Ergen, O. O. 2013. Vmasc: Vehicular multi-hop algorithm for stable clustering in vehicular adhoc networks. IEEE Wireless Communications, and Networking Conference: Networks, 2381–2386. DOI: https://doi.org/10.1109/WCNC.2013.6554933
- Watfa, M. 2010. Advances in vehicular ad-hoc networks: Developments and challenges. Infor- mation Science Reference. DOI: https://doi.org/10.4018/978-1-61520-913-2
- Wolny, G. 2008. Modified dmac clustering algorithm for vanets. Systems and Networks Com- munications, 268–273. DOI: https://doi.org/10.1109/ICSNC.2008.28
- X. Ji, H. Yu, G. F. H. S. L. C. 2018. Efficient and reliable cluster-based transmission for vehicular adhoc networks. Hindawi Mobile Information Systems. DOI: https://doi.org/10.1155/2018/9826782
- Y. Chen, M. Fang, S. S. W. G. X. Z. 2015. Distributed multihop clustering algorithm for vanets based on neighborhood follow. J. Wireless Communication. Networks., 1–12. DOI: https://doi.org/10.1186/s13638-015-0327-0
- Z. Zhang, A. Boukerche, R. P. 2011. A novel multi-hop clustering scheme for vehicular ad-hoc networks. 19–26. DOI: https://doi.org/10.1145/2069131.2069135