Wireless Link Scheduling with State-Augmented Graph Neural Networks
We consider the problem of optimal link scheduling in large-scale wireless ad hoc networks. We specifically aim for the maximum long-term average performance, subject to a minimum transmission requirement for each link to ensure fairness. With a graph structure utilized to represent the conflicts of links, we formulate a constrained optimization problem to learn the scheduling policy, which is parameterized with a graph neural network (GNN). To address the challenge of long-term performance, we use the state-augmentation technique. In particular, by augmenting the Lagrangian dual variables as dynamic inputs to the scheduling policy, the GNN can be trained to gradually adapt the scheduling decisions to achieve the minimum transmission requirements. We verify the efficacy of our proposed policy through numerical simulations and compare its performance with several baselines in various network settings.
Code (1)
Tasks
FairnessGraph Neural NetworkSchedulingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Fast Graph Kernel Based Classification Method for Wireless Link Scheduling on Riemannian Manifold
In this paper, we propose a novel graph kernel method for the wireless link scheduling problem in device-to-device (D2D) networks on Riemannian manifold. The link scheduling problem can be considered as a binary classifi…
Binary ClassificationSchedulingDistributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)
In wireless networks characterized by dense connectivity, the significant signaling overhead generated by distributed link scheduling algorithms can exacerbate issues like congestion, energy consumption, and radio footpr…
Graph Embedding based Wireless Link Scheduling with Few Training Samples
Link scheduling in device-to-device (D2D) networks is usually formulated as a non-convex combinatorial problem, which is generally NP-hard and difficult to get the optimal solution. Traditional methods to solve this prob…
Graph EmbeddingSchedulingDistributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks
Distributed scheduling algorithms for throughput or utility maximization in dense wireless multi-hop networks can have overwhelmingly high overhead, causing increased congestion, energy consumption, radio footprint, and …
SchedulingDistributed Scheduling using Graph Neural Networks
A fundamental problem in the design of wireless networks is to efficiently schedule transmission in a distributed manner. The main challenge stems from the fact that optimal link scheduling involves solving a maximum wei…
Scheduling