Link Scheduling Using Graph Neural Networks
IEEE Transactions on Wireless Communications · 2023-06 · 22 (6) · 3997-4012
DOI: 10.1109/twc.2022.3222781 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Wireless Communications, 2023-06. Verfasst von Zhongyuan Zhao und 4 weiteren Autor:innen. Die Arbeit wurde bisher 50-mal zitiert (Crossref) und nennt 77 Literaturangaben. Gefördert von: Army Research Office and Accomplished under Cooperative Agreement.
Abstract (Originalsprache)
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 networks (GCNs) that can be implemented in centralized and distributed manners. Our centralized heuristic is based on tree search guided by a GCN and 1-step rollout. In our distributed MWIS solver, a GCN generates topology-aware node embeddings that are combined with per-link utilities before invoking a distributed greedy solver. Moreover, a novel reinforcement learning scheme is developed to train the GCN in a non-differentiable pipeline. Test results on medium-sized wireless networks show that our centralized heuristic can reach a near-optimal solution quickly, and our distributed heuristic based on a shallow GCN can reduce by nearly half the suboptimality gap of the distributed greedy solver with minimal increase in complexity. The proposed schedulers also exhibit good generalizability across graph and weight distributions.
Förderung
- Army Research Office and Accomplished under Cooperative Agreement
Zitieren
APA
Zhao, Z., Verma, G., Rao, C., Swami, A., & Segarra, S. (2023). Link Scheduling Using Graph Neural Networks. IEEE Transactions on Wireless Communications, 22(6), 3997-4012. https://doi.org/10.1109/twc.2022.3222781
Vancouver
Zhao Z, Verma G, Rao C, Swami A, Segarra S. Link Scheduling Using Graph Neural Networks. IEEE Transactions on Wireless Communications. 2023;22(6):3997-4012. doi:10.1109/twc.2022.3222781
BibTeX
@article{Zhao2023,
author = {Zhao, Zhongyuan and Verma, Gunjan and Rao, Chirag and Swami, Ananthram and Segarra, Santiago},
title = {Link Scheduling Using Graph Neural Networks},
journal = {IEEE Transactions on Wireless Communications},
year = {2023},
volume = {22},
number = {6},
pages = {3997--4012},
doi = {10.1109/twc.2022.3222781}
}
EUVIMED