Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/11457
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEiza, MH-
dc.contributor.authorOwens, TJ-
dc.contributor.authorNi, Q-
dc.contributor.authorShi, Q-
dc.date.accessioned2015-10-08T12:59:10Z-
dc.date.available2015-10-01-
dc.date.available2015-10-08T12:59:10Z-
dc.date.issued2015-
dc.identifier.citationIEEE Transactions on Vehicular Technology, 64(12): pp. 5520 - 5535, (2015)en_US
dc.identifier.issn0018-9545-
dc.identifier.urihttp://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7286854-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/11457-
dc.description.abstractA 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.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.en_US
dc.format.extent? - ? (16)-
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectAnt Colony System (ACS)en_US
dc.subjectQoS Routingen_US
dc.subjectSituational awarenessen_US
dc.subjectVANETsen_US
dc.subjectVehicular Networksen_US
dc.titleSituation-aware QoS routing algorithm for vehicular Ad hoc networksen_US
dc.typeArticleen_US
dc.identifier.doihttp://dx.doi.org/10.1109/TVT.2015.2485305-
dc.relation.isPartOfVehicular Technology, IEEE Transactions on-
pubs.issue99-
pubs.publication-statusPublished-
pubs.publication-statusPublished-
Appears in Collections:Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf1.79 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.