Performance of Maximum Distance on-demand Routing Protocol based on Random Variable Velocity

The application of a Vehicular Ad-Hoc Network at intersections is of great importance in the world, but the great challenge that this network is facing is the changing topology. To solve this problem, several routing protocols have been proposed to guide packets between vehicles until the changing topology is overcome. One of the most important types of protocols is site-based protocol. One of the most important features of this protocol maximum distance on-demand routing algorithm is that it chooses the best path and maximum distance in the direction of the destination vehicle with the least number of hops in order to ensure the transfer of all packages to the destination vehicle and reduce overhead and delays, This work is different from some previous work by making the speed of vehicles varies between (40–120 km/h) and showing the results in terms of end to end delay, communication overhead, packet delivery ratio. Another case has been forced to change the contract locations randomly and show the results E2E delay, packet delivery ratio, communication overhead. Finally, we compare the results of the protocol MDORA for fixed and variable velocity vehicles in terms of the number of dropped packets.