CoChat

Unfolding WMMSE Using Graph Neural Networks for Efficient Power Allocation

Open access
Chowdhury, Arindam, Verma, Gunjan, Rao, Chirag, Swami, Ananthram, Segarra, Santiago · 2021 · IEEE Transactions on Wireless Communications

The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.

Abstract

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 propose a hybrid method that retains key modeling elements in conjunction with data-driven components. More precisely, we put forth a neural network architecture inspired by the algorithmic unfolding of the iterative weighted minimum mean squared error (WMMSE) method, that we denote by unfolded WMMSE (UWMMSE). The learnable weights within UWMMSE are parameterized using graph neural networks (GNNs), where the time-varying underlying graphs are given by the fading interference coefficients in the wireless network. These GNNs are trained through a gradient descent approach based on multiple instances of the power allocation problem. We show that the proposed architecture is permutation equivariant, thus facilitating generalizability across network topologies. Comprehensive numerical experiments illustrate the performance attained by UWMMSE along with its robustness to hyper-parameter selection and generalizability to unseen scenarios such as different network densities and network sizes.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/twc.2021.3071480

Cites

61 of 61 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 61 references

Research works printed but not linked: 1

  1. 10.1109/vtcfall.2019.8891178 · doi:10.1109/vtcfall.2019.8891178

Cited by

See all 194

Metadata

Authors
Chowdhury, A., Verma, G., Rao, C., Swami, A., & Segarra, S.
Affiliations
  • Rice University (US)
  • DEVCOM Army Research Laboratory (US)
Venue
IEEE Transactions on Wireless Communications
Published
2021-09
Volume
20
Issue
9
Pages
6004-6017
ISSN
  • 1536-1276 (ISSN-L)
  • 1558-2248
OpenAlex
W3088683473
Cited by
162
References
59
Citations by year
2026: 17 · 2025: 24 · 2024: 31 · 2023: 34 · 2022: 34 · 2021: 20
FWCI
8.75
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Wireless Communications (publishedVersion)
  • arXiv (Cornell University) (submittedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University) (cc-by)
Funders
Army Research Office and was accomplished (W911NF-19-2-0269)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Network Optimization
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
  • Physical Sciences › Computer Science › Computer Networks and Communications › Wireless Communication Networks Research
Keywords
power allocation, graph neural networks, ad hoc networks, permutation equivariance, single-hop networks

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Unfolding WMMSE Using Graph Neural Networks for Efficient Power Allocation. https://app.cochat.ai/papers/10.1109/twc.2021.3071480
The paper
Chowdhury, A., Verma, G., Rao, C., Swami, A., & Segarra, S. (2021). Unfolding WMMSE Using Graph Neural Networks for Efficient Power Allocation. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2021.3071480

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.