A farthest-first forwarding algorithm in VANETs

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

研究成果: Conference contribution

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題2012 12th International Conference on ITS Telecommunications, ITST 2012
頁面817-821
頁數5
DOIs
出版狀態Published - 2012 十二月 1
事件2012 12th International Conference on ITS Telecommunications, ITST 2012 - Taipei, Taiwan
持續時間: 2012 十一月 52012 十一月 8

出版系列

名字2012 12th International Conference on ITS Telecommunications, ITST 2012

Other

Other2012 12th International Conference on ITS Telecommunications, ITST 2012
國家Taiwan
城市Taipei
期間12-11-0512-11-08

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

引用此