End-to-end routing for urban vehicular ad hoc networks

Authors:
HyunJae Jung;SuKyoung Lee;Jun Pyo Kim
Affiliations:
Dept. of Computer Science, Yonsei University, Seoul, Korea;Dept. of Computer Science, Yonsei University, Seoul, Korea;Dept. of Computer Science, Yonsei University, Seoul, Korea
Venue:
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Year:
2009

Citing 3
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Geographic routing in city scenarios

ACM SIGMOBILE Mobile Computing and Communications Review

Quantified Score

Hi-index	0.02

Visualization

Abstract

Vehicular Ad-hoc NETworks (VANETs) suffer from frequent network disconnections due to obstacles such as buildings even in urban environments with high density of traffic. Thus, in this paper, we propose a routing algorithm that finds optimal end-to-end paths in terms of both traffic density and distance in the urban VANET and selects the next hop with the minimum distance, while maintaining the minimum hop counts over the path. The simulation results show that the proposed algorithm achieves higher throughput and smaller end-to-end delay than Greedy Perimeter Stateless Routing (GPSR) with message carrying.