12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > An evolving graph-based reliable routing scheme...
View graph of relations

« Back

An evolving graph-based reliable routing scheme for VANETs

Research output: Contribution to journalJournal article

Published

Standard

An evolving graph-based reliable routing scheme for VANETs. / Eiza, Mahmoud Hashem; Ni, Qiang.

In: IEEE Transactions on Vehicular Technology, Vol. 62, No. 4, 05.2013, p. 1493-1504.

Research output: Contribution to journalJournal article

Harvard

Eiza, MH & Ni, Q 2013, 'An evolving graph-based reliable routing scheme for VANETs' IEEE Transactions on Vehicular Technology, vol 62, no. 4, pp. 1493-1504., 10.1109/TVT.2013.2244625

APA

Eiza, M. H., & Ni, Q. (2013). An evolving graph-based reliable routing scheme for VANETs. IEEE Transactions on Vehicular Technology, 62(4), 1493-1504. 10.1109/TVT.2013.2244625

Vancouver

Eiza MH, Ni Q. An evolving graph-based reliable routing scheme for VANETs. IEEE Transactions on Vehicular Technology. 2013 May;62(4):1493-1504. Available from: 10.1109/TVT.2013.2244625

Author

Eiza, Mahmoud Hashem; Ni, Qiang / An evolving graph-based reliable routing scheme for VANETs.

In: IEEE Transactions on Vehicular Technology, Vol. 62, No. 4, 05.2013, p. 1493-1504.

Research output: Contribution to journalJournal article

Bibtex

@article{eb991241386d492689f6b10b6fd6ab94,
title = "An evolving graph-based reliable routing scheme for VANETs",
author = "Eiza, {Mahmoud Hashem} and Qiang Ni",
year = "2013",
doi = "10.1109/TVT.2013.2244625",
volume = "62",
number = "4",
pages = "1493--1504",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",

}

RIS

TY - JOUR

T1 - An evolving graph-based reliable routing scheme for VANETs

A1 - Eiza,Mahmoud Hashem

A1 - Ni,Qiang

AU - Eiza,Mahmoud Hashem

AU - Ni,Qiang

PY - 2013/5

Y1 - 2013/5

N2 - <p>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 breakmore 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.</p>

AB - <p>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 breakmore 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.</p>

KW - vehicular ad hoc network (VANET)

KW - vehicular networks

KW - Evolving graph

KW - AD-HOC NETWORKS

KW - quality of service (QoS)

KW - routing reliability

UR - http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6425523

UR - http://www.scopus.com/inward/record.url?scp=84877862640&partnerID=8YFLogxK

U2 - 10.1109/TVT.2013.2244625

DO - 10.1109/TVT.2013.2244625

M1 - Journal article

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 4

VL - 62

SP - 1493

EP - 1504

ER -