Clustering Algorithm in Vehicular Ad-hoc Networks: A Brief Summary

Abstract

n Intelligent Transportation System (ITS) application requires vehicles to be connected to each other and to roadside units to share information, thus reducing fatalities and improving traffic congestion. Vehicular Ad hoc Networks (VANETs) is one of the main forms of network designed for ITS in which information is broadcasted amongst vehicular nodes. However, the broadcast reliability in VANETs face a number of challenges - dynamic routing being one of the major issues. Clustering, a technique used to group nodes based on certain criteria, has been suggested as a solution to this problem. This paper gives a summary of the core criteria of some of the clustering algorithms issues along with a performance comparison and a development evolution roadmap, in an attempt to understand and differentiate different aspects of the current research and suggest future research insights.

Original document

The different versions of the original document can be found in:

• http://eprints.gla.ac.uk/193780/7/193780.pdf

• http://eprints.gla.ac.uk/193780,

https://dblp.uni-trier.de/db/conf/ucet/ucet2019.html#TanKIB19,

https://academic.microsoft.com/#/detail/2971209102

• http://xplorestaging.ieee.org/ielx7/8868935/8881831/08881833.pdf?arnumber=8881833,

http://dx.doi.org/10.1109/ucet.2019.8881833