Dynamic routing-tree based data forwarding scheme for urban vehicular ad hoc networks

Changqing Liu; Jinsheng Yang; Shih Lin Wu

doi:10.1109/CIT.2012.141

Dynamic routing-tree based data forwarding scheme for urban vehicular ad hoc networks

Changqing Liu^*
, Jinsheng Yang
, Shih Lin Wu

^*Corresponding author for this work

Department of Computer Science and Information Engineering

Tianjin University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Abstract

Vehicular ad hoc networks (VANETs) are expected to be used in many aspects ranging from road safety applications to commerce promotion and interactive services. Although data forwarding has been extensively addressed, some unique characteristics of VANETs offer new research interests. This paper presents a dynamic Routing-Tree based Data Forwarding (RTDF) scheme, which focuses on road networks with a static hotspot. The hotspot will broadcast messages to build a routing-tree to provide data delivery routes for vehicles if it receives more than a certain number of inquiries during a period of time. The certain number is calculated through an analytical packet delivery overhead model. The routing-tree can be dynamically maintained by each intersection. We suppose this scheme can provide minimum delay routes for vehicles with fewer packets delivery overheads compared to that of letting vehicles discover routes themselves, and some simulations are performed to verify this belief. Extensive simulations will be done in future work to verify other performance metrics.

Original language	English
Title of host publication	Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012
Pages	672-677
Number of pages	6
DOIs	https://doi.org/10.1109/CIT.2012.141
State	Published - 2012
Event	2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012 - Chengdu, Sichuan, China Duration: 27 10 2012 → 29 10 2012

Publication series

Name	Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012

Conference

Conference	2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012
Country/Territory	China
City	Chengdu, Sichuan
Period	27/10/12 → 29/10/12

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 3 Good Health and Well-being
SDG 11 Sustainable Cities and Communities

Keywords

dynamic routing
packet delivery overhead
routing-tree based data forwarding
vehicular ad hoc networks

Access to Document

10.1109/CIT.2012.141

Cite this

Liu, C., Yang, J., & Wu, S. L. (2012). Dynamic routing-tree based data forwarding scheme for urban vehicular ad hoc networks. In Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012 (pp. 672-677). Article 6391978 (Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012). https://doi.org/10.1109/CIT.2012.141

@inproceedings{8f43491fd662418ba04847e8609a952c,

title = "Dynamic routing-tree based data forwarding scheme for urban vehicular ad hoc networks",

abstract = "Vehicular ad hoc networks (VANETs) are expected to be used in many aspects ranging from road safety applications to commerce promotion and interactive services. Although data forwarding has been extensively addressed, some unique characteristics of VANETs offer new research interests. This paper presents a dynamic Routing-Tree based Data Forwarding (RTDF) scheme, which focuses on road networks with a static hotspot. The hotspot will broadcast messages to build a routing-tree to provide data delivery routes for vehicles if it receives more than a certain number of inquiries during a period of time. The certain number is calculated through an analytical packet delivery overhead model. The routing-tree can be dynamically maintained by each intersection. We suppose this scheme can provide minimum delay routes for vehicles with fewer packets delivery overheads compared to that of letting vehicles discover routes themselves, and some simulations are performed to verify this belief. Extensive simulations will be done in future work to verify other performance metrics.",

keywords = "dynamic routing, packet delivery overhead, routing-tree based data forwarding, vehicular ad hoc networks",

author = "Changqing Liu and Jinsheng Yang and Wu, \{Shih Lin\}",

year = "2012",

doi = "10.1109/CIT.2012.141",

language = "英语",

isbn = "9780769548586",

series = "Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012",

pages = "672--677",

booktitle = "Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012",

note = "2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012 ; Conference date: 27-10-2012 Through 29-10-2012",

}

Liu, C, Yang, J & Wu, SL 2012, Dynamic routing-tree based data forwarding scheme for urban vehicular ad hoc networks. in Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012., 6391978, Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012, pp. 672-677, 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012, Chengdu, Sichuan, China, 27/10/12. https://doi.org/10.1109/CIT.2012.141

Dynamic routing-tree based data forwarding scheme for urban vehicular ad hoc networks. / Liu, Changqing; Yang, Jinsheng; Wu, Shih Lin.
Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012. 2012. p. 672-677 6391978 (Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Dynamic routing-tree based data forwarding scheme for urban vehicular ad hoc networks

AU - Liu, Changqing

AU - Yang, Jinsheng

AU - Wu, Shih Lin

PY - 2012

Y1 - 2012

N2 - Vehicular ad hoc networks (VANETs) are expected to be used in many aspects ranging from road safety applications to commerce promotion and interactive services. Although data forwarding has been extensively addressed, some unique characteristics of VANETs offer new research interests. This paper presents a dynamic Routing-Tree based Data Forwarding (RTDF) scheme, which focuses on road networks with a static hotspot. The hotspot will broadcast messages to build a routing-tree to provide data delivery routes for vehicles if it receives more than a certain number of inquiries during a period of time. The certain number is calculated through an analytical packet delivery overhead model. The routing-tree can be dynamically maintained by each intersection. We suppose this scheme can provide minimum delay routes for vehicles with fewer packets delivery overheads compared to that of letting vehicles discover routes themselves, and some simulations are performed to verify this belief. Extensive simulations will be done in future work to verify other performance metrics.

AB - Vehicular ad hoc networks (VANETs) are expected to be used in many aspects ranging from road safety applications to commerce promotion and interactive services. Although data forwarding has been extensively addressed, some unique characteristics of VANETs offer new research interests. This paper presents a dynamic Routing-Tree based Data Forwarding (RTDF) scheme, which focuses on road networks with a static hotspot. The hotspot will broadcast messages to build a routing-tree to provide data delivery routes for vehicles if it receives more than a certain number of inquiries during a period of time. The certain number is calculated through an analytical packet delivery overhead model. The routing-tree can be dynamically maintained by each intersection. We suppose this scheme can provide minimum delay routes for vehicles with fewer packets delivery overheads compared to that of letting vehicles discover routes themselves, and some simulations are performed to verify this belief. Extensive simulations will be done in future work to verify other performance metrics.

KW - dynamic routing

KW - packet delivery overhead

KW - routing-tree based data forwarding

KW - vehicular ad hoc networks

UR - https://www.scopus.com/pages/publications/84872340251

U2 - 10.1109/CIT.2012.141

DO - 10.1109/CIT.2012.141

M3 - 会议稿件

AN - SCOPUS:84872340251

SN - 9780769548586

T3 - Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012

SP - 672

EP - 677

BT - Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012

T2 - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012

Y2 - 27 October 2012 through 29 October 2012

ER -

Liu C, Yang J, Wu SL. Dynamic routing-tree based data forwarding scheme for urban vehicular ad hoc networks. In Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012. 2012. p. 672-677. 6391978. (Proceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012). doi: 10.1109/CIT.2012.141

Dynamic routing-tree based data forwarding scheme for urban vehicular ad hoc networks

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this