Special Issue Article
Back-Bone Assisted Hop Greedy Routing in Vanets
|Related article at Pubmed, Scholar Google|
Vehicular ad hoc networks have been used in wide variety of novel applications such as road safety, multimedia content sharing and commerce on wheels in wireless local area network technologies. Due to the high mobility of vehicles and frequent disconnections, multi hop information dissemination is limited. Currently geographic routing protocols are used for Vehicular ad hoc networks .They do not require route construction and route maintenance phases. Flooding protocol is used to obtain destination position which is reduced in city Environments. In the case of sparse and void regions, there exists a connectivity problem which increases the hop count. Geographic routing protocols use the minimum weighted algorithm to select intermediate intersections. This may lead to numerous intermediate intersections which results in routing paths with higher hop count. In this paper, they propose a hop greedy routing scheme that yields a routing path with the minimum number of intermediate intersections. Back bone nodes play a key role in providing connectivity. It tracks the movement of source as well as the destination and sends the packets to be forwarded in the changed direction. Simulation results signify the benefits of hop greedy algorithm in terms of high packet delivery ratio and shorter end-end delay.