AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (2.6 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access | Online First

Service Multiplexing and Slicing Optimization in RIS-NOMA Assisted C-RAN

School of Computer Science and Engineering, Engineering Research Center of Security Technology of Complex Network System, and Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education, Northeastern University, Shenyang 110819, China
Centre for Wireless Innovation (CWI), Queen’s University Belfast, Belfast, BT3 9DT, UK
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong 999077, China
Show Author Information

Abstract

Radio Access Network (RAN) slicing is a promising technique to realize service multiplexing in the upcoming Beyond Fifth-Generation (B5G) and Sixth-Generation (6G) networks. However, limited resources and substantial interference pose an obstacle to efficient RAN slicing. In this paper, a novel Reconfigurable Intelligent Surface (RIS) assisted Cloud RAN (C-RAN) slicing framework is proposed, where enhanced Mobile BroadBand (eMBB) and Ultra-Reliable Low-Latency Communications (URLLC) services coexist via Non-Orthogonal Multiple Access (NOMA) technology. To guarantee the high system performance in considered service multiplexing scenarios, a slicing orchestration optimization problem is formulated for the joint optimization of user clustering, beamforming design, reflection coefficients design, and power allocation for each NOMA cluster. To solve the obtained non-convex problem, an Alternating Optimization (AO) based iterative algorithm is developed. Specifically, an improved K-means-based clustering algorithm is first proposed to design the NOMA clusters. Then, the problem is decoupled into three sub-problems, which are solved alternatingly by applying Fractional Programming (FP) and Successive Convex Approximation (SCA). It is proved that the proposed algorithm can converge with polynomial computational complexity. Numerical results show that the proposed algorithm can significantly improve the performance of the slicing system compared to the benchmark schemes.

References

【1】
【1】
 
 
Tsinghua Science and Technology

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Xue Y, Jia J, Mu X, et al. Service Multiplexing and Slicing Optimization in RIS-NOMA Assisted C-RAN. Tsinghua Science and Technology, 2026, https://doi.org/10.26599/TST.2025.9010159

272

Views

17

Downloads

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Received: 02 July 2025
Revised: 25 August 2025
Accepted: 16 October 2025
Published: 14 July 2026
© The author(s) 2026.

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).