Efficient VANET unicast routing using historical and real-time traffic information

Ing-Chau Chang, Yuan Fen Wang, Cheng Fu Chou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

In this paper, we propose an intersection graph-based vehicular ad hoc network (VANET) architecture. Using the available electronic MAP and historical traffic statistics from public traffic databases, we create an intersection graph (IG) consisting of all connected road segments, which have shorter average inter-vehicle distances than the wireless transmission range, as its edges and intersections of these road segments as its vertices. We then calculate the least cost routing path in the IG. Hence, the source vehicle leverages the proposed IG and IG bypass routing protocols to greedily forward unicast packets to the destination vehicle via each intermediate intersection on the least cost IG path. Further, we also propose the IG routing path recovery process to handle the broken IG path in real-time. Finally, we execute NS2 simulations to exhibit that the IG and IG bypass routing protocols significantly outperform four wellknown VANET ones in terms of the average packet delivery ratio, end-to-end delay and hop count.

Original languageEnglish
Title of host publicationProceedings - 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011
Pages458-464
Number of pages7
DOIs
Publication statusPublished - 2011 Dec 1
Event2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011 - Tainan, Taiwan
Duration: 2011 Dec 72011 Dec 9

Publication series

NameProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
ISSN (Print)1521-9097

Other

Other2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011
CountryTaiwan
CityTainan
Period11-12-0711-12-09

Fingerprint

Vehicular ad hoc networks
Network routing
Routing protocols
Network architecture
Costs

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

Chang, I-C., Wang, Y. F., & Chou, C. F. (2011). Efficient VANET unicast routing using historical and real-time traffic information. In Proceedings - 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011 (pp. 458-464). [6121311] (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS). https://doi.org/10.1109/ICPADS.2011.57
Chang, Ing-Chau ; Wang, Yuan Fen ; Chou, Cheng Fu. / Efficient VANET unicast routing using historical and real-time traffic information. Proceedings - 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011. 2011. pp. 458-464 (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS).
@inproceedings{036ec4fa8aca409c8d503eee14e500f3,
title = "Efficient VANET unicast routing using historical and real-time traffic information",
abstract = "In this paper, we propose an intersection graph-based vehicular ad hoc network (VANET) architecture. Using the available electronic MAP and historical traffic statistics from public traffic databases, we create an intersection graph (IG) consisting of all connected road segments, which have shorter average inter-vehicle distances than the wireless transmission range, as its edges and intersections of these road segments as its vertices. We then calculate the least cost routing path in the IG. Hence, the source vehicle leverages the proposed IG and IG bypass routing protocols to greedily forward unicast packets to the destination vehicle via each intermediate intersection on the least cost IG path. Further, we also propose the IG routing path recovery process to handle the broken IG path in real-time. Finally, we execute NS2 simulations to exhibit that the IG and IG bypass routing protocols significantly outperform four wellknown VANET ones in terms of the average packet delivery ratio, end-to-end delay and hop count.",
author = "Ing-Chau Chang and Wang, {Yuan Fen} and Chou, {Cheng Fu}",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/ICPADS.2011.57",
language = "English",
isbn = "9780769545769",
series = "Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS",
pages = "458--464",
booktitle = "Proceedings - 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011",

}

Chang, I-C, Wang, YF & Chou, CF 2011, Efficient VANET unicast routing using historical and real-time traffic information. in Proceedings - 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011., 6121311, Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS, pp. 458-464, 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011, Tainan, Taiwan, 11-12-07. https://doi.org/10.1109/ICPADS.2011.57

Efficient VANET unicast routing using historical and real-time traffic information. / Chang, Ing-Chau; Wang, Yuan Fen; Chou, Cheng Fu.

Proceedings - 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011. 2011. p. 458-464 6121311 (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Efficient VANET unicast routing using historical and real-time traffic information

AU - Chang, Ing-Chau

AU - Wang, Yuan Fen

AU - Chou, Cheng Fu

PY - 2011/12/1

Y1 - 2011/12/1

N2 - In this paper, we propose an intersection graph-based vehicular ad hoc network (VANET) architecture. Using the available electronic MAP and historical traffic statistics from public traffic databases, we create an intersection graph (IG) consisting of all connected road segments, which have shorter average inter-vehicle distances than the wireless transmission range, as its edges and intersections of these road segments as its vertices. We then calculate the least cost routing path in the IG. Hence, the source vehicle leverages the proposed IG and IG bypass routing protocols to greedily forward unicast packets to the destination vehicle via each intermediate intersection on the least cost IG path. Further, we also propose the IG routing path recovery process to handle the broken IG path in real-time. Finally, we execute NS2 simulations to exhibit that the IG and IG bypass routing protocols significantly outperform four wellknown VANET ones in terms of the average packet delivery ratio, end-to-end delay and hop count.

AB - In this paper, we propose an intersection graph-based vehicular ad hoc network (VANET) architecture. Using the available electronic MAP and historical traffic statistics from public traffic databases, we create an intersection graph (IG) consisting of all connected road segments, which have shorter average inter-vehicle distances than the wireless transmission range, as its edges and intersections of these road segments as its vertices. We then calculate the least cost routing path in the IG. Hence, the source vehicle leverages the proposed IG and IG bypass routing protocols to greedily forward unicast packets to the destination vehicle via each intermediate intersection on the least cost IG path. Further, we also propose the IG routing path recovery process to handle the broken IG path in real-time. Finally, we execute NS2 simulations to exhibit that the IG and IG bypass routing protocols significantly outperform four wellknown VANET ones in terms of the average packet delivery ratio, end-to-end delay and hop count.

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

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

U2 - 10.1109/ICPADS.2011.57

DO - 10.1109/ICPADS.2011.57

M3 - Conference contribution

AN - SCOPUS:84863036618

SN - 9780769545769

T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

SP - 458

EP - 464

BT - Proceedings - 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011

ER -

Chang I-C, Wang YF, Chou CF. Efficient VANET unicast routing using historical and real-time traffic information. In Proceedings - 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011. 2011. p. 458-464. 6121311. (Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS). https://doi.org/10.1109/ICPADS.2011.57