An Effective Data Dissemination in Vehicular Ad-Hoc Network

Authors:
Tae-Hwan Kim;Won-Kee Hong;Hie-Cheol Kim;Yong-Doo Lee
Affiliations:
Department of Information and Communication Engineering, Daegu University, Gyeong-San, Korea;Department of Information and Communication Engineering, Daegu University, Gyeong-San, Korea;Department of Information and Communication Engineering, Daegu University, Gyeong-San, Korea;Department of Information and Communication Engineering, Daegu University, Gyeong-San, Korea
Venue:
Information Networking. Towards Ubiquitous Networking and Services
Year:
2008

Citing 6
Cited 0

The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Role-based multicast in highly mobile but sparsely connected ad hoc networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
GPS-Based Message Broadcasting for Inter-vehicle Communication

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Urban multi-hop broadcast protocol for inter-vehicle communication systems

Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Sensor Inter-Vehicle Communication for Safer Highways

AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
Vehicle-to-vehicle wireless communication protocols for enhancing highway traffic safety

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Vehicular ad-hoc network (VANET) has several characteristics that are different from mobile ad-hoc network (MANET). Due to these characteristics, the network topology based protocol, often used in MANET, can not be applied to VANET. In this paper, we propose an emergency warning message (EWM) broadcast protocol using range-based relay node selecting algorithm, which determines the minimal waiting time spent by a given node before re-broadcasting the received warning message. Because the waiting time for a message transmission is randomly calculated based on the distance between the sender node and the receiver node, the chosen node as the relay node will have have a minimal waiting time. The results of experiment show the proposed algorithm performed better than the flooding and the distance-based relay nodes selecting algorithm in terms of the network load and the end-to-end delay time. Furthermore, the proposed algorithm can reduce message transmission latency under the circumstances of low node density and short transmission range in VANET.