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
cBridge: Do You Need Gas on Both Chains?
0dev.to
Honor Puts a 4-DOF Titanium Gimbal Inside a Phone at 7,999 Yuan
0dev.to

Protesters break into Microsoft data center site in Amsterdam
0The Verge

After printing 40,000 whistles, this is the 3D printer I’d buy
0The Verge

A New Community For In-House UX People
0Smashing Magazine
A flaw in ChatGPT, a lesson for our front-ends
0dev.to