Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2208.06663

Energy Consumption Optimization in RIS-Assisted Cooperative RSMA Cellular Networks

Shreya Khisa·Mohamad Elhattab·Chadi Assi·Sanaa Sharafeddine
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents a downlink reconfigurable intelligent surface (RIS)-assisted half-duplex (HD) cooperative rate splitting multiple access (C-RSMA) networks. The proposed system model is built up considering one base station (BS), one RIS, and two users. With the goal of minimizing the network energy consumption, a joint framework to optimize the precoding vectors at the BS, common stream split, relaying device transmit power, the time slot allocation, and the passive beamforming at the RIS subject to the power budget constraints at both the BS and the relaying node, the quality of service (QoS) constraints at both users, and common stream rate constraint is proposed. The formulated problem is a non-convex optimization problem due to the high coupling among the optimization variables. To tackle this challenge, an efficient algorithm is presented by invoking the alternating optimization technique, which decomposes the original problem into two sub-problems; namely, sub-problem-1 and sub-problem-2, which are alternatively solved. Specifically, sub-problem-1 is to jointly optimize the precoding vectors, common stream split, and relaying device power. Meanwhile, sub-problem-2 is to optimize the phase shift matrix at the RIS. In order to solve sub-problem-1, an efficient low-complexity solution based on the successive convex approximation (SCA) is proposed. Meanwhile, and with the aid of difference-of-convex rank-one representation and the SCA approach, an efficient solution for the phase shift matrix at the RIS is obtained. The simulation results demonstrate that the proposed RIS-assisted HD C-RSMA achieves a significant gain in minimizing the total energy consumption compared to the RIS-assisted RSMA scheme, RIS-assisted HD cooperative non-orthogonal multiple access (C-NOMA), RIS-assisted NOMA, HD C-RSMA without RIS, and HD C-NOMA without RIS.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shreya Khisa, Mohamad Elhattab, Chadi Assi, Sanaa Sharafeddine. 2022-08-13. Energy Consumption Optimization in RIS-Assisted Cooperative RSMA Cellular Networks. https://arxiv.org/abs/2208.06663

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Radiance-Field Guided Pretraining: Scaling Localization Models with Unlabeled Wireless Signals

Radio frequency (RF)-based indoor localization offers significant promise for applications such as indoor navigation, augmented reality, and pervasive computing. While deep learning has greatly enhanced localization accuracy and robustness, existing localization models still face major challenges in cross-scene generalization due to their reliance on scene-specific labeled data. To address this, we introduce Radiance-Field Reinforced Pretraining (RFRP). This novel self-supervised pretraining framework couples a large localization model (LM) with a neural radio-frequency radiance field (RF-NeRF) in an asymmetrical autoencoder architecture. In this design, the LM encodes received RF spectra into latent, position-relevant representations, while the RF-NeRF decodes them to reconstruct the original spectra. This alignment between input and output enables effective representation learning using large-scale, unlabeled RF data, which can be collected continuously with minimal effort. To this end, we collected RF samples at 7,327,321 positions across 100 diverse scenes using four common wireless technologies--RFID, BLE, WiFi, and IIoT. Data from 75 scenes were used for training, and the remaining 25 for evaluation. Experimental results show that the RFRP-pretrained LM reduces localization error by over 40% compared to non-pretrained models and by 21% compared to those pretrained using supervised learning.

cs.IT↗
arXiv2026

Uniform Recovery of Structured Signals from Nonlinear Observations: Improved Error Rates

Consider the recovery of structured signals from nonlinear observations. Under Gaussian matrix and a large class of unknown nonlinear link functions, Plan and Vershynin (2016) showed that generalized Lasso achieves accurate nonuniform recovery of a fixed signal. More recently, Genzel and Stollenwerk (2023) showed that generalized Lasso is indeed capable of accurately recovering all structured signals. However, in some canonical settings with discontinuous link functions, their uniform recovery error rate is essentially slower than the nonuniform one. Specifically, in the recovery of $n$-dimensional $k$-sparse vectors from $m$ measurements, generalized Lasso with a perfectly tuned $\ell_1$ constraint achieves nonuniform error rate $ O(\sqrt{k\log(en/k)/m})$, while the uniform error rate of Genzel and Stollenwerk is no faster than $O((k\log(en/k)/m)^{1/4})$. In this paper, we narrow this gap by establishing improved uniform recovery guarantees under piecewise Lipschitz link functions with well-separated jump discontinuities. We analyze a projected gradient descent (PGD) algorithm whose projection can be onto a convex set or a cone, and our results for the PGD with a convex set are also valid for the generalized Lasso. In sparse recovery, the improved uniform error rates match the nonuniform rate $O(\sqrt{k\log(en/k)/m})$ up to logarithmic factors. Under the sign link function, we further show that iterative hard thresholding (a specific instance of the PGD) achieves uniform recovery error rate $O(\sqrt{k\log(en/k)/m})$, matching the nonuniform rate up to a universal constant. Technically, the uniform guarantees for the PGD are obtained by showing that the gradient maps satisfy the restricted approximate invertibility condition uniformly over all signals. We demonstrate that this is a general approach to uniform recovery under nonlinear observations.

cs.IT↗
arXiv2026

Enhanced Feedback Mechanisms for Resource-Efficient Incremental Redundancy

Incremental redundancy (IR) can reduce error rates by spreading coded bits across multiple transmission attempts. However, conventional stop-and-wait operation with coarse feedback often over-provisions retransmissions, triggers unnecessary decoding attempts, and increases end-to-end latency. This paper develops enhanced feedback and scheduling mechanisms that predict the additional redundancy needed for successful decoding and allocate only the required resources. We study two complementary strategies. First, using channel statistics, we learn a one- or two-shot mapping from channel quality to the minimum redundancy budget. As a byproduct, we derive an achievable reliability lower bound on the error probability of hybrid automatic repeat request (HARQ) systems. Numerical results with polar-coded IR-HARQ scheme show that the bound can be closely approached by appropriately selecting the second-transmission redundancy over a wide SNR range with savings up to 60\% in retransmission size. Second, we propose a realization-aware early-feedback mechanism that uses first-transmission reliability information to make per-codeword decisions before decoding: whether the codeword is already decodable, if not, how many additional redundancy versions are needed, or whether decoding is unlikely and rate adaptation is preferable. Link-level simulations with 5G NR LDPC codes show that both predictors achieve high accuracy (about 96\% in our study), increasing the probability of successful decoding within at most two transmission occasions.

cs.IT↗