Scalable Back-Bone-Assisted Hop Greedy Routing for VANET's City Environments (SBHG)

Vehicle Area Networks play very crucial role in variety of applications, such as Co-operative driving, Information sharing, other added services like Navigation, internet access etc. A lot more research is required in the optimal routing, sensing the vehicles, safely messages to be broadcasted etc. To reach to the destination flooding like technologies are unreliable in sparse regions so shortest path algorithms has been used such algorithms can cause higher hop count. OnDemand routing protocols are used by mobile nodes in an ad hoc network. It offers quick adaptation to self-motivated link conditions, low processing and Network utilization, memory overhead, and which determines unicast routes to destinations within the ad hoc network. But path generated by these protocols may deviate far from the optimal because mobile nodes and no knowledge of current topology which causes higher hop counts. In this paper we proposed self-healing and optimizing routing techniques for VANETs which improves routing optimality by monitoring routing ways continuously and changes the path which is optimal and causes less hop count.