Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)

• URL: http://arxiv.org/abs/2509.05447v1
• Date: Fri, 05 Sep 2025 18:59:14 GMT
• Title: Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)
• Authors: Zhongyuan Zhao, Gunjan Verma, Ananthram Swami, Santiago Segarra,
• Abstract summary: In wireless networks characterized by dense connectivity, the significant signaling overhead generated by distributed link scheduling algorithms can exacerbate issues like congestion, energy consumption, and radio footprint expansion.<n>We propose a distributed link sparsification scheme employing graph neural networks (GNNs) to reduce scheduling overhead for delay-tolerant traffic while maintaining network capacity.<n>A GNN module is trained to adjust contention thresholds for individual links based on traffic statistics and network topology, enabling links to withdraw from scheduling contention when they are unlikely to succeed.
• Score: 50.894272363373126
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In wireless networks characterized by dense connectivity, the significant signaling overhead generated by distributed link scheduling algorithms can exacerbate issues like congestion, energy consumption, and radio footprint expansion. To mitigate these challenges, we propose a distributed link sparsification scheme employing graph neural networks (GNNs) to reduce scheduling overhead for delay-tolerant traffic while maintaining network capacity. A GNN module is trained to adjust contention thresholds for individual links based on traffic statistics and network topology, enabling links to withdraw from scheduling contention when they are unlikely to succeed. Our approach is facilitated by a novel offline constrained {unsupervised} learning algorithm capable of balancing two competing objectives: minimizing scheduling overhead while ensuring that total utility meets the required level. In simulated wireless multi-hop networks with up to 500 links, our link sparsification technique effectively alleviates network congestion and reduces radio footprints across four distinct distributed link scheduling protocols.

Related papers

• A Differentiable Digital Twin of Distributed Link Scheduling for Contention-Aware Networking [42.12511690811535]
  We develop an analytical network digital twin (NDT) that predicts link duty cycles from network context.<n>NDT accurately predicts link duty cycles and congestion patterns with up to a 5000x speedup over packet-level simulation.
  arXiv  Detail & Related papers  (2025-12-11T18:04:30Z)
• Opportunistic Routing in Wireless Communications via Learnable State-Augmented Policies [7.512221808783587]
  This paper addresses the challenge of packet-based information routing in large-scale wireless communication networks.<n>Opportunistic routing exploits the broadcast nature of wireless communication to dynamically select optimal forwarding nodes.<n>We propose a State-Augmentation (SA) based distributed optimization approach aimed at maximizing the total information handled by the source nodes in the network.
  arXiv  Detail & Related papers  (2025-03-05T18:44:56Z)
• NetDiff: Deep Graph Denoising Diffusion for Ad Hoc Network Topology Generation [1.6768151308423371]
  We introduce NetDiff, a graph denoising diffusion probabilistic architecture that generates wireless ad hoc network link topologies. Our results show that the generated links are realistic, present structural properties similar to the dataset graphs', and require only minor corrections and verification steps to be operational.
  arXiv  Detail & Related papers  (2024-10-09T15:39:49Z)
• Congestion-aware Distributed Task Offloading in Wireless Multi-hop Networks Using Graph Neural Networks [33.79834562046449]
  Existing offloading schemes mainly focus on mobile devices and servers, while ignoring the potential network congestion caused by tasks from multiple mobile devices. We propose a congestion-aware distributed task offloading scheme by augmenting a distributed greedy framework with graph-based machine learning. Our approach is demonstrated to be effective in reducing congestion or unstable queues under the context-agnostic baseline, while improving the execution latency over local computing.
  arXiv  Detail & Related papers  (2023-12-05T03:46:30Z)
• Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks [37.84368235950714]
  We propose a distributed scheme for link sparsification with graph convolutional networks (GCNs) In medium-sized wireless networks, our proposed sparse scheduler beats threshold-based sparsification policies by retaining almost $70%$ of the total capacity achieved by a greedy scheduler.
  arXiv  Detail & Related papers  (2022-03-27T16:02:12Z)
• Learning Resilient Radio Resource Management Policies with Graph Neural Networks [124.89036526192268]
  We formulate a resilient radio resource management problem with per-user minimum-capacity constraints. We show that we can parameterize the user selection and power control policies using a finite set of parameters. Thanks to such adaptation, our proposed method achieves a superior tradeoff between the average rate and the 5th percentile rate.
  arXiv  Detail & Related papers  (2022-03-07T19:40:39Z)
• Learning Autonomy in Management of Wireless Random Networks [102.02142856863563]
  This paper presents a machine learning strategy that tackles a distributed optimization task in a wireless network with an arbitrary number of randomly interconnected nodes. We develop a flexible deep neural network formalism termed distributed message-passing neural network (DMPNN) with forward and backward computations independent of the network topology.
  arXiv  Detail & Related papers  (2021-06-15T09:03:28Z)
• Distributed Scheduling using Graph Neural Networks [38.74504118887024]
  A fundamental problem in the design of wireless networks is to efficiently schedule transmission in a distributed manner. We propose a distributed MWIS solver based on graph convolutional networks (GCNs) In a nutshell, a trainable GCN module learns topology-aware node embeddings that are combined with the network weights before calling a greedy solver.
  arXiv  Detail & Related papers  (2020-11-18T18:00:45Z)
• Decentralized Learning for Channel Allocation in IoT Networks over Unlicensed Bandwidth as a Contextual Multi-player Multi-armed Bandit Game [134.88020946767404]
  We study a decentralized channel allocation problem in an ad-hoc Internet of Things network underlaying on the spectrum licensed to a primary cellular network. Our study maps this problem into a contextual multi-player, multi-armed bandit game, and proposes a purely decentralized, three-stage policy learning algorithm through trial-and-error.
  arXiv  Detail & Related papers  (2020-03-30T10:05:35Z)
• Wireless Power Control via Counterfactual Optimization of Graph Neural Networks [124.89036526192268]
  We consider the problem of downlink power control in wireless networks, consisting of multiple transmitter-receiver pairs communicating over a single shared wireless medium. To mitigate the interference among concurrent transmissions, we leverage the network topology to create a graph neural network architecture. We then use an unsupervised primal-dual counterfactual optimization approach to learn optimal power allocation decisions.
  arXiv  Detail & Related papers  (2020-02-17T07:54:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.