Skip to Main Content
Since mobile device technology has emerged, users expect to experience more convenience and higher safety in Vehicular Ad Hoc Networks (VANETs). VANETs comprise a special subclass of Mobile Ad Hoc Networks (MANETs). The topology frequently changes, encountering frequent disconnection. Hence, designing a feasible routing protocol is challenging. Such protocol is known as vehicle to vehicle (V2V) and vehicle to infrastructure (V2I) for the roadside. One of the hardships with routing protocols in VANET can be local maximum and failure connecting. Among the most common solutions is one that utilizes a Dijkstra algorithm for choosing the shortest path. It is aimed through this study to present a survey of beacon-based geographic routing protocols in VANETs to resolve the routing challenges. This survey was able to generate a classification of the geographic routing protocols and compare expressive examples for each class of protocols.