Sk-Iterative: A Greedy Scheduling Algorithm with Spatial Reuse for Dense Wireless Networks
Chrystopher N. Bravos1, Elias Procópio Duarte Jr.1, Fábio Engel de Camargo2 and Flávio Assis3
1 Federal University of Paraná (UFPR), Curitiba, Paraná, Brazil (Emails: , )
2 Federal University of Technology – Paraná (UTFPR), Toledo, Paraná, Brazil (Email: )
3 Universidade Federal da Bahia (UFBA), School of Computing, Salvador, Bahia, Brazil (Email: )
DOI: https://doi.org/10.48545/advance2026-fullpapers-4_1
Abstract
The density of wireless networks has been consistently increasing. Dealing with an increasing number of devices per area unit is a pressing issue in the context of the Internet of Things (IoT), as well as in cellular networks (5G and B5G). The Signal-to-Interferenceplus-Noise Ratio (SINR) model is particularly relevant in this context, as it facilitates spatial reuse, which allows multiple devices to transmit simultaneously within the same coverage area. This model considers the cumulative interference from competing transmissions, enabling scheduling that maximizes simultaneous communications. Given that the scheduling problem in SINR networks is NP-hard, heuristics are necessary for practical solutions. This work introduces Sk-Iterative, a greedy scheduling algorithm with spatial reuse to solve the problem. The algorithm schedules links produced with the DTE (Down-To-Earth) heuristics. Sk-Iterative was implemented and evaluated via simulation. Results confirm the efficiency of the scheduling strategy, showing that it produces schedules that are close to the optimal.
Keywords
Wireless Networks, Spatial Reuse, Link Scheduling, Greedy Heuristics, Dense Wireless Networks