DRL-AdaPart: DRL-Driven Adaptive STAR-RIS Partitioning for Fair and Efficient Resource Utilization
cs.IT, cs.LG, eess.SP, math.IT
Submitted: 2024-07-09
Updated: 2026-09-17
Comments: Revised version with abstract modified
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: Efficient resource utilization is proposed for simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RIS) to ensure fair and high data rates.
Terminology
Abstract
Efficient resource utilization is proposed for simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RIS) to ensure fair and high data rates. We optimize the number of STAR-RIS elements to be allocated to each user and maximize the sum of the user rates. To promote fairness, we introduce a soft fairness mechanism that guarantees a minimum STAR-RIS element allocation to every user. Subject to this requirement, the phase shifts of the STAR-RIS elements and the remaining element assignments are jointly optimized by harnessing an appropriately tailored deep reinforcement learning (DRL) algorithm. The proposed DRL method is also compared to Dinkelbach's algorithm and to a bespoke hybrid DRL approach. A deactivation incentive is incorporated into the DRL model for enhancing resource utilization by intelligently deactivating some of the STAR-RIS elements when not required. The proposed DRL method achieves fair and high data rates for both stationary and mobile users, while ensuring efficient resource utilization. Using the proposed DRL method, up to 34% and 23% of STAR-RIS elements can be deactivated in static and mobile scenarios, respectively, with negligible degradation in the average DL data rate.
Sources
- Joint Deployment and Beamforming Design of Aerial STAR-RIS Aided Networks with Reinforcement Learning
- Continuous control with deep reinforcement learning
- Playing Atari with Deep Reinforcement Learning
Related papers
- Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
- Discrepancy for Random Linear Codes
- A New Approach to Code Smoothing Bounds
- Contextual Memory-Enhanced Source Coding for Low-SNR Communications
- Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
- Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions