Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm

EURASIP Journal on Wireless Communications and Networking, Nov 2016

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-hop basis based on the maximum distance toward the destination from the sender and sufficient communication lifetime, which guarantee the completion of the data transmission process. Moreover, communication overhead is minimized by finding the next hop and forwarding the packet directly to it without the need to discover the whole route first. A comparison is performed between MDORA and ad hoc on-demand distance vector (AODV) protocol in terms of throughput, packet delivery ratio, delay, and communication overhead. The outcome of the proposed algorithm is better than that of AODV.

A PDF file should load here. If you do not see its contents the file may be temporarily unavailable at the journal website or you do not have a PDF plug-in installed and enabled in your browser.

Alternatively, you can download the file locally and open with any standalone PDF reader:

https://link.springer.com/content/pdf/10.1186%2Fs13638-016-0760-8.pdf

Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm

Al-Mayouf et al. EURASIP Journal on Wireless Communications and Networking Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm Yusor Rafid Bahar Al-Mayouf 0 Nor Fadzilah Abdullah 0 Mahamod Ismail 0 Salih M. Al-Qaraawi 2 Omar Adil Mahdi 1 Suleman Khan 1 0 Department of Electrical, Electronic and Systems Engineering, Faculty of Engineering and Built Environment, Universiti Kebangsaan Malaysia , 43600 Bangi, Selangor , Malaysia 1 Department of Computer System and Technology, Faculty of Computer Science and Information Technology Building, University of Malaya , 50603 Kuala Lumpur , Malaysia 2 Department of Computer Engineering, University of Technology , Baghdad , Iraq Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-hop basis based on the maximum distance toward the destination from the sender and sufficient communication lifetime, which guarantee the completion of the data transmission process. Moreover, communication overhead is minimized by finding the next hop and forwarding the packet directly to it without the need to discover the whole route first. A comparison is performed between MDORA and ad hoc on-demand distance vector (AODV) protocol in terms of throughput, packet delivery ratio, delay, and communication overhead. The outcome of the proposed algorithm is better than that of AODV. Traffic management; VANETs; Mobility; Routing; Communication overhead 1 Introduction With the evolution of the Internet of things (IoTs), the vehicular ad hoc network (VANET) has been considered a crucial topic of research in the area of intelligent transportation systems (ITSs) [1]. ITSs inform drivers about unfavorable and dangerous road conditions such as weather situation, accidents, work zones, and emergencies (e.g., bushfire, flood) to improve road safety and traffic management and to provide value-added services while on the road [2, 3]. Proper information delivery needs an appropriate routing mechanism. The routing needs to route precise and updated information about traffic mobility (e.g., number of vehicles on the road and their directions and velocities). The collection and provision of this information can be done through VANETs by using two kinds of communication technologies, namely vehicle-tovehicle (V2V) and vehicle-to-infrastructure (V2I) [4, 5]. By delivering this information timely, better decisions can be made by drivers and accidents can be avoided. However, traditional wireless technologies cannot be directly applied to VANETs because of several inherent features like high mobility, restriction of road setup, frequent topology variations, enough energy storage, failed network links, and timely data communication, which pose a major challenge in the routing of information [6–10]. To fulfill all the aforementioned communication requirements, an efficient routing protocol is required for conducting productive inter-vehicular communication. For decades, several routing protocols have been proposed for vehicular networks [11–13]. The design of these protocols mainly focuses on the optimal route (shortest) with minimum hop count. For V2V, outstanding performance results have been exhibited by position-based routing as the routes between the source and the destination do not need to be established and saved, which satisfies the © The Author(s). 2016 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. condition of dynamic changes in VANETs [14, 15]. Furthermore, in comparison to other types of routing protocols, such protocols support scalable networks with reduced control message overhead [16]. Finally, they are simple because they apply the global positioning system (GPS) technology to determine the exact positions of a vehicle with respect to its longitude and latitude [17]. Therefore, a position-based routing protocol is considered the best choice for this work. Some protocols [18, 19] face problems with conflicting no (...truncated)


This is a preview of a remote PDF: https://link.springer.com/content/pdf/10.1186%2Fs13638-016-0760-8.pdf

Yusor Rafid Bahar Al-Mayouf, Nor Fadzilah Abdullah, Mahamod Ismail, Salih M. Al-Qaraawi, Omar Adil Mahdi, Suleman Khan. Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm, EURASIP Journal on Wireless Communications and Networking, 2016, pp. 265, Volume 2016, Issue 1, DOI: 10.1186/s13638-016-0760-8