Salvato in:
Dettagli Bibliografici
Autori principali: Liesegang, Sergi, Zappone, Alessio, Muñoz, Olga, Pascual-Iserte, Antonio
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:https://arxiv.org/abs/2412.07248
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866916515457007616
author Liesegang, Sergi
Zappone, Alessio
Muñoz, Olga
Pascual-Iserte, Antonio
author_facet Liesegang, Sergi
Zappone, Alessio
Muñoz, Olga
Pascual-Iserte, Antonio
contents Reconfigurable intelligent surfaces (RISs) have become a promising candidate for the development of future mobile systems. In the context of massive machine-type communications (mMTC), a RIS can be used to support the transmission from a group of sensors to a collector node. Due to the short data packets, we focus on the design of the RIS for maximizing the weighted sum and minimum rates in the finite blocklength regime. Under the assumption of non-orthogonal multiple access, successive interference cancelation is considered as a decoding scheme to mitigate interference. Accordingly, we formulate the optimizations as non-convex problems and propose two sub-optimal solutions based on gradient ascent (GA) and sequential optimization (SO) with semi-definite relaxation (SDR). In the GA, we distinguish between Euclidean and Riemannian gradients. For the SO, we derive a concave lower bound for the throughput and maximize it sequentially applying SDR. Numerical results show that the SO can outperform the GA and that strategies relying on the optimization of the classical Shannon capacity might be inadequate for mMTC networks.
format Preprint
id arxiv_https___arxiv_org_abs_2412_07248
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Rate Optimization for RIS-Aided mMTC Networks in the Finite Blocklength Regime
Liesegang, Sergi
Zappone, Alessio
Muñoz, Olga
Pascual-Iserte, Antonio
Signal Processing
Reconfigurable intelligent surfaces (RISs) have become a promising candidate for the development of future mobile systems. In the context of massive machine-type communications (mMTC), a RIS can be used to support the transmission from a group of sensors to a collector node. Due to the short data packets, we focus on the design of the RIS for maximizing the weighted sum and minimum rates in the finite blocklength regime. Under the assumption of non-orthogonal multiple access, successive interference cancelation is considered as a decoding scheme to mitigate interference. Accordingly, we formulate the optimizations as non-convex problems and propose two sub-optimal solutions based on gradient ascent (GA) and sequential optimization (SO) with semi-definite relaxation (SDR). In the GA, we distinguish between Euclidean and Riemannian gradients. For the SO, we derive a concave lower bound for the throughput and maximize it sequentially applying SDR. Numerical results show that the SO can outperform the GA and that strategies relying on the optimization of the classical Shannon capacity might be inadequate for mMTC networks.
title Rate Optimization for RIS-Aided mMTC Networks in the Finite Blocklength Regime
topic Signal Processing
url https://arxiv.org/abs/2412.07248