A Survey of Greedy Routing Protocols for Vehicular Ad Hoc Networks

Abstract

A vehicular ad-hoc network is a new technology which has garnered enormous attention in recent years. Vehicular ad-hoc networks are special cases of mobile ad-hoc networks, in which nodes are highly mobile, so the network topology changes very fast. Rapid topology changes and frequent link disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles and possibly roadside infrastructure as well. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing are known to be very suitable for a vehicular ad-hoc network. In this paper, we provide a survey of greedy routing protocols for vehicular ad-hoc networks, and discuss the advantages and disadvantages of these routing protocols, and define some open issues and possible directions of future research related to using greedy routing protocols for vehicular ad-hoc networks.