A HOP GREEDY METHOD ? A METHOD TO REDUCE DELAY IN VANETS

The Vehicular Ad hoc Networks (VANETs) has been grown over last few years for the method of transforming information over a transport system. VANETs are designed as a mobile ad hoc network where every car acts as a single mobile node, the vehicle nodes communicate without any infrastructure same as in ad hoc network. VANETs are designed to provide road safety to avoid accidents, traffic monitoring and for other commercial applications. However, efficient routing in these networks remains a challenging as increasing density of vehicles over a time, size of VANET and natural disturbances like buildings, trees and signal problem. The major problem in vanet is communication links between vehicles is frequently broken and Routing becomes a major problem. In such scenarios efficient routing plays a important role. With that efficient routing we can provide communication in the network even if the density of the vehicles in the network is low. We propose a hop greedy method to select a routing path with minimum number of intermediate nodes while taking the connectivity into consideration. We also propose a back bone nodes that helps in providing connectivity status with an intersection. The result shows the high packet delivery ratio with a shortest route.