z-logo
open-access-imgOpen Access
Quality of Service Aware Routing Protocol in Software-Defined Internet of Vehicles
Author(s) -
Kayhan Zrar Ghafoor,
Linghe Kong,
Danda B. Rawat,
Eghbal Hosseini,
Ali Safaa Sadiq
Publication year - 2018
Publication title -
ieee internet of things journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.075
H-Index - 97
eISSN - 2372-2541
pISSN - 2327-4662
DOI - 10.1109/jiot.2018.2875482
Subject(s) - computer science , link state routing protocol , computer network , equal cost multi path routing , dynamic source routing , routing protocol , static routing , routing (electronic design automation) , metric (unit) , the internet , quality of service , distributed computing , engineering , operations management , world wide web
Software Defined Internet of Vehicles (SDIoV) has emerged as a promising field of study as it could overcome the shortcomings of traditional vehicular networks, such as offering efficient data transmission and traffic shaping in different vehicular scenarios to satisfy all the requirements of applications on the fly. Although routing solutions are lightly addressed for SDIoV, there are many limitations of routing protocols unaddressed in such environment. More precisely, shortest path routing algorithms are mostly focused in the state of the arts. This paper presents quality of service aware routing algorithm (QRA) that forwards packets toward the most reliable and connected path to the destination. Particularly, candidate routes should satisfy metrics such as Signal to Interference and Noise Ratio (SINR) constraint and have the highest probability of connectivity. To address these issues, we have formulated a discrete optimization problem to favor the best route among candidate paths and proposed the modified Laying Chicken Algorithm (LCA) that results better results than the traditional approaches. We have mathematically analyzed the probability of connectivity along with the SINR metric. Moreover, a multi-score function based on traffic density and greediness factor is proposed to make intelligent decision at the intersections. Simulation results are used to validate the superiority of the proposed routing approach over the the existing solutions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom