Next Article in Journal
Development of Semantic Web-Enabled BDI Multi-Agent Systems Using SEA_ML: An Electronic Bartering Case Study
Next Article in Special Issue
Accurate and Detailed Transversal Road Section Characteristics Extraction Using Laser Scanner
Previous Article in Journal
Active Noise Control Using Modified FsLMS and Hybrid PSOFF Algorithm
Previous Article in Special Issue
A Multiple-Model Particle Filter Fusion Algorithm for GNSS/DR Slide Error Detection and Compensation
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessArticle

Dynamic Multiple Junction Selection Based Routing Protocol for VANETs in City Environment

1
Department of Computer Systems and Communication Technologies, Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak (UNIMAS), Kota Samarahan 94300, Malaysia
2
Department of Computer Science, Faculty of Science and Arts at Balgarn, University of Bisha, P.O. Box 60, Sabt Al-Alaya 61985, Saudi Arabia
3
Department of Computer Science, Al Jouf University, Tabarjal 74331, Saudi Arabia
*
Author to whom correspondence should be addressed.
Appl. Sci. 2018, 8(5), 687; https://doi.org/10.3390/app8050687
Received: 23 January 2018 / Revised: 14 February 2018 / Accepted: 16 February 2018 / Published: 28 April 2018
  |  
PDF [1576 KB, uploaded 3 May 2018]
  |  

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. View Full-Text
Keywords: intelligent transportation; multiple junctions; position based routing; optimal route intelligent transportation; multiple junctions; position based routing; optimal route
Figures

Graphical abstract

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed
Printed Edition Available!
A printed edition of this Special Issue is available here.

Share & Cite This Article

MDPI and ACS Style

Abbasi, I.A.; Khan, A.S.; Ali, S. Dynamic Multiple Junction Selection Based Routing Protocol for VANETs in City Environment. Appl. Sci. 2018, 8, 687.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Appl. Sci. EISSN 2076-3417 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top