Asset Details
Do you wish to reserve the book?
Graph Neural Network based scheduling : Improved throughput under a generalized interference model
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Graph Neural Network based scheduling : Improved throughput under a generalized interference model
Do you wish to request the book?
Graph Neural Network based scheduling : Improved throughput under a generalized interference model
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
Graph Neural Network based scheduling : Improved throughput under a generalized interference model
2021
Overview
In this work, we propose a Graph Convolutional Neural Networks (GCN) based scheduling algorithm for adhoc networks. In particular, we consider a generalized interference model called the \\(k\\)-tolerant conflict graph model and design an efficient approximation for the well-known Max-Weight scheduling algorithm. A notable feature of this work is that the proposed method do not require labelled data set (NP-hard to compute) for training the neural network. Instead, we design a loss function that utilises the existing greedy approaches and trains a GCN that improves the performance of greedy approaches. Our extensive numerical experiments illustrate that using our GCN approach, we can significantly (\\(4\\)-\\(20\\) percent) improve the performance of the conventional greedy approach.
Publisher
Cornell University Library, arXiv.org
