Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 198

The DOI matches its Crossref record.

Grey wolf optimization based clustering algorithm for vehicular ad-hoc networks

Fahad, Muhammad, Aadil, Farhan, Rehman, Zahoor-ur-, Khan, Salabat, Shah, Peer Azmat, Muhammad, Khan, Lloret, Jaime, Wang, Haoxiang, Lee, Jong Weon, Mehmood, Irfan · 2018 · Computers & Electrical Engineering

Abstract

In vehicular ad-hoc network (VANETs), frequent topology changes occur due to fast moving nature of mobile nodes. This random topology creates instability that leads to scalability issues. To overcome this problem, clustering can be performed. Existing approaches for clustering in VANETs generate large number of cluster-heads which utilize the scarce wireless resources resulting in degraded performance. In this article, grey wolf optimization based clustering algorithm for VANETs is proposed, that replicates the social behaviour and hunting mechanism of grey wolfs for creating efficient clusters. The linearly decreasing factor of grey wolf nature enforces to converge earlier, which provides the optimized number of clusters. The proposed method is compared with well- known meta-heuristics from literature and results show that it provides optimal outcomes that lead to a robust routing protocol for clustering of VANETs, which is appropriate for highways and can accomplish quality communication, confirming reliable delivery of information to each vehicle.

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1016/j.compeleceng.2018.01.002

Cites

Statistics

Verification

Claims the paper makes

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Cited by

See all 198

Metadata

Authors
Fahad, M., Aadil, F., Rehman, Z.-U., Khan, S., Shah, P. A., Muhammad, K., Lloret, J., Wang, H., Lee, J. W., & Mehmood, I.
Venue
Computers & Electrical Engineering
Publisher
Elsevier BV
Published
2018-08
Volume
70
Pages
853-870
ISSN
0045-7906 (ISSN-L)
OpenAlex
W2793643983
Cited by
198
References
0
FWCI
8.37
Type
journal article
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Grey wolf optimization based clustering algorithm for vehicular ad-hoc networks. https://app.cochat.ai/papers/10.1016/j.compeleceng.2018.01.002
The paper
Fahad, M., Aadil, F., Rehman, Z.-U., Khan, S., Shah, P. A., Muhammad, K., Lloret, J., Wang, H., Lee, J. W., & Mehmood, I. (2018). Grey wolf optimization based clustering algorithm for vehicular ad-hoc networks. Computers & Electrical Engineering. https://doi.org/10.1016/j.compeleceng.2018.01.002

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.