Graph Neural Network based scheduling : Improved throughput under a generalized interference model
Year: 2021
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Authors: Ramakrishnan, S., Mandalapu, Jaswanthi, Peruru, Subrahmanya Swamy, Jain, Bhavesh, Altman, Eitan
Institutions: Institut national de recherche en sciences et technologies du numérique, Université d'Avignon et des Pays de Vaucluse, Université Côte d'Azur, Centre Inria d'Université Côte d'Azur, NEO: Ingénierie et Opérations des Réseaux, Indian Institute of Technology Roorkee, Indian Institute of Technology Madras, Indian Institute of Technology Kanpur, Laboratoire Informatique d'Avignon
Language: English
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
Funder: Agence Nationale de la Recherche
OpenAlex ID: W3213452016
