A Differentiable Digital Twin of Distributed Link Scheduling for Contention-Aware Networking

• URL: http://arxiv.org/abs/2512.10874v1
• Date: Thu, 11 Dec 2025 18:04:30 GMT
• Title: A Differentiable Digital Twin of Distributed Link Scheduling for Contention-Aware Networking
• Authors: Zhongyuan Zhao, Yujun Ming, Kevin Chan, Ananthram Swami, Santiago Segarra,
• Abstract summary: 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.
• Score: 42.12511690811535
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many routing and flow optimization problems in wired networks can be solved efficiently using minimum cost flow formulations. However, this approach does not extend to wireless multi-hop networks, where the assumptions of fixed link capacity and linear cost structure collapse due to contention for shared spectrum resources. The key challenge is that the long-term capacity of a wireless link becomes a non-linear function of its network context, including network topology, link quality, and the traffic assigned to neighboring links. In this work, we pursue a new direction of modeling wireless network under randomized medium access control by developing an analytical network digital twin (NDT) that predicts link duty cycles from network context. We generalize randomized contention as finding a Maximal Independent Set (MIS) on the conflict graph using weighted Luby's algorithm, derive an analytical model of link duty cycles, and introduce an iterative procedure that resolves the circular dependency among duty cycle, link capacity, and contention probability. Our numerical experiments show that the proposed NDT accurately predicts link duty cycles and congestion patterns with up to a 5000x speedup over packet-level simulation, and enables us to optimize link scheduling using gradient descent for reduced congestion and radio footprint.

Related papers

• Unrolled Neural Networks for Constrained Optimization [83.29547301151177]
  Our framework comprises two coupled neural networks that jointly approximate the saddle point of the Lagrangian.<n>We numerically evaluate the framework on mixed-integer quadratic programs and power allocation in wireless networks.
  arXiv  Detail & Related papers  (2026-01-24T03:12:41Z)
• Resource Allocation in Hybrid Radio-Optical IoT Networks using GNN with Multi-task Learning [11.833896722352568]
  This paper addresses the problem of dual-technology scheduling in hybrid Internet of Things (IoT) networks that integrate Optical NeuralOWC and Radio Frequency (RF)<n>We propose a supervised multi-task learning architecture combining a two-stage Graph Embedding with Transformer (DGET) framework.<n>The proposed framework achieves near-optimal scheduling with over 90% classification accuracy, reduces computational complexity, and demonstrates higher robustness under partial channel observability.
  arXiv  Detail & Related papers  (2025-10-29T15:02:28Z)
• Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version) [50.894272363373126]
  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.
  arXiv  Detail & Related papers  (2025-09-05T18:59:14Z)
• 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)
• Multi-Flow Transmission in Wireless Interference Networks: A Convergent Graph Learning Approach [9.852567834643292]
  We introduce a novel algorithm called Dual-stage Interference-Aware Multi-flow Optimization of Network Data-signals (DIAMOND) A centralized stage computes the multi-flow transmission strategy using a novel design of graph neural network (GNN) reinforcement learning (RL) routing agent. Then, a distributed stage improves the performance based on a novel design of distributed learning updates.
  arXiv  Detail & Related papers  (2023-03-27T18:49:47Z)
• 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 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)
• Deep Reinforcement Learning for Resource Constrained Multiclass Scheduling in Wireless Networks [0.0]
  In our setup, the available limited bandwidth resources are allocated in order to serve randomly arriving service demands. We propose a distributional Deep Deterministic Policy Gradient (DDPG) algorithm combined with Deep Sets to tackle the problem. Our proposed algorithm is tested on both synthetic and real data, showing consistent gains against state-of-the-art conventional methods.
  arXiv  Detail & Related papers  (2020-11-27T09:49:38Z)
• Toward fast and accurate human pose estimation via soft-gated skip connections [97.06882200076096]
  This paper is on highly accurate and highly efficient human pose estimation. We re-analyze this design choice in the context of improving both the accuracy and the efficiency over the state-of-the-art. Our model achieves state-of-the-art results on the MPII and LSP datasets.
  arXiv  Detail & Related papers  (2020-02-25T18:51:51Z)
• 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.