Paper Title
Distance Based Greedy Routing In Vanet

Vehicular ad hoc networks (VANETs) have become viable and valuable for their wide variety of novel applications, such as safety of road, content sharing of multimedia, commerce on wheels, etc, using advanced wireless technologies. Distribution of multi-hop information in VANETs is constrained by the high mobility of vehicles and the frequent disconnections. Geographic routing do not require route maintenance and route construction phases hence they are widely adopted for VANETs. With connectivity awareness, they perform well in terms of reliable delivery. Flooding is use in some protocols to obtain destination position. Further in case of regions like sparse and void regions, upraise hop count by frequent use of the recovery strategy. Some geographic routing protocols adopt the minimum weighted algorithm depending on distance or connectivity to select intermediate intersections. However, the path with higher connectivity or the shortest path may include numerous intermediate intersections. Therefore, these protocols yield routing paths with higher hop count. In this paper, we propose a distance based greedy routing and hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersection nodes while taking connectivity into consideration. Moreover, back-bone nodes are introduced that play a key role in providing connectivity status around an intersection. Also the back-bone nodes allow packet to be forwarded in the changed direction by tracking the movement of source as well as destination. Distance based greedy routing overcomes the limitations of a Hop Greedy Routing algorithms. In this paper we have considered design and implementation of routing algorithms that will provide maximum packet delivery ratio and minimum end to end delay.