Abstract
VANET (Vehicular Ad-hoc Network) is an emerging offshoot of MANETs (Mobile Ad-hoc Networks) with highly mobile nodes. It is envisioned to play a vital role in providing safety communications and commercial applications to the on-road public. Establishing an optimal route for vehicles to send packets to their respective destinations in VANETs is challenging because of quick speed of vehicles, dynamic nature of the network, and intermittent connectivity among nodes. This paper presents a novel position based routing technique called Dynamic Multiple Junction Selection based Routing (DMJSR) for the city environment. The novelty of DMJSR as compared to existing approaches comes from its novel dynamic multiple junction selection mechanism and an improved greedy forwarding mechanism based on one-hop neighbors between the junctions. To the best of our knowledge, it is the first ever attempt to study the impact of multiple junction selection mechanism on routing in VANETs. We present a detailed depiction of our protocol and the improvements it brings as compared to existing routing strategies. The simulation study exhibits that our proposed protocol outperforms the existing protocols like Geographic Source Routing Protocol (GSR), Enhanced Greedy Traffic Aware Routing Protocol (E-GyTAR) and Traffic Flow Oriented Routing Protocol (TFOR) in terms of packet delivery ratio, end-to-end delay, and routing overhead.
Highlights
The emerging Vehicular Ad-hoc Networks (VANETs) is getting a spotlight from entities like academicians, research institutes, and industries because it is envisioned to play a very important role for the future transportation system
Traffic Flow Oriented Routing Protocol (TFOR) [3] is a recently proposed technique which consists of two modules: (a) A junction selection mechanism based on traffic flows and the shortest routing path and (b) A forwarding strategy based on two-hop neighbor information
We propose a novel routing strategy called dynamic multiple junction selection based routing mechanism, which selects multiple junctions based on shortest path and traffic density for tackling aforementioned like scenarios
Summary
The emerging Vehicular Ad-hoc Networks (VANETs) is getting a spotlight from entities like academicians, research institutes, and industries because it is envisioned to play a very important role for the future transportation system. To the best of our knowledge, a protocol that is capable of establishing dynamic optimal routing path by considering multiple junctions/streets from source to destination based on shortest path and connectivity is missing in the existing literature. It makes use of GPS and digital maps for getting the vehicle current location and the road information respectively It considers multiple-neighbor junctions while making routing decisions which maximizes connectivity and enhances networks performance as compared to existing approaches. It is novel in its mechanisms as it combines multi-junction selection mechanism with position and direction based forwarding mechanism for forwarding of packets between the selected junctions.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
