Delay and hop sensitive routing protocol for vehicular ad hoc networks

Abstract

In today's world the number of vehicles is increasing day by day because of which there is lot of congestion on roads. As well as number of packets flowing through a VANET networks are increasing. There are lot of algorithms in the literature namely Shortest Path Tree and Minimum Spanning Tree which provides a series of steps which can improve the packet delivery ratio. However the algorithms suffer from complexity, delay and hops. Relay node is responsible for communication between vehicles on 2 different locations/roads. The selection of relay nodes will make use of Expected Transmission which is a time consuming process. Hence an algorithm is needed which can deliver the packets faster towards the destination before the vehicles switches to a different location. In this work we make use of DHSP algorithm which performs the route discovery based on directional mapping of destination node which increases the accuracy and reduces the delay. MATLAB simulations of proposed routing algorithm have been performed to obtain the simulation results. The simulation results show that our proposed protocol decreases Parameters such as End to End Delay, Number of Hops, Energy Consumption, and Routing Overhead increases the throughput are measured for shortest path tree (SPT), Minimum spanning tree (MST) and it is proved that proposed algorithm is the best.