Link Scheduling using Graph Neural Networks. (arXiv:2109.05536v3 [eess.SP] UPDATED)

Efficient scheduling of transmissions is a key problem in wireless networks.
The main challenge stems from the fact that optimal link scheduling involves
solving a maximum weighted independent set (MWIS) problem, which is known to be
NP-hard. In practical schedulers, centralized and distributed greedy heuristics
are commonly used to approximately solve the MWIS problem. However, most of
these greedy heuristics ignore important topological information of the
wireless network. To overcome this limitation, we propose fast heuristics based
on graph convolutional …

arxiv graph graph neural networks networks neural networks scheduling