AI & ML
Wireless Link Scheduling with Graph Signal Diffusion
arXiv eess.SP0 views
arXiv:2611.08274v1 Announce Type: new Abstract: We solve long-horizon wireless link scheduling with per-link minimum transmission constraints. Fair distribution of resources across links and time steps requires stochastic scheduling, motivating a diffusion framework. Via imitation learning, we train a diffusion model to sample scheduling decisions, conditioning generation on the network topology and constraint levels. The parameterization is achieved through a U-Graph Neural Network (U-GNN) to leverage the relationship between graphs and wireless networks for learning. Our approach achieves near-optimal performance, maximizing sum rate while distributing allocations across different links over time horizons. The U-GNN-based diffusion model generalizes to requirements and network sizes unseen during training, demonstrating the robustness of the approach.
Source:https://arxiv.org/abs/2611.08274PreviousSpectral Convergence of Sparse Bipartite Graphs via the Line-GraphonNextElectromagnetically Consistent Monostatic ISAC Beamforming: Mutual Coupling, Active Mismatch and Tx-Rx Leakage in Compact Dipole Arrays
Related posts
Microsoft Entra ID Security: Why Revoking Sessions Isn't Enough
0dev.to
AI Companies Really, Really Want to Buy Your Work Files and Emails
0Wired
Ramp data shows AI spending stalling just as Anthropic nears its IPO
0TechCrunch
What I got wrong estimating LLM costs before the request
0dev.to
The Step-by-Step Guide to Shutting Off Apple Intelligence Features in iOS 27
0CNET News
Will Democrats Rein in Big Tech? It Starts With Privacy and Data Centers
0CNET News