Clustering Review in Vehicular Ad hoc Networks: Algorithms, Comparisons, Challenges and Solutions
The Vehicular Ad-hoc Network (VANET) represents a new future for dynamic information dissemination between societies. VANET has a wide range of applications in a variety of aspects, including Intelligent Transportation Systems (ITS). VANET has some characteristics, like highly dynamic topology and i...
Uloženo v:
| Vydáno v: | International journal of interactive mobile technologies Ročník 16; číslo 10; s. 25 - 48 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
24.05.2022
|
| ISSN: | 1865-7923, 1865-7923 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The Vehicular Ad-hoc Network (VANET) represents a new future for dynamic information dissemination between societies. VANET has a wide range of applications in a variety of aspects, including Intelligent Transportation Systems (ITS). VANET has some characteristics, like highly dynamic topology and intermittent connections. These characteristics lead to untrustworthy information transmission in VANET. Vehicle clustering is an efficient approach to improve the scalability of the network and connection reliability. The performance of the clustering is also affected by VANET characteristics. This article provides a comprehensive description of VANET clustering algorithms. The most notable clustering algorithms introduced between 1999 and 2021 are reviewed. A complete survey on clustering in VANETs is provided based upon the clustering process. The clustering process in most algorithms is explored in the aspects of CH selection metrics, cluster formation, and cluster maintenance. The clustering techniques based on some parameters like stability, convergence, overhead, and latency are compared. Some of the most common problems, as well as the approaches employed to solve them, are also discussed. Also, the performance parameters which evaluate the clustering approaches are summarized. |
|---|---|
| ISSN: | 1865-7923 1865-7923 |
| DOI: | 10.3991/ijim.v16i10.29973 |