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

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

New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks

Zhang, Degan, Ge, Hui, Zhang, Ting, Cui, Yu-Ya, Liu, Xiaohuan, Mao, Guoqiang·2019·IEEE Transactions on Intelligent Transportation Systems

Abstract

As a hierarchical network architecture, the cluster architecture can improve the routing performance greatly for vehicular ad hoc networks (VANETs) by grouping the vehicle nodes. However, the existing clustering algorithms only consider the mobility of a vehicle when selecting the cluster head. The rapid mobility of vehicles makes the link between nodes less reliable in cluster. A slight change in the speed of cluster head nodes has a great influence on the cluster members and even causes the cluster head to switch frequently. These problems make the traditional clustering algorithms perform poorly in the stability and reliability of the VANET. A novel passive multi-hop clustering algorithm (PMC) is proposed to solve these problems in this paper. The PMC algorithm is based on the idea of a multi-hop clustering algorithm that ensures the coverage and stability of cluster. In the cluster head selection phase, a priority-based neighbor-following strategy is proposed to select the optimal neighbor nodes to join the same cluster. This strategy makes the inter-cluster nodes have high reliability and stability. By ensuring the stability of the cluster members and selecting the most stable node as the cluster head in the N-hop range, the stability of the clustering is greatly improved. In the cluster maintenance phase, by introducing the cluster merging mechanism, the reliability and robustness of the cluster are further improved. In order to validate the performance of the PMC algorithm, we do many detailed comparison experiments with the algorithms of N-HOP, VMaSC, and DMCNF in the NS2 environment.

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.1109/tits.2018.2853165

Cites

12 of 12 references verified0 citation errors · 0 not checkable

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

Cites

Show all 12 references

Cited by

See all 395

Metadata

Authors
Zhang, D., Ge, H., Zhang, T., Cui, Y.-Y., Liu, X., & Mao, G.
Venue
IEEE Transactions on Intelligent Transportation Systems
Published
2019-04
Volume
20
Issue
4
Pages
1517-1530
ISSN
  • 1524-9050 (ISSN-L)
  • 1558-0016
OpenAlex
W2928400613
Cited by
395
References
12
FWCI
17.03
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: New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks. https://app.cochat.ai/papers/10.1109/tits.2018.2853165
The paper
Zhang, D., Ge, H., Zhang, T., Cui, Y.-Y., Liu, X., & Mao, G. (2019). New Multi-Hop Clustering Algorithm for Vehicular Ad Hoc Networks. IEEE Transactions on Intelligent Transportation Systems. https://doi.org/10.1109/tits.2018.2853165

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.