An Evolving Graph-Based Reliable Routing Scheme for VANETs
The DOI matches its Crossref record.
Abstract
Vehicular ad hoc networks (VANETs) are a special form of wireless networks made by vehicles communicating among themselves on roads. The conventional routing protocols proposed for mobile ad hoc networks (MANETs) work poorly in VANETs. As communication links break more frequently in VANETs than in MANETs, the routing reliability of such highly dynamic networks needs to be paid special attention. To date, very little research has focused on the routing reliability of VANETs on highways. In this paper, we use the evolving graph theory to model the VANET communication graph on a highway. The extended evolving graph helps capture the evolving characteristics of the vehicular network topology and determines the reliable routes preemptively. This paper is the first to propose an evolving graph-based reliable routing scheme for VANETs to facilitate quality-of-service (QoS) support in the routing process. A new algorithm is developed to find the most reliable route in the VANET evolving graph from the source to the destination. We demonstrate, through the simulation results, that our proposed scheme significantly outperforms the related protocols in the literature.
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.
Integrity signals
Registry
Cites
Statistics
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.
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
Bus-Trajectory-Based Street-Centric Routing for Message Delivery in Urban Vehicular Ad Hoc Networks
Sun, G., Zhang, Y., Liao, D., Yu, H., Du, X., & Guizani, M. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2828651 · Cited by 270
An Efficient Dynamic Solution for the Detection and Prevention of Black Hole Attack in VANETs
Malik, A., Khan, M. Z., Faisal, M., Khan, F., & Seo, J.-T. (2022) · Sensors · doi:10.3390/s22051897 · Cited by 83
“Graph theory is a promising approach for modeling and representing the connectivity analysis of vehicular networks [41,42].”
BackgroundHameed Hussein, N., Siaw Paw Koh, J., Yaw, C. T., Kiong Tiong, S., Benedict, F., Yusaf, T., Kadirgama, K., & Chung Hong, T. (2025) · IEEE Access · doi:10.1109/access.2024.3355313 · Cited by 59
Metadata
- Authors
- Eiza, M. H., & Ni, Q.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2013-05
- Volume
- 62
- Issue
- 4
- Pages
- 1493-1504
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2019744040
- Cited by
- 170
- References
- 0
- FWCI
- 10.98
- 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: An Evolving Graph-Based Reliable Routing Scheme for VANETs. https://app.cochat.ai/papers/10.1109/tvt.2013.2244625
- The paper
- Eiza, M. H., & Ni, Q. (2013). An Evolving Graph-Based Reliable Routing Scheme for VANETs. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2013.2244625
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.