A farthest-first forwarding algorithm in VANETs

Chung-Ming Huang, Shih Yang Lin, Shih Hao Wang, Shih Chin Hsu

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

1 Citation (Scopus)

Abstract

In order to reduce the transmission delay between the source vehicle and the destination vehicle, a Farthest-First forwarding algorithm (FF) algorithm is proposed in this paper to find dissemination paths with fewer hop counts, lower transmission delay, and fewer control packets. The proposed FF algorithm utilizes the general idea of the contention-based technique to choose the farthest vehicle from a sender to be a packet forwarder, which is decided by receivers themselves. In the FF algorithm, each receiver waits for a specific time period when a packet is received. The time period is calculated based on the distance between the sender vehicle and each receiver vehicle, and the waiting time period of the farthest vehicle is always less than other nearby vehicles. When the timer expires, farthest vehicle will first forwards the packet. Although the concept of FF algorithm similar to the greedy forwarding algorithm, the message exchanging for neighboring information maintenance in the proposed FF is unnecessary. Compare to the other mechanisms, the simulation results show that of using the proposed FF algorithm can reduce the transmission delay and fewer hop counts, significantly.

Original languageEnglish
Title of host publication2012 12th International Conference on ITS Telecommunications, ITST 2012
Pages817-821
Number of pages5
DOIs
Publication statusPublished - 2012 Dec 1
Event2012 12th International Conference on ITS Telecommunications, ITST 2012 - Taipei, Taiwan
Duration: 2012 Nov 52012 Nov 8

Publication series

Name2012 12th International Conference on ITS Telecommunications, ITST 2012

Other

Other2012 12th International Conference on ITS Telecommunications, ITST 2012
CountryTaiwan
CityTaipei
Period12-11-0512-11-08

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Huang, C-M., Lin, S. Y., Wang, S. H., & Hsu, S. C. (2012). A farthest-first forwarding algorithm in VANETs. In 2012 12th International Conference on ITS Telecommunications, ITST 2012 (pp. 817-821). [6425296] (2012 12th International Conference on ITS Telecommunications, ITST 2012). https://doi.org/10.1109/ITST.2012.6425296
Huang, Chung-Ming ; Lin, Shih Yang ; Wang, Shih Hao ; Hsu, Shih Chin. / A farthest-first forwarding algorithm in VANETs. 2012 12th International Conference on ITS Telecommunications, ITST 2012. 2012. pp. 817-821 (2012 12th International Conference on ITS Telecommunications, ITST 2012).
@inproceedings{c03b182422934e1c9765bd0906fa72f9,
title = "A farthest-first forwarding algorithm in VANETs",
abstract = "In order to reduce the transmission delay between the source vehicle and the destination vehicle, a Farthest-First forwarding algorithm (FF) algorithm is proposed in this paper to find dissemination paths with fewer hop counts, lower transmission delay, and fewer control packets. The proposed FF algorithm utilizes the general idea of the contention-based technique to choose the farthest vehicle from a sender to be a packet forwarder, which is decided by receivers themselves. In the FF algorithm, each receiver waits for a specific time period when a packet is received. The time period is calculated based on the distance between the sender vehicle and each receiver vehicle, and the waiting time period of the farthest vehicle is always less than other nearby vehicles. When the timer expires, farthest vehicle will first forwards the packet. Although the concept of FF algorithm similar to the greedy forwarding algorithm, the message exchanging for neighboring information maintenance in the proposed FF is unnecessary. Compare to the other mechanisms, the simulation results show that of using the proposed FF algorithm can reduce the transmission delay and fewer hop counts, significantly.",
author = "Chung-Ming Huang and Lin, {Shih Yang} and Wang, {Shih Hao} and Hsu, {Shih Chin}",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/ITST.2012.6425296",
language = "English",
isbn = "9781467330701",
series = "2012 12th International Conference on ITS Telecommunications, ITST 2012",
pages = "817--821",
booktitle = "2012 12th International Conference on ITS Telecommunications, ITST 2012",

}

Huang, C-M, Lin, SY, Wang, SH & Hsu, SC 2012, A farthest-first forwarding algorithm in VANETs. in 2012 12th International Conference on ITS Telecommunications, ITST 2012., 6425296, 2012 12th International Conference on ITS Telecommunications, ITST 2012, pp. 817-821, 2012 12th International Conference on ITS Telecommunications, ITST 2012, Taipei, Taiwan, 12-11-05. https://doi.org/10.1109/ITST.2012.6425296

A farthest-first forwarding algorithm in VANETs. / Huang, Chung-Ming; Lin, Shih Yang; Wang, Shih Hao; Hsu, Shih Chin.

2012 12th International Conference on ITS Telecommunications, ITST 2012. 2012. p. 817-821 6425296 (2012 12th International Conference on ITS Telecommunications, ITST 2012).

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

TY - GEN

T1 - A farthest-first forwarding algorithm in VANETs

AU - Huang, Chung-Ming

AU - Lin, Shih Yang

AU - Wang, Shih Hao

AU - Hsu, Shih Chin

PY - 2012/12/1

Y1 - 2012/12/1

N2 - In order to reduce the transmission delay between the source vehicle and the destination vehicle, a Farthest-First forwarding algorithm (FF) algorithm is proposed in this paper to find dissemination paths with fewer hop counts, lower transmission delay, and fewer control packets. The proposed FF algorithm utilizes the general idea of the contention-based technique to choose the farthest vehicle from a sender to be a packet forwarder, which is decided by receivers themselves. In the FF algorithm, each receiver waits for a specific time period when a packet is received. The time period is calculated based on the distance between the sender vehicle and each receiver vehicle, and the waiting time period of the farthest vehicle is always less than other nearby vehicles. When the timer expires, farthest vehicle will first forwards the packet. Although the concept of FF algorithm similar to the greedy forwarding algorithm, the message exchanging for neighboring information maintenance in the proposed FF is unnecessary. Compare to the other mechanisms, the simulation results show that of using the proposed FF algorithm can reduce the transmission delay and fewer hop counts, significantly.

AB - In order to reduce the transmission delay between the source vehicle and the destination vehicle, a Farthest-First forwarding algorithm (FF) algorithm is proposed in this paper to find dissemination paths with fewer hop counts, lower transmission delay, and fewer control packets. The proposed FF algorithm utilizes the general idea of the contention-based technique to choose the farthest vehicle from a sender to be a packet forwarder, which is decided by receivers themselves. In the FF algorithm, each receiver waits for a specific time period when a packet is received. The time period is calculated based on the distance between the sender vehicle and each receiver vehicle, and the waiting time period of the farthest vehicle is always less than other nearby vehicles. When the timer expires, farthest vehicle will first forwards the packet. Although the concept of FF algorithm similar to the greedy forwarding algorithm, the message exchanging for neighboring information maintenance in the proposed FF is unnecessary. Compare to the other mechanisms, the simulation results show that of using the proposed FF algorithm can reduce the transmission delay and fewer hop counts, significantly.

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

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

U2 - 10.1109/ITST.2012.6425296

DO - 10.1109/ITST.2012.6425296

M3 - Conference contribution

SN - 9781467330701

T3 - 2012 12th International Conference on ITS Telecommunications, ITST 2012

SP - 817

EP - 821

BT - 2012 12th International Conference on ITS Telecommunications, ITST 2012

ER -

Huang C-M, Lin SY, Wang SH, Hsu SC. A farthest-first forwarding algorithm in VANETs. In 2012 12th International Conference on ITS Telecommunications, ITST 2012. 2012. p. 817-821. 6425296. (2012 12th International Conference on ITS Telecommunications, ITST 2012). https://doi.org/10.1109/ITST.2012.6425296