Scalable Back-Bone-Assisted Hop Greedy Routing for VANETS

Abstract: In variety of application such as information sharing, navigation system, internet access vehicular area network plays an important role. To broadcast message safely, optimal routing we need more research. In such a case efficient routing plays an important role .To reach to destination we use shortest path algorithm but it can gives higher hop count. By adding mobile nodes to ad hoc network, it will deviate the path far from optimal path because it has no knowledge current topology which cause higher hop count. In this paper we propose optimize routing technique for VANET which improve routing by continuously monitoring and change the path which causes less hop count.

Keywords: Vehicular ad -hoc network (VANET), optimal path, hop count, ExBAHG.