학술논문

Clustering Algorithm in Vehicular Ad-hoc Networks: A Brief Summary
Document Type
Conference
Source
2019 UK/ China Emerging Technologies (UCET) Emerging Technologies (UCET), 2019 UK/ China. :1-5 Aug, 2019
Subject
Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Signal Processing and Analysis
Clustering algorithms
Monte Carlo methods
Vehicular ad hoc networks
Classification algorithms
Topology
Measurement
Global Positioning System
VANETs
Clustering Algorithm
Single-hop
Multi-hop
ITS
Language
Abstract
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.