Reliable IoT Communications in 6G Non-Terrestrial Networks with Dual RIS
Muddasir Rahim, Soumaya Cherkaoui
TL;DR
This work addresses reliable IoT communications in 6G upper mid-band non-terrestrial networks by introducing a two-tier RIS architecture that combines terrestrial RISs (TRIS) and HRISs mounted on HAPS to overcome LoS blockages. The authors formulate a joint beamforming, power allocation, and IoT device association problem (JBPDA) as a mixed-integer nonlinear program and solve it via decomposition into subproblems: zero-forcing beamforming, closed-form power allocation, and a stable-matching device–RIS association. The proposed JBPDA achieves sum-rate performance within about 2% of an exhaustive search while markedly outperforming greedy and random baselines and converging rapidly (e.g., ~45 iterations for moderate network sizes). This demonstrates the viability of multi-layer RISs for robust, scalable 6G IoT connectivity and provides a foundation for extensions to LEO segments and mobility-aware operation.
Abstract
The increasing demand for Internet of Things (IoT) applications has accelerated the need for robust resource allocation in sixth-generation (6G) networks. In this paper, we propose a reconfigurable intelligent surface (RIS)-assisted upper mid-band communication framework. To ensure robust connectivity under severe line-of-sight (LoS) blockages, we use a two-tier RIS structure comprising terrestrial RISs (TRISs) and high-altitude platform station (HAPS)-mounted RISs (HRISs). To maximize network sum rate, we formulate a joint beamforming, power allocation, and IoT device association (JBPDA) problem as a mixed-integer nonlinear program (MINLP). The formulated MINLP problem is challenging to solve directly; therefore, we tackle it via a decomposition approach. The zero-forcing (ZF) technique is used to optimize the beamforming matrix, a closed-form expression for power allocation is derived, and a stable matching-based algorithm is proposed for device-RIS association based on achievable data rates. Comprehensive simulations demonstrate that the proposed scheme approaches the performance of exhaustive search (ES) while exhibiting substantially lower complexity, and it consistently outperforms greedy search (GS) and random search (RS) baselines. Moreover, the proposed scheme converges much faster than the ES scheme.
