Research Article
Performance study by simulations of intersection location service compared to two location service algorithms for vehicular ad hoc networks in metropolitan environments
@INPROCEEDINGS{10.4108/ICST.SIMUTOOLS2008.3035 , author={Yao-Jen Chang and Tai-Cheng Liao}, title={Performance study by simulations of intersection location service compared to two location service algorithms for vehicular ad hoc networks in metropolitan environments}, proceedings={1st International ICST Conference on Simulation Tools and Techniques for Communications, Networks and Systems}, publisher={ICST}, proceedings_a={SIMUTOOLS}, year={2010}, month={5}, keywords={}, doi={10.4108/ICST.SIMUTOOLS2008.3035 } }- Yao-Jen Chang
Tai-Cheng Liao
Year: 2010
Performance study by simulations of intersection location service compared to two location service algorithms for vehicular ad hoc networks in metropolitan environments
SIMUTOOLS
ICST
DOI: 10.4108/ICST.SIMUTOOLS2008.3035
Abstract
Numerous works have been found on location service algorithms for random waypoint VANETs but very few in metropolitan environments. In this paper, we have studied the performance of Intersection Location Service (ILS), a novel location service algorithm that is designed to work in the city environments with streets and intersections. A fault-recovery mechanism based on the Chord algorithm is used to retrieve location information of vehicles when the corresponding location services go out of service. The simulation analysis compares the performance of the proposed scheme with other two location based algorithms (GLS, HLS). The simulation results confirm the effectiveness of the ILS scheme in terms of increased success ratios under different network topologies. We also found the ILS algorithm not only remains robust at high car speeds but also demonstrates higher scalability than the other two with respect to network size.
