Skip to content

Latest commit

 

History

History
60 lines (40 loc) · 4.07 KB

README.md

File metadata and controls

60 lines (40 loc) · 4.07 KB
Raw

Link Scheduling using Graph Neural Networks

Z. Zhao, G. Verma, C. Rao, A. Swami and S. Segarra, "Link Scheduling Using Graph Neural Networks," in IEEE Transactions on Wireless Communications, vol. 22, no. 6, pp. 3997-4012, June 2023, doi: 10.1109/TWC.2022.3222781.

Watch ICASSP 2021 presentation on YouTube

Abstract

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, these greedy heuristics mostly 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.

Key words: Maximum weighted independent set; graph convolutional network; wireless networks; scheduling; reinforcement learning

BibTex

@ARTICLE{9962800,
  author={Zhao, Zhongyuan and Verma, Gunjan and Rao, Chirag and Swami, Ananthram and Segarra, Santiago},
  journal={IEEE Transactions on Wireless Communications}, 
  title={Link Scheduling Using Graph Neural Networks}, 
  year={2023},
  volume={22},
  number={6},
  pages={3997-4012},
  keywords={Wireless networks;Processor scheduling;Complexity theory;Scheduling;Optimal scheduling;Ad hoc networks;Routing;MWIS;graph convolutional networks;wireless networks;scheduling;reinforcement learning},
  doi={10.1109/TWC.2022.3222781}}
@INPROCEEDINGS{9414098,
  author={Zhao, Zhongyuan and Verma, Gunjan and Rao, Chirag and Swami, Ananthram and Segarra, Santiago},
  booktitle={ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}, 
  title={Distributed Scheduling Using Graph Neural Networks}, 
  year={2021},
  volume={},
  number={},
  pages={4720-4724},
  doi={10.1109/ICASSP39728.2021.9414098}}

Instructions for replicate numerical experiments

The recommended system setup is Ubuntu linux 20.04LTS.

The old instructions are also helpful, but not repeated here.

Training script ./bash/twc_train_gcn_gdpg.sh

Test on graphs ./bash/twc_test_gdpg_500graphs.sh

Test for wireless scheduling in single channel: ./bash/test_wireless_gcn_dqn.sh, ./bash/test_wireless_gcn_rollout.sh

Test for wireless scheduling in multiple subchannels: ./bash/twc_major_wireless_mc_test.sh