journal article·2021Open access

Adaptation of Vehicular Ad hoc Network Clustering Protocol for Smart Transportation

Masood Ahmad, Abdul Hameed, Fasee Ullah, Ishtiaq Wahid, Atif Khan, M. Irfan Uddin, Shafiq Ahmad, Ahmed M. El-Sherbeeny

Computers, Materials & Continua· Volume 67· Issue 2

Abstract

Clustering algorithms optimization can minimize topology maintenance overhead in large scale vehicular Ad hoc networks (VANETs) for smart transportation that results from dynamic topology, limited resources and non-centralized architecture. The performance of a clustering algorithm varies with the underlying mobility model to address the topology maintenance overhead issue in VANETs for smart transportation. To design a robust clustering algorithm, careful attention must be paid to components like mobility models and performance objectives. A clustering algorithm may not perform well with every mobility pattern. Therefore, we propose a supervisory protocol (SP) that observes the mobility pattern of vehicles and identifies the realistic Mobility model through microscopic features. An analytical model can be used to determine an efficient clustering algorithm for a specific mobility model (MM). SP selects the best clustering scheme according to the mobility model and guarantees a consistent performance throughout VANET operations. The simulation has performed in three parts that is the central part simulation for setting up the clustering environment, In the second part the clustering algorithms are tested for efficiency in a constrained atmosphere for some time and the third part represents the proposed scheme. The simulation results show that the proposed scheme outperforms clustering algorithms such as honey bee algorithm-based clustering and memetic clustering in terms of cluster count, re-affiliation rate, control overhead and cluster lifetime.
Source: openalex_inverted_index · Quality: baseline

Research context

OpenAlex topics: Vehicular Ad Hoc Networks (VANETs) · Opportunistic and Delay-Tolerant Networks · Mobile Ad Hoc Networks

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

References (16)

Show source-provided references
1. An improved supervisory protocol for automatic selection of routing protocols in environment-aware vehicular ad hoc networks10.1177/1550147718815051 ↗
2. A survey of clustering schemes for mobile ad hoc networks10.1109/COMST.2005.1423333 ↗
3. State-of-the-art clustering schemes in mobile ad hoc networks: Objectives, challenges, and future directions10.1109/ACCESS.2018.2885120 ↗
4. Energy-efficient multipath routing in networking aid of clustering with OGFSO algorithm10.1007/s00500-020-04710-4 ↗
5. An efficient mobility aware stable and secure clustering protocol for mobile ad hoc networks10.1007/s12083-019-00868-3 ↗
6. Towards developing enhanced cluster-based QoS-aware routing in MANET10.1155/2020/5481916 ↗
7. An efficient connected dominating set clustering based routing protocol with dynamic channel selection in cognitive mobile ad hoc networks10.3390/electronics8111332 ↗
8. Mobility aware loose clustering for mobile ad-hoc network10.1016/j.procs.2015.06.007 ↗
9. Leader based group routing in disconnected mobile ad-hoc networks with group mobility10.1007/s11277-012-0920-z ↗
10. Roy · Handbook of Mobile Ad Hoc Networks for Mobility Models · 2011 · 17010.1007/978-1-4419-6050-4 ↗
11. Honey bee algorithm-based efficient cluster formation and optimization scheme in mobile ad hoc networks10.1177/1550147717716815 ↗
12. A bio-inspired clustering in mobile ad hoc networks for internet of things based on honey bee and genetic algorithm
13. Cluster optimization in mobile ad hoc networks based on memetic algorithm: MemeHoc
14. Performance analysis of random-based mobility models in MANET routing protocol
15. R. S. Gray, D. Kotz, C. Newport, N. Dubrovsky, A. Fiske et al., “CRAWDAD dataset dartmouth/outdoor (v. 2006-11-06),” 2006. [Online]. Available: https://crawdad.org/dartmouth/outdoor/20061106/.
16. A novel macroscopic mobility model for vehicular networks10.1016/j.comnet.2015.01.003 ↗