MOVE Mobility Model in GreedLea Routing Protocol for Internet of Vehicle (IoV) Network

Abstract

Abstract Internet of Vehicles (IoV) is a broad variety of mobile transmission purposes for file sharing [l]-[5]. There are still debates on the viability of purposes using end to end multi-hop communication, since the significant number of high mobility nodes involved in the networks. The main issue is the efficiency of IoV routing protocols in cities and highways can meet the ideal delay and throughput for such purposes. In particular, it is not usually a challenge to locate a node to hold a message in urban daytime situations, where vehicles are tightly packed. Since fewer number of vehicles are running in highway scenarios and cities at night, and it might not be possible to set up end-to-end roads. In general, each protocol offered a performance evaluation in contradiction of some other protocols, giving considerable importance to a detailed performance evaluation of each protocol type. After such an assessment, it was found that geocast routing would perform best in urban areas. GreedLea routing protocol is develop to overcome the current routing protocol drawback. The development of GreedLea routing protocol involved Greedy Perimeter Stateless Routing (GPSR) and reinforcement learning method in order to deliver better performance compared to current existing routing protocol. Urban environments without obstacles has been simulated using actual maps for example intersection density. In order to measure efficiency, the metrics are: average delivery rate, average delay, average length of path and overhead. From the analysis, it shows that GreedLea offers better performance compared to GPSR for both city and highway scenario. The first section in your paper