MTMurilo Táparo
Murilo Táparo
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Murilo Táparo has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Bianca de Almeida Dantas
College of Computing, Federal University of Mato Grosso do Sul, Campo Grande 79070-900, Brazil
2 shared publications - Ricardo Santos
College of Computing, Federal University of Mato Grosso do Sul, Campo Grande 79070-900, Brazil
2 shared publications - Jonatas Galvão
College of Computing, Federal University of Mato Grosso do Sul, Campo Grande 79070-900, Brazil
1 shared publication - Luiz Xavier
College of Computing, Federal University of Mato Grosso do Sul, Campo Grande 79070-900, Brazil
1 shared publication - Paulo Zimpel
College of Computing, Federal University of Mato Grosso do Sul, Campo Grande 79070-900, Brazil
1 shared publication
Latest Publications
- Open Access
Heuristic and Metaheuristic Approaches for the Multi-Node Allocation Problem in Large-Scale IoT Networks
The Multi-Node Allocation (MNA) problem in Internet of Things (IoT) networks arises when application requirements exceed the capacity of a single node, requiring job distribution across multiple devices. This problem is challenging in large-scale heterogeneous environments once it involves optimizing resource utilization, bandwidth consumption, and latency within a rapidly expanding search space. This paper proposes two scalable approaches: a greedy heuristic called Demand Index Multi-Node Allocation (DI-MNA) and a hybrid evolutionary algorithm (NSGA-Hyb) that combines DI-MNA with NSGA-III. Both methods use bounded combinatorial exploration and a normalized demand index to guide the search efficiently. The approaches are evaluated on IoT networks ranging from 10 to 1000 nodes under different workload conditions and compared with an optimal Branch and Bound (B&B) algorithm for small instances. Results show that DI-MNA achieves near-optimal solutions in small networks while maintaining low computational cost as network size grows. In large-scale scenarios, DI-MNA consistently matches or outperforms the evolutionary methods and sustains runtime speedups of up to over NSGA-Hyb and more than over B&B. These findings demonstrate that DI-MNA provides an effective balance between solution quality, scalability, and computational efficiency for resource allocation in large-scale IoT networks.Open AccessHeuristic and Metaheuristic Approaches for the Multi-Node Allocation Problem in Large-Scale IoT Networks
The Multi-Node Allocation (MNA) problem in Internet of Things (IoT) networks arises when application requirements exceed the capacity of a single node, requiring job distribution across multiple devices. This problem is challenging in large-scale heterogeneous environments once it involves optimizing resource utilization, bandwidth consumption, and latency within a rapidly expanding search space. This paper proposes two scalable approaches: a greedy heuristic called Demand Index Multi-Node Allocation (DI-MNA) and a hybrid evolutionary algorithm (NSGA-Hyb) that combines DI-MNA with NSGA-III. Both methods use bounded combinatorial exploration and a normalized demand index to guide the search efficiently. The approaches are evaluated on IoT networks ranging from 10 to 1000 nodes under different workload conditions and compared with an optimal Branch and Bound (B&B) algorithm for small instances. Results show that DI-MNA achieves near-optimal solutions in small networks while maintaining low computational cost as network size grows. In large-scale scenarios, DI-MNA consistently matches or outperforms the evolutionary methods and sustains runtime speedups of up to over NSGA-Hyb and more than over B&B. These findings demonstrate that DI-MNA provides an effective balance between solution quality, scalability, and computational efficiency for resource allocation in large-scale IoT networks. - Open Access
- 14 August 2026
- Published by Springer Nature in Scientific Data
A Comprehensive Dataset for Job Allocation in Internet of Things Networks
- 14 August 2026
- Published by Springer Nature in Scientific Data
Open AccessA Comprehensive Dataset for Job Allocation in Internet of Things Networks