A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
A farthest-first forwarding algorithm in VANETs
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.
A farthest-first forwarding algorithm in VANETs
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.
A farthest-first forwarding algorithm in VANETs
Chung-Ming Huang, (author) / Shih-Yang Lin, (author) / Shih-Hao Wang, (author) / Shih-Chin Hsu, (author)
2012-11-01
365499 byte
Conference paper
Electronic Resource
English
| UB Braunschweig | 1980
| British Library Online Contents | 2014
| British Library Online Contents | 2006
Farthest point problem and M-compact sets
| British Library Online Contents | 2017
Farthest points and strong convexity of sets
| British Library Online Contents | 2010