Dual-mode optimum distance routing scheme for vehicular ad hoc networks
Proceedings of the third ACM international symposium on Design and analysis of intelligent vehicular networks and applications
| Hi-index | 0.00 |
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.