Efficient routing algorithm for VANETs based on distance factor

There has been a great deal of research into the considerable challenge of managing of traffic at road junctions; its application to vehicular ad hoc network (VANET) has proved to be of great interest in the developed world. Dynamic topology is one of the vital challenges facing VANET; as a result, routing of packets to their destination successfully and efficiently is a non-simplistic undertaking. This paper presents a MDORA, an efficient and uncomplicated algorithm enabling intelligent wireless vehicular communications. MDORA is a robust routing algorithm that facilitates reliable routing through communication between vehicles. As a position-based routing technique, the MDORA algorithm, vehicles' precise locations are used to establish the optimal route by which the vehicles may reach their desired destinations. By determining the route containing the maximum distance with the minimum number of hops, MDORA minimizes the control overhead. The final aspect of the paper is to compare gains of MDORA with those of existing protocols such as AODV, GPSR-L and HLAR in terms of throughput, packet delivery ratio and average delay. From the analysis, it will be evident that the performance of MDORA is far better than the other protocols.

[1]  Imad Mahgoub,et al.  A Survey of Vehicular Ad hoc Networks Routing Protocols , 2013 .

[2]  M. Ramakrishna DBR-LS: Distance based routing protocol using location service for VANETs , 2011, 2011 Annual IEEE India Conference.

[3]  Martin Mauve,et al.  A routing strategy for vehicular ad hoc networks in city environments , 2003, IEEE IV2003 Intelligent Vehicles Symposium. Proceedings (Cat. No.03TH8683).

[4]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[5]  Xianghan Zheng,et al.  Distributed multi-hop clustering algorithm for VANETs based on neighborhood follow , 2015, EURASIP J. Wirel. Commun. Netw..

[6]  Ainuddin Wahid Abdul Wahab,et al.  Low communication cost (LCC) scheme for localizing mobile wireless sensor networks , 2017, Wirel. Networks.

[7]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[8]  Ainuddin Wahid Abdul Wahab,et al.  WDARS: A Weighted Data Aggregation Routing Strategy with Minimum Link Cost in Event-Driven WSNs , 2016, J. Sensors.

[9]  Ram Shringar Raw,et al.  B-MFR routing protocol for vehicular ad hoc networks , 2010, 2010 International Conference on Networking and Information Technology.

[10]  Jing Zhao,et al.  VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks , 2008, IEEE Trans. Veh. Technol..

[11]  M. Boussedjra,et al.  GPSR-L: Greedy perimeter stateless routing with lifetime for VANETS , 2008, 2008 8th International Conference on ITS Telecommunications.

[12]  Mo Li,et al.  A Survey on Topology Control in Wireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues , 2013, Proc. IEEE.

[13]  Agathoniki Trigoni,et al.  Delay-bounded routing in vehicular ad-hoc networks , 2008, MobiHoc '08.

[14]  Robert Malaney,et al.  A New Hybrid Location-Based Ad Hoc Routing Protocol , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[15]  Ainuddin Wahid Abdul Wahab,et al.  A comparison study on node clustering techniques used in target tracking WSNs for efficient data aggregation , 2016, Wirel. Commun. Mob. Comput..

[16]  Martin Mauve,et al.  Geographic routing in city scenarios , 2005, MOCO.

[17]  Mahamod Ismail,et al.  Vehicular communication ad hoc routing protocols: A survey , 2014, J. Netw. Comput. Appl..

[18]  Syed Adeel Ali Shah,et al.  Unicast routing protocols for urban vehicular networks: review, taxonomy, and open research issues , 2014, Journal of Zhejiang University SCIENCE C.

[19]  John Lee,et al.  A survey and challenges in routing and data dissemination in vehicular ad-hoc networks , 2008, ICVES.

[20]  Mohammad Reza Jabbarpour,et al.  Dynamic Congestion Control Algorithm for Vehicular Ad hoc Networks , 2015 .