Home > Research > Publications & Outputs > Situation-aware QoS routing algorithm for vehic...

Electronic data

  • TVT

    Rights statement: CC-BY

    Accepted author manuscript, 601 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License


Text available via DOI:

View graph of relations

Situation-aware QoS routing algorithm for vehicular ad hoc networks

Research output: Contribution to Journal/MagazineJournal articlepeer-review

  • Mahmoud Hashem Eiza
  • Thomas Owens
  • Qiang Ni
  • Qi Shi
<mark>Journal publication date</mark>12/2015
<mark>Journal</mark>IEEE Transactions on Vehicular Technology
Issue number12
Number of pages16
Pages (from-to)5520-5535
Publication StatusPublished
Early online date1/10/15
<mark>Original language</mark>English


A wide range of services has been developed for Vehicular Ad hoc Networks (VANETs) ranging from safety to infotainment applications. An essential requirement for such services is that they are offered with Quality of Service (QoS) guarantees in terms of service reliability and availability. Searching for feasible routes subject to multiple QoS constraints is in general an NP-hard problem. Besides, routing reliability needs to be paid special attention as communication links frequently break in VANETs. In this paper, we propose employing the Situational Awareness (SA) concept and an Ant Colony System (ACS) based algorithm to develop a Situation- Aware Multi-constrained QoS (SAMQ) routing algorithm for VANETs. SAMQ aims to compute feasible routes between the communicating vehicles subject to multiple QoS constraints and pick the best computed route, if such a route exists. To mitigate the risks inherited from selecting the best computed route that may turn out to fail at any moment, SAMQ utilises the SA levels and ACS mechanisms to prepare certain countermeasures with the aim of assuring a reliable data transmission. Simulation results demonstrate that SAMQ is capable of achieving a reliable data transmission as compared to the existing QoS routing algorithms even when the network topology is highly dynamic.

Bibliographic note

©2015 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.