Rudra: An Algorithm for Optimizing Spectrum Efficiency with Data Rate Guarantee in Next-G Communications

The limited spectrum and data-intensive applications in 5G/Next-G networks call for data rate guarantees for UEs with minimum spectrum usage. This problem is challenging due to the complexity of MU-MIMO system, unknown Channel State Information (CSI), and estimation errors. We propose Rudra, which aims to minimize spectrum usage while offering probabilistic guarantee for each UE’s data rate. The essence of Rudra is to employ Chance-Constrained Programming (CCP) by leveraging limited CSI samples. By reformulating the CCP into a deterministic one, Rudra offers an iterative solution that addresses Resource Block Group (RBG) allocation, Modulation and Coding Scheme (MCS) selection, and Beamforming (BF) design. Simulations show that Rudra can meet our design objective and outperforms a modified state-of-the-art algorithm.

Authors

Institutions

Publication Details

Published
2024-10-28
DOI
https://doi.org/10.1109/milcom61039.2024.10773760
Citations
4
Primary Topic
Telecommunications and Broadcasting Technologies
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Rudra: An Algorithm for Optimizing Spectrum Efficiency with Data Rate Guarantee in Next-G Communications

Wenjing Lou, Shaoran Li, Yubo Wu, Y. Thomas Hou et al.
4 citations
Telecommunications and Broadcasting Technologies
1.28
article

Rudra: An Algorithm for Optimizing Spectrum Efficiency with Data Rate Guarantee in Next-G Communications

Wenjing Lou, Shaoran Li, Yubo Wu, Y. Thomas Hou, Nan Jiang, Shiva Acharya
article en
4 citations

Abstract

The limited spectrum and data-intensive applications in 5G/Next-G networks call for data rate guarantees for UEs with minimum spectrum usage. This problem is challenging due to the complexity of MU-MIMO system, unknown Channel State Information (CSI), and estimation errors. We propose Rudra, which aims to minimize spectrum usage while offering probabilistic guarantee for each UE’s data rate. The essence of Rudra is to employ Chance-Constrained Programming (CCP) by leveraging limited CSI samples. By reformulating the CCP into a deterministic one, Rudra offers an iterative solution that addresses Resource Block Group (RBG) allocation, Modulation and Coding Scheme (MCS) selection, and Beamforming (BF) design. Simulations show that Rudra can meet our design objective and outperforms a modified state-of-the-art algorithm.

Georgia Institute of Technology (US), Nvidia (United States) (US), Virginia Tech (US)
Openalex Percentile: Top 16%
Telecommunications and Broadcasting Technologies
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Rudra: An Algorithm for Optimizing Spectrum Efficiency with Data Rate Guarantee in Next-G Communications — Wenjing Lou, Shaoran Li, et al. · (2024) | TGRS Research Map | TGRS