ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2021
DOI: 10.1109/icassp39728.2021.9414098
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Scheduling Using Graph Neural Networks

Abstract: 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 weighted independent set (MWIS) problem, which is NP-hard. For practical link scheduling schemes, distributed greedy approaches are commonly used to approximate the solution of the MWIS problem. However, these greedy schemes mostly ignore important topological information of the wireless networks.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
3
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 47 publications
(16 citation statements)
references
References 46 publications
0
16
0
Order By: Relevance
“…Similarly, [27] makes use of location information and tackles link scheduling problem using a deep learning based graph embedding process. In [28], the link scheduling problem is solved using a graph convolutional network based solution with user interference relationship as the primary input. However, these existing works on scheduling are for device-to-device networks without the RIS.…”
Section: A Related Workmentioning
confidence: 99%
“…Similarly, [27] makes use of location information and tackles link scheduling problem using a deep learning based graph embedding process. In [28], the link scheduling problem is solved using a graph convolutional network based solution with user interference relationship as the primary input. However, these existing works on scheduling are for device-to-device networks without the RIS.…”
Section: A Related Workmentioning
confidence: 99%
“…Naderializadeh [21] investigates the challenge of bilateral link scheduling, where the power control policy is learnt using GNN as the basis to transform channel matrix to graph embeddings series by utilizing interference graph. A GNN-based approach was demonstrated in [22] to enhance the efficiency of greedy schedulers such as Longest-Queue-First. This result is compared, however, on interference model known as the conflict graph model, that only records binary correlations between edges.…”
Section: A Related Workmentioning
confidence: 99%
“…A distributed schedule transmission scheme for wireless networks is proposed to overcome the difficulty encountered in solving the maximum weighted independent set (MWIS) problem [61]. The authors first proposed a GCN-based distributed MWIS solver for link scheduling by combining the learning capabilities of GCNs and the efficiency of greedy MWIS solvers.…”
Section: B Link Schedulingmentioning
confidence: 99%