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

Tan, K., Le Kernec, J. , Imran, M. and Bremner, D. (2019) Clustering Algorithm in Vehicular Ad-hoc Networks: A Brief Summary. In: UK-China Emerging Technologies Conference, Glasgow, UK, 21-22 Aug 2019, ISBN 9781728127972 (doi: 10.1109/UCET.2019.8881833)

193780.pdf - Accepted Version



An 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.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Imran, Professor Muhammad and Le Kernec, Dr Julien and Tan, Kang and Bremner, Dr Duncan
Authors: Tan, K., Le Kernec, J., Imran, M., and Bremner, D.
College/School:College of Science and Engineering > School of Engineering > Systems Power and Energy
Copyright Holders:Copyright © 2020 IEEE
Publisher Policy:Reproduced in accordance with the publisher copyright policy

University Staff: Request a correction | Enlighten Editors: Update this record