A GNN that sets per-link contention thresholds can reduce scheduling overhead in dense wireless networks while preserving total utility, across four distributed schedulers.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)
A GNN that sets per-link contention thresholds can reduce scheduling overhead in dense wireless networks while preserving total utility, across four distributed schedulers.