NIJun 18

Graph Diffusion-Based AeBS Deployment and Resource Allocation in RSMA-Enabled URLLC Low-Altitude Wireless Networks

arXiv:2507.040817.96 citationsh-index: 71
Predicted impact top 28% in NI · last 90 daysOriginality Incremental advance
AI Analysis

For wireless network operators, this work provides a novel solution to manage interference and enhance URLLC services in spectrum-constrained multi-AeBS networks.

This paper addresses the joint optimization of aerial base station deployment, user association, and resource allocation in RSMA-enabled URLLC low-altitude wireless networks, proposing a graph diffusion-based alternating optimization framework. The proposed method outperforms existing approaches in convergence speed, sum rate, and coverage under varying network conditions.

As a key component of low-altitude wireless networks, aerial base stations (AeBSs) provide flexible and reliable wireless coverage to support 6G ultra-reliable and low-latency communication (URLLC) services. However, limited spectrum resources and severe co-channel interference pose significant challenges to the deployment and resource allocation of AeBSs. To address these limitations, this paper proposes a novel rate-splitting multiple access (RSMA)-enabled transmission design to manage interference and enhance URLLC services in spectrum-constrained multi-AeBS networks. We formulate a joint optimization problem involving AeBS deployment, user association, and resource allocation to maximize the sum rate and coverage of system. Given the NP-hard nature of the problem, we propose a novel alternating optimization framework based on the generative graph diffusion models. Specifically, we model AeBSs and ground users as graph nodes, then we employ a discrete graph generation process solved via denoising diffusion to explore the combinatorial space of deployment and association strategies. Moreover, the successive convex approximation (SCA) is adopted to optimize AeBS beamforming and RSMA rate allocation under finite blocklength constraints. Extensive simulations demonstrate that the proposed algorithm outperforms existing methods in terms of convergence speed, sum rate, and coverage, while also exhibiting robust performance under varying network densities and interference levels.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes