<?xml version="1.0" encoding="utf-8"?>
<publication xmlns="http://pi4.informatik.uni-mannheim.de"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xmlns:php="http://php.net/xsl"
xsi:noNamespaceSchemaLocation="http://www.informatik.uni-mannheim.de/pi4/config/schema/publication.xsd"
active="true" type="conference" lang="en" toappear="false"
pdf="false" ps="false" txt="false">
  <contributor personID="schnaufer" />
  <author personID="schnaufer" />
  <author personID="effelsberg" />
  <title>Position-Based Unicast Routing for City Scenarios</title>
  <conference>
    <name>IEEE International Symposium on a World of Wireless,
    Mobile and Multimedia Networks</name>
    <publisher>IEEE</publisher>
    <booktitle>Proc. of the 9th IEEE International Symposium on a
    World of Wireless, Mobile and Multimedia Networks (WoWMoM
    2008)</booktitle>
    <organization></organization>
    <location>Newport Beach, CA, USA</location>
  </conference>
  <year>2008</year>
  <month>06</month>
  <abstract lang="en">In Vehicular Ad-Hoc Networks unicast packet
  forwarding can be separated into the one-dimensional highway case
  and the two-dimensional city case; in this paper, we deal with
  the latter. We survey existing position-based routing protocols
  and present GRANT, our own approach of greedy routing with an
  abstract neighbor table. We simulate each protocol in our city
  scenario of Karlsruhe, consisting of streets with a length of 66
  km, 390 junctions, and radio obstacles derived from
  high-definition satellite images. We also simulate the protocols
  with a FACE-2- and a distance vector-based recovery strategy. As
  a result we propose GRANT as a routing protocol for unicast city
  scenarios.</abstract>
  <project projectID="manet" />
  <project projectID="vanet" />
</publication>
