Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

AVARAC: An Availability-Based Resource Allocation Scheme for Vehicular Cloud

Full text
Author(s):
Meneguette, I, Rodolfo ; Boukerche, Azzedine [1] ; Pimenta, Adinovam H. M. [2]
Total Authors: 3
Affiliation:
[1] Meneguette, Rodolfo, I, Univ Ottawa, Sch Elect Engn & Comp Sci, Ottawa, ON K1N 6N5 - Canada
[2] Univ Fed Sao Carlos, Dept Comp Sci, BR-13565905 Sao Carlos, SP - Brazil
Total Affiliations: 2
Document type: Journal article
Source: IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS; v. 20, n. 10, p. 3688-3699, OCT 2019.
Web of Science Citations: 0
Abstract

Intelligent transportation systems (ITSs) are comprised of multiple technologies that are applied to improve the quality of transport, offering services and applications that will monitor, manage the transportation systems, and increase the level of comfort and safety for passengers and drivers. ITSs services are available for vehicular users through the infrastructure, based on the vehicular network. Furthermore, they can use a vehicular cloud to take advantage of all the resources that a cloud can provide. To achieve this, the ITSs require a mechanism that will aggregate and manage all the available resources provided by the vehicles. Moreover, the aggregation and allocation resource schemes must address the characteristics of the vehicular network to attempt all the quality of service requirements. Therefore, one of the greatest challenges lies in managing the allocation and aggregation of vehicle resources when there is no external infrastructure that will support the system. Hence, we propose an aggregate and allocate resource approach to maximize the availability of service. For this, we formulate the problem through the semi-Markov decision process (SMDP) that will provide an optimal solution for the aggregation and allocation problem. Moreover, we use an average reward function and iterative algorithm to solve the SMDP. The results show that the proposed approach showed stable behavior regardless of the frequency of receiving requests for service. Furthermore, the proposed solution has high average reward when compared to other work in the paper. (AU)

FAPESP's process: 15/18898-9 - Cloud services for Vehicular Networks Assistance in Intelligent Transport Management of Big Cities
Grantee:Rodolfo Ipolito Meneguette
Support type: Scholarships abroad - Research
FAPESP's process: 15/11536-4 - A framework for vehicular networks aid in the big cities management
Grantee:Rodolfo Ipolito Meneguette
Support type: Regular Research Grants