A graph-based reliable routing scheme for vanets
Vehicular ad hoc networks (VANETs) are a special form of wireless networks made by vehicles communicating among themselves on roads which includes communications among vehicles and between vehicles and road side units. However, due to the high mobility and the frequent changes of the network topology, the communication links are highly vulnerable to disconnection in VANETs. This paper extend the well-known ad hoc on-demand distance vector (AODV) routing protocol with evolving graph theory to propose reliable routing protocol EG-RAODV.