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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. ACM SIGCOMM 2001, San Diego, CA (2001)
Secure Hash Standard, U.S. Dept. Commerce/NIST, National Technical Information Service, Springfield, VA, FIPS 180-1 (1995)
Mauve, M., Widmer, J., Hartenstein, H.: A survey on position-based routing in mobile ad hoc networks. IEEE Networks, 30–39 (November/December 2001)
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of the sixth annual ACM/IEEE International Conference on Mobile computing and networking (MobiCom 2000), pp. 243–254 (2000)
Kieß, W., Füßler, H., Widmer, J.: Hierarchical Location Service for Mobile Ad-hoc Networks. ACM SIGMOBILE Mobile Computing and Communications Review 8, 47–58 (2004)
The ns-2 network simulator, http://www.isi.edu/nsnam/ns/
Li, J., Jannotti, J., De Couto, D.S.J., Karger, D.R., Morris, M.: A Scalable Location Service for Geographic Ad Hoc Routing. In: Proc. 6th Annual ACM/IEEE Int’l. Conf. Mobile Comp. Net., Boston, MA, pp. 120–130 (2000)
Das, S.M., Pucha, H., Hu, Y.C.: Performance comparison of scalable location services for geographic ad hoc routing. In: Proc.of IEEE INFOCOM, pp. 1228–1239 (2005)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)
Basagni, S., Chlamtac, I., Syrotiuk, V.R., Woodward, B.A.: A distance routing effect algorithm for mobility (DREAM). In: Proc. Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), pp. 76–84 (1998)
Giordano, S., Hamdi, M.: Mobility Management: The Virtual Home Region. Technical Report SSC/1999/037, EPFL-ICA (1999)
Käsemann, M., Hartenstein, H., Füßler, H., Mauve, M.: Analysis of a Location Service for Position-Based Routing in Mobile Ad Hoc Networks. In: Proceedings of the 1st German Workshop on Mobile Ad-hoc Networking (WMAN 2002), GI – Lecture Notes in Informatics, pp. 121–133 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, YJ., Wu, SY. (2008). Intersection Location Service for Vehicular Ad Hoc Networks with Cars in Manhattan Style Movement Patterns. In: Sandnes, F.E., Zhang, Y., Rong, C., Yang, L.T., Ma, J. (eds) Ubiquitous Intelligence and Computing. UIC 2008. Lecture Notes in Computer Science, vol 5061. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69293-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-69293-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69292-8
Online ISBN: 978-3-540-69293-5
eBook Packages: Computer ScienceComputer Science (R0)