An Efficient Opportunistic Routing Algorithm in Vehicular Adhoc Networks(VANETs)

TLDR: This work suggests a novel OR technique for Vehicular Ad-Hoc Networks (VANets) to overcome the routing problem in VANETs using Dijkstra Algorithm with binary heap for candidate selection and finds that the time complexity of candidate selection is more efficient compared to existing schemes.

Abstract: The Opportunistic Routing (OR) in a dynamic vehicular network increases the wireless network performance. It advantages from the broadcast nature of vehicular nodes to progress performance of the network. The primary responsibility of Opportunistic Routing is its capability to hear the communicated message and to manage among relaying vehicular nodes. In this work, we suggest a novel OR technique for Vehicular Ad-Hoc Networks (VANETs) to overcome the routing problem in VANETs. In this work, we concentrate on our consideration around the incorporation of Vehicular networks and Opportunistic Routing, which is the concept that we call as Vehicular Opportunistic Routing. To deal with the dynamic nature of vehicular node, we have recommended a innovative performance measure which reflects the location of the dynamic vehicular nodes, the link delivery probability(LDP) between the dynamic vehicular nodes, the number of the neighboring vehicular nodes in the highway/intersection, and the predicted current position of the highly dynamic vehicular nodes. We compared our proposed scheme with existing Opportunistic Routing schemes, and verified that our scheme performs better in message/packet delivery ratio (MDR/PDR), end-to-end(E-2-E) latency, and expected number of transmissions(ETX) from the source vehicular node to the destination vehicular node in terms of the Manhattan Grid Mobility Model. In our proposed approach, we have used Dijkstra Algorithm with binary heap for candidate selection. Using this approach, the time complexity of candidate selection is more efficient compared to existing schemes.