Emerson de O. Antunes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Emerson de O. Antunes has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Aleteia Araujo
University of Brasilia (UnB)
1 shared publication - Geraldo Pereira Rocha Filho
University of Brasilia
1 shared publication - Lucas Bondan
Institute of Informatics - Federal University of Rio Grande do Sul, Av. Bento Gonçalves, 9500 - Porto Alegre, Brazil
1 shared publication - Marcelo Antonio Marotta
Universidade de Brasília
1 shared publication - Marcos Fagundes Caetano
Department of Computer Sciences, University of Brasilia, Campus Darcy Ribeiro, Asa Norte Braslia - DF, Brasilia, BR
1 shared publication - Rodolfo Ipolito Meneguette
Institute of Mathematical and Computer Sciences, University of São Paulo (USP), São Carlos, Brazil
1 shared publication
Latest Publications
- 17 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 19 (3) , 3645-3656
Optimized Solutions for Deploying a Militarized 4G/LTE Network With Maximum Coverage and Minimum Interference
This work proposes to solve the maximal covering location problem of the Mobile Operations Coordination Center (CCOp Mv), which aims to support the operational command of the Brazilian Army. This problem consists of selecting, in a limited region and with poor communication infrastructure to the ground troops’s operating area, the positions of vehicles equipped with Base Transceiver Station (BTS), the amount needed, and theirs transmission power to be set that maximizes the coverage area and reduce the interference due to the overlap of signals. For this reason, analytical modeling based on the mixed-integer linear problem was proposed that guided two optimization solutions: (i) E-ALLOCATOR – Exact ALLOCATiOn seRvice; and (ii) M-ALLOCATOR – Metaheuristic ALLOCATiOn seRvice. The solutions were evaluated in a scenario that employs CCOp Mv to support a rescue operation based on the tragedy in January 2019 in Brumadinho-MG and compared with a heuristic. The performance evaluation results show evidence of efficiencies in terms of quality and resource savings of the proposed solutions. Furthermore, E-ALLOCATOR has been proven to be suitable for a low workload on the network. At the same time, M-ALLOCATOR is suitable for scenarios with a high workload providing almost optimal solutions within the adequate computational time for all problem instances.
- 17 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 19 (3) , 3645-3656
Optimized Solutions for Deploying a Militarized 4G/LTE Network With Maximum Coverage and Minimum Interference
This work proposes to solve the maximal covering location problem of the Mobile Operations Coordination Center (CCOp Mv), which aims to support the operational command of the Brazilian Army. This problem consists of selecting, in a limited region and with poor communication infrastructure to the ground troops’s operating area, the positions of vehicles equipped with Base Transceiver Station (BTS), the amount needed, and theirs transmission power to be set that maximizes the coverage area and reduce the interference due to the overlap of signals. For this reason, analytical modeling based on the mixed-integer linear problem was proposed that guided two optimization solutions: (i) E-ALLOCATOR – Exact ALLOCATiOn seRvice; and (ii) M-ALLOCATOR – Metaheuristic ALLOCATiOn seRvice. The solutions were evaluated in a scenario that employs CCOp Mv to support a rescue operation based on the tragedy in January 2019 in Brumadinho-MG and compared with a heuristic. The performance evaluation results show evidence of efficiencies in terms of quality and resource savings of the proposed solutions. Furthermore, E-ALLOCATOR has been proven to be suitable for a low workload on the network. At the same time, M-ALLOCATOR is suitable for scenarios with a high workload providing almost optimal solutions within the adequate computational time for all problem instances.