Intersection Location Service for Vehicular Ad Hoc Networks with Cars in Manhattan Style Movement Patterns

Authors:
Yao-Jen Chang;Shang-Yao Wu
Affiliations:
Department of Electronics Engineering, Chung Yuan Christian University, Taoyuan, Taiwan 320;Department of Electronics Engineering, Chung Yuan Christian University, Taoyuan, Taiwan 320
Venue:
UIC '08 Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing
Year:
2008

Citing 8
Cited 1

A distance routing effect algorithm for mobility (DREAM)

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Analysis of a Location Service for Position-Based Routing in Mobile Ad Hoc Networks

Mobile Ad-Hoc Netzwerke, 1. deutscher Workshop über Mobile Ad-Hoc Netzwerke WMAN 2002
Hierarchical location service for mobile ad-hoc networks

ACM SIGMOBILE Mobile Computing and Communications Review
A survey on position-based routing in mobile ad hoc networks

IEEE Network: The Magazine of Global Internetworking

Quorum-based location service protocol for vehicular ad hoc networks in urban environment

International Journal of Ad Hoc and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

For inter-vehicular communications that happen in metropolitan areas, moving cars travel on restricted directions along streets and make frequent stops over intersections. In this paper, we present Intersection Location Service (ILS), a distributed hashing-based location service algorithm that makes use of the features of street intersections and the Chord algorithm as the location query and fault tolerant mechanism. Performance comparisons of ILS with two well-known location service algorithms, Grid Location Service (GLS) and Hierarchical Location Service (HLS) are demonstrated in the ns-2 simulations of moving cars in various city environments. We have shown by means of simulation that ILS achieves good results in terms of query success ratios and remarkable scalability with respect to network size.