Performance of Modified Potential Edge Node Based Greedy Routing Algorithm in VANET Using Real City Scenario

Ravi Shukla


In today’s world, VANET (Vehicular Adhoc Network) plays a very important role and used for public safety communications and commercial applications. The most challenging task for VANET is Routing Algorithm due to rapidly changing topology and high speed mobility of vehicles. In this paper, we study the performance of modified Edge Node Based Greedy Routing Algorithm. In this algorithm, we set RSU’s to provide better communication and improving performance of the movement of the vehicles and packet forwarding. The RSU at different Transmission Range are able to communicate with other RSUs and vehicles.  The simulation results show that routing overhead and end-to-end delay is reduced compare to the Greedy Perimeter Stateless Routing (GPSR) and Predictive DirectionalGreedy Routing (PDGR) and EBGR in Vehicular Adhoc Network.


Vehicular Ad hoc Networks, Routing Algorithms, modified EBGR.

Full Text:



  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

AMEA©: World Science Publisher United States