An effective multi-hop broadcast in vehicular ad-hoc network

Authors:
Tae-Hwan Kim;Won-Kee Hong;Hie-Cheol Kim
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
Venue:
ARCS'07 Proceedings of the 20th international conference on Architecture of computing systems
Year:
2007

Citing 7
Cited 1

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
Challenges of intervehicle ad hoc networks

IEEE Transactions on Intelligent Transportation Systems
Vehicle-to-vehicle wireless communication protocols for enhancing highway traffic safety

IEEE Communications Magazine

Simulations of VANET scenarios with OPNET and SUMO

Nets4Cars/Nets4Trains'12 Proceedings of the 4th international conference on Communication Technologies for Vehicles

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-hop broadcast protocols in vehicular ad-hoc network (VANET) require more prompt message dissemination than traditional broadcast protocols because they mainly deal with vital data involved in driver safety. In this paper, a time reservation-based relay node selection algorithm is proposed in order to achieve immediate message dissemination. All nodes in the communication range of a relay node randomly choose their waiting time within a given time-window. The time-window range is determined by a distance from a previous relay node and a reservation ratio of the time-window. A node with the shortest waiting time is selected as a new relay node. The experimental results show that the proposed algorithm has a shorter end-to-end delay time than the distance-based relay node selection algorithm no matter how node density varies. In particular, when the node density is low, the proposed algorithm has a 25.7% shorter end-to-end time and a 46% better performance in terms of the compound metric than the distance-based relay node selection algorithm.