activity
20192025
most citedLink Scheduling using Graph Neural Networks

52 citations · 100 across the 20 of their papers we have counts for

collaborators
Showing eess.SPShow all

9 papers · 1 filter

eess.SP2024★ 1 cited

Learning Non-myopic Power Allocation in Constrained Scenarios

Arindam Chowdhury, Santiago Paternain, Gunjan Verma +2

We propose a learning-based framework for efficient power allocation in ad hoc interference networks under episodic constraints. The problem of optimal power allocation -- for maxi…

eess.SP2023

Deep Graph Unfolding for Beamforming in MU-MIMO Interference Networks

Arindam Chowdhury, Gunjan Verma, Ananthram Swami +1

We develop an efficient and near-optimal solution for beamforming in multi-user multiple-input-multiple-output single-hop wireless ad-hoc interference networks. Inspired by the wei…

eess.SP2022

Delay-aware Backpressure Routing Using Graph Neural Networks

Zhongyuan Zhao, Bojan Radojicic, Gunjan Verma +2

We propose a throughput-optimal biased backpressure (BP) algorithm for routing, where the bias is learned through a graph neural network that seeks to minimize end-to-end delay. Cl…

eess.SP2021

Delay-Oriented Distributed Scheduling Using Graph Neural Networks

Zhongyuan Zhao, Gunjan Verma, Ananthram Swami +1

In wireless multi-hop networks, delay is an important metric for many applications. However, the max-weight scheduling algorithms in the literature typically focus on instantaneous…

eess.SP2021★ 52 cited

Link Scheduling using Graph Neural Networks

Zhongyuan Zhao, Gunjan Verma, Chirag Rao +2

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…

eess.SP2020

Efficient power allocation using graph neural networks and deep algorithm unfolding

Arindam Chowdhury, Gunjan Verma, Chirag Rao +2

We study the problem of optimal power allocation in a single-hop ad hoc wireless network. In solving this problem, we propose a hybrid neural architecture inspired by the algorithm…

eess.SP2020

Adaptive Contention Window Design using Deep Q-learning

Abhishek Kumar, Gunjan Verma, Chirag Rao +2

We study the problem of adaptive contention window (CW) design for random-access wireless networks. More precisely, our goal is to design an intelligent node that can dynamically a…

eess.SP2020★ 6 cited

Distributed Scheduling using Graph Neural Networks

Zhongyuan Zhao, Gunjan Verma, Chirag Rao +2

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 s…

eess.SP2020

Unfolding WMMSE using Graph Neural Networks for Efficient Power Allocation

Arindam Chowdhury, Gunjan Verma, Chirag Rao +2

We study the problem of optimal power allocation in a single-hop ad hoc wireless network. In solving this problem, we depart from classical purely model-based approaches and propos…