Speed and Position Aware Dynamic Routing for Emergency Message Dissemination in VANETs


By exchanging pre-planned Emergency Messages (EMs) between moving vehicles, Vehicular Ad hoc Networks, also known as VANETs, can make roads safer and reduce the number of accidents caused by moving vehicles. It can be difficult to transmit EMs in a reliable manner and at a high speed over VANETs because of the high-speed mobility of VANETs and the attenuation of the wireless signal. For example, the vehicle that was chosen to serve as the next hop may have moved out of the area where the message was sent before it was delivered, and rerouting may lengthen the delay when electronic messages (EMs) experience problems with transmission. In order to accomplish this, we suggest a Speed and Position aware Dynamic Routing, or SPDR, for the dissemination of EM in VANETs. First, we implement a speed-metric dynamic greedy routing in order to provide a dynamic hop-by-hop rebroadcast of the EM. This routing is greedy because it prioritizes speed over efficiency. SPDR dynamically reduces the range of the Routing Decision Area (RDA) based on the velocity variance of candidate neighbors. It then gives priority to the vehicle that is the furthest away from the reduced RDA as the optimal next-hop in order to improve the reliable transmission of EMs. Then, we present a collaborative forwarding strategy in order to make it possible for candidate neighbors to communicate with one another jointly. In the event that the transmission fails, SPDR will select the candidate vehicle that is located closest to the destination to act as the forwarder. This helps to minimize the need for rerouting. SPDR outperforms the existing protocols in terms of message delivery ratio, network throughput, and average dissemination delay, according to simulations conducted using NS-2 and VanetMobiSim in a realistic motorway scenario.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Unsupervised Spectral Feature Selection with Dynamic Hyper-graph Learning ABSTRACT: In order to produce interpretable and discriminative results from unsupervised spectral feature selection (USFS) methods, an embedding
PROJECT TITLE : GloDyNE: Global Topology Preserving Dynamic Network Embedding ABSTRACT: Due to the time-evolving nature of many real-world networks, learning low-dimensional topological representations of networks in dynamic environments
PROJECT TITLE : Fully Dynamic kk-Center Clustering With Improved Memory Efficiency ABSTRACT: Any machine learning library worth its salt will include both static and dynamic clustering algorithms as core components. The sliding
PROJECT TITLE : Exploring Temporal Information for Dynamic Network Embedding ABSTRACT: The task of analyzing complex networks is a challenging one that is attracting an increasing amount of attention. One way to make the analysis
PROJECT TITLE : MAGNETIC: Multi-Agent Machine Learning-Based Approach for Energy Efficient Dynamic Consolidation in Data Centers ABSTRACT: Two of the most significant challenges for effective resource management in large-scale

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry