A survey on void handling techniques for geographic routing in VANET network

Abstract

Geographic routing exerts geographic information to select the next-hop along the route to the destination. Greedy forwarding is a geographic routing mechanism that uses geographical location information of nodes and the distance of each node to the destination, to select next-hop node that achieve the most positive movement to the destination. Where greedy forwarding is not possible, it can be said a void occurred. In this case, if there is no an alternative mechanism, packets are easily removed. Hence a void-handling technique is need to continue routing and recovery greedy forwarding. There is a possibility of void in all types of wireless networks including vehicular ad hoc network (VANET). In this article we introduce void problem and present a survey on varied void-handling techniques which are suitable for VANET networks. At the end, we provide a comparative survey of these techniques based on some important features that are effective on the network performance.