| Texto completo | |
| Autor(es): |
Silva, Cristiano M.
[1]
;
de Souza, Fernanda S. H.
[2]
;
Pitsillides, Andreas
[3]
;
Guidoni, Daniel L.
[2]
Número total de Autores: 4
|
| Afiliação do(s) autor(es): | [1] Univ Fed Sao Joao del Rei, Dept Technol, Ouro Branco - Brazil
[2] Univ Fed Sao Joao del Rei, Dept Comp Sci, Sao Joao Del Rei - Brazil
[3] Univ Cyprus, Dept Comp Sci, Nicosia - Cyprus
Número total de Afiliações: 3
|
| Tipo de documento: | Artigo Científico |
| Fonte: | Journal of Network and Systems Management; v. 29, n. 3 JUL 2021. |
| Citações Web of Science: | 0 |
| Resumo | |
The future of mobility involves the interconnection of the entities of the transportation system (vehicles, roads, traffic lights, pedestrians) in high speed networks providing real-time information to drivers, entertainment for passengers, and a wide variety of applications and systems dedicated to smart transportation. Furthermore, in a few years, autonomous vehicles are going to massively reach the streets, and their interconnection may drastically improve the urban mobility by reducing the travel time and the number of accidents. In this work, we consider the design and management of the network infrastructure for vehicular communication focusing on streaming delivery. We intend to allow a given share of vehicles driving along the road network permanently playing streams received from the network infrastructure, and our main question is where we must provide coverage for achieving a given share of vehicles receiving the media. As parameters, we consider the download data rate that vehicles receive content from the infrastructure, and data consumption rate inside vehicles. An Integer Linear Program formulation along with a tabu search-based heuristic are presented. We consider as baseline the intuitive deployment strategy of covering the most popular locations of the road network. All strategies are evaluated considering a realistic vehicular mobility trace composed of 75, 515 vehicles. Results indicate that the tabu search heuristic is able to solve a large instance composed of 75, 515 vehicles requiring less covered area than greedy heuristics. Considering the optimal solution, we investigate the solutions on a reduced subset composed of 100 vehicle trips and, considering this reduced scenario, the tabu search heuristic is able to find the optimal solution. (AU) | |
| Processo FAPESP: | 20/05126-6 - Algoritmos e protocolos de comunicação para sistemas de transportes inteligentes |
| Beneficiário: | Daniel Ludovico Guidoni |
| Modalidade de apoio: | Auxílio à Pesquisa - Regular |