IEEE Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice

These are the authors' versions of the work. The copyright is with ACM. They are posted here by permission of ACM for your personal use. Not for redistribution. See individual publication details for information on the publication of the definitive versions.

Springer-Verlag LNCS Copyright Notice

The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.

Work that appeared before the 1st of September 2003 was published while the authors were with the Lehrstuhl Praktische Informatik IV at the University of Mannheim.

Geographic Routing in City Scenarios

Author(s): Christian Lochert, Martin Mauve, Holger Füßler, Hannes Hartenstein.
Title: Geographic Routing in City Scenarios
Published: ACM SIGMOBILE Mobile Computing and Communications Review (MC2R) 9 (1), pp. 69--72, January 2005
Keyword(s): Ad Hoc Networking, Routing Algorithms, Geographic Routing, VANET
Abstract: Existing position based routing protocols are verywell suited for highly dynamic environments such as inter-vehiclecommunication on highways. However, it also has been discussed thatradio obstacles, as they are found in urban areas,have a significant negative impact on the performance of position-basedrouting. In prior work we presented a positionbased approach which eliminates these failures and is able to findrobust routes within city environments. The algorithm needs globalknowledge of the city topology which is provided by a static map.Given this information forwarding of the packets along a street isperformed in a position-based fashion while the list of junctions thathave to be traversed by the packet is calculated by the sender basedon the static map using the Dijkstra shortest path algorithm.In this short paper we show how position-based routing can be done ina city scenario without assuming that nodes have access to a staticglobal map.
DOI: 10.1145/1055959.1055970
Bib entry: [XML] [BibTeX]
Download: [PDF]
Verantwortlich für den Inhalt: E-Mail sendenWE Informatik