Abstract: Advancements in wireless technologies have made vehicular ad hoc networks (VANETs) viable for their applications, such as navigation, driver safety, multimedia content sharing, infotainment, etc. distribution of information is constrained by fast movement of nodes and frequent disconnections in VANETs. Currently geographic routing protocols are employed for VANETs and these routing protocols work well as they don’t require route construction and route maintenance phases and reliable delivery is concerned when connectivity is taken as the parameter. To get target vehicle position some of protocols use flooding system which can be harmful in city environments. As the city streets and highly connected road segments have numerous intersections, the geographical routing protocols yield routing paths with higher hop counts. In this paper, a hop greedy routing scheme is introduced that yields a routing path with minimum number of intermediate intersections so as to attain minimum hops to reach out to destination and when connectivity is considered as an issue, backbone node is introduced which tracks the movement of source and destination. As the vehicles are considered the highly mobile nodes, the backbone forwards the packet to a proper forwarding node to destine the data. If it doesn’t find the proper node, it stores the data till a proper forwarding intermediate node is found. Simulation results signify high packet delivery ratio and shorter end-to-end delay.
Keywords: Destination discovery, greedy routing, unicast routing, vehicular ad hoc network (VANET).
Title: BACK BONE ASSISTANCE FOR VANETs USING HOP GREEDY ROUTING
Author: Goutam budha, Ramesh Patil
International Journal of Electrical and Electronics Research
ISSN 2348-6988 (online)
Research Publish Journals
