CoChat

Enhancing network stability in VANETs using nature inspired algorithm for intelligent transportation system

Open access
Yerrathi, Sandeep, Pakala, Venugopal · 2024 · PLOS ONE

The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.

Abstract

The Internet of Vehicles (IoV) is one of the developing paradigms that integrates the automotive industry with the Internet of Things (IoT). The evolution of traditional Vehicular Ad-hoc Networks (VANETs), which are a layered framework for Intelligent Transportation Systems (ITS), is employed to provide Quality of Service (QoS) to end users in hazardous situations. VANETs can set up ad-hoc networks and share information among themselves using Peer-to-Peer (P2P) communication. Dynamic properties in VANETs such as dynamic topology, node mobility, sparse vehicle distribution, and bandwidth constraints can have an impact on scalability, routing, and security. This can result in frequent link failures, instability, reliability, and QOS concerns, as well as the inherent complexity of NP-hard problems. Researchers have proposed several techniques to achieve stability; the most prominent one is clustering, which relies on mobility metrics. However, existing clustering techniques generate overwhelming clusters, resulting in greater resource consumption, communication overhead, and hop count, which may lead to increased latency. Therefore, the primary objective is to achieve stability by increasing cluster lifetime, which is accomplished by generating optimal clusters. A nature-inspired meta-heuristic algorithm titled African Vulture Optimization Based Clustering Algorithm (AVOCA) is implemented to achieve it. The proposed algorithm can achieve load optimization with efficient resource utilization by mitigating hidden node challenges and ensuring communication proficiency. By maintaining an equilibrium state between the exploration and exploitation phases, AVOCA avoids local optima. The paper explores a taxonomy of the techniques used in Cluster Head (CH) selection, coordination, and maintenance to achieve stability with lower communication costs. We evaluated the effectiveness of AVOCA using various network grid sizes, transmission ranges, and network nodes. The results show that AVOCA generates 40% less clusters when compared to the Clustering Algorithm Based on Moth-Flame Optimization for VANETs (CAMONET). AVOCA generates 45% less clusters when compared to Self-Adaptive Multi-Kernel Clustering for Urban VANETs (SAMNET), AVOCA generates 43% less clusters when compared to Intelligent Whale Optimization Algorithm (i-WOA) and AVOCA generates 38% less clusters when compared to Harris Hawks Optimization (HHO). The results show that AVOCA outperforms state-of-the-art algorithms in generating optimal clusters.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1371/journal.pone.0296331

Cites

47 of 47 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig 1 VANET supporting V2X communication by taking advantage of clustering.
Fig 1 VANET supporting V2X communication by taking advantage of clustering.CC BY · PubMed Central
Fig 2 General procedural flow of clustering algorithm.
Fig 2 General procedural flow of clustering algorithm.CC BY · PubMed Central
Fig 3 General procedural flow chart for AVOCA.
Fig 3 General procedural flow chart for AVOCA.CC BY · PubMed Central
Fig 4 Tx range vs. no. of clusters for different node counts i.e. (a) 30 (b) 40 (c) 50, and (d) 60 for 1km X 1km grid.
Fig 4 Tx range vs. no. of clusters for different node counts i.e. (a) 30 (b) 40 (c) 50, and (d) 60 for 1km X 1km grid.CC BY · PubMed Central
Fig 5 Tx range vs. no. of clusters for different node counts i.e. (a) 30 (b) 40 (c) 50, and (d) 60 for 2km X 2km grid.
Fig 5 Tx range vs. no. of clusters for different node counts i.e. (a) 30 (b) 40 (c) 50, and (d) 60 for 2km X 2km grid.CC BY · PubMed Central
Fig 6 Tx range vs. no. of clusters for different node counts i.e. (a) 30 (b) 40 (c) 50, and (d) 60 for 3km X 3km grid.
Fig 6 Tx range vs. no. of clusters for different node counts i.e. (a) 30 (b) 40 (c) 50, and (d) 60 for 3km X 3km grid.CC BY · PubMed Central
Fig 7 Tx range vs. no. of clusters for different node counts i.e. (a) 30 (b) 40 (c) 50, and (d) 60 for 4kmX 4km grid.
Fig 7 Tx range vs. no. of clusters for different node counts i.e. (a) 30 (b) 40 (c) 50, and (d) 60 for 4kmX 4km grid.CC BY · PubMed Central
Fig 8 Network nodes vs. no. of clusters for different Tx Range (mts) i.e. (a) 100 (b) 200 (c) 300, and (d) 400 for 1 x 1 km2 Grid Size.
Fig 8 Network nodes vs. no. of clusters for different Tx Range (mts) i.e. (a) 100 (b) 200 (c) 300, and (d) 400 for 1 x 1 km2 Grid Size.CC BY · PubMed Central
Fig 9 Network nodes vs. no. of clusters for different Tx Range (mts) i.e. (a) 100 (b) 200 (c) 300, and (d) 400 for 2 x 2Km2 Grid Size.
Fig 9 Network nodes vs. no. of clusters for different Tx Range (mts) i.e. (a) 100 (b) 200 (c) 300, and (d) 400 for 2 x 2Km2 Grid Size.CC BY · PubMed Central
Fig 10 Network nodes vs. no. of clusters for different Tx Range (mts) i.e. (a) 100 (b) 200 (c) 300, and (d) 400 for 3 x 3Km2 Grid Size.
Fig 10 Network nodes vs. no. of clusters for different Tx Range (mts) i.e. (a) 100 (b) 200 (c) 300, and (d) 400 for 3 x 3Km2 Grid Size.CC BY · PubMed Central
Fig 11 Network nodes vs. no. of clusters for different Tx Range (mts) i.e. (a) 100 (b) 200 (c) 300, and (d) 400 for 4 x 4Km2 Grid Size.
Fig 11 Network nodes vs. no. of clusters for different Tx Range (mts) i.e. (a) 100 (b) 200 (c) 300, and (d) 400 for 4 x 4Km2 Grid Size.CC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 1

  1. Albashir A. Youssef, Aadaptive LDPC coded high data rate based IR-UWB combined with VMIMO system for vehicular communication links., AEU—Int J Electron Commun

Cited by

See all 19

Metadata

Authors
Yerrathi, S., & Pakala, V.
Affiliations
Vellore Institute of Technology University (IN)
Corresponding author
Pakala, Venugopal
Venue
PLOS ONE
Published
2024-01-11
Volume
19
Issue
1
Pages
e0296331
ISSN
1932-6203 (ISSN-L)
OpenAlex
W4390776947
Cited by
15
References
42
Citations by year
2026: 7 · 2025: 6 · 2024: 2
FWCI
1.55
Type
journal article
Language
en
Open access
Locations
  • PLoS ONE (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Greater South Information System
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Vehicular Ad Hoc Networks (VANETs)
  • Physical Sciences › Engineering › Control and Systems Engineering › Traffic control and management
  • Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
Keywords
vehicular ad hoc networks, network stability, cluster head selection, cluster formation, nature-inspired metaheuristics, clustering algorithms, hidden terminal problem, quality of service, intelligent transportation systems, Internet of Vehicles, swarm intelligence
MeSH terms
Algorithms, Computer Communication Networks, Reproducibility of Results, Cluster Analysis, Internet

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.