Mitra: An O-RAN based Real-Time Solution for Coexistence between General and Priority Users in CBRS
Mitra: An O-RAN based Real-Time Solution for Coexistence between General and Priority Users in CBRS
复制标题
DOI：
10.1109/mass58611.2023.00043
复制
发表时间：
2023-09
期刊：
影响因子：
--
通讯作者：
Shiva Acharya;Shaoran Li;Nan Jiang;Yubo Wu;Y. T. Hou;W. Lou;Weijun Xie
中科院分区：
文献类型：
--
作者：
Shiva Acharya;Shaoran Li;Nan Jiang;Yubo Wu;Y. T. Hou;W. Lou;Weijun Xie
为了最大化公民宽带无线业务（CBRS）的潜在效益，迫切需要有效的共存算法，为一般授权接入（GAA）用户。目标是允许GAA用户与优先接入许可证（PAL）用户共享相同的频谱，同时为PAL用户提供所需的干扰保护。在设计一个有效的共存解决方案的主要挑战是没有合作的PAL用户和不确定性，在感测的信道信息。本文解决了这些问题，使用数据驱动的方法，基于有限的数据样本。我们开发了一个基于机会约束规划（CCP）的数学模型，以解决感测数据样本中的不确定性。利用∞-Wasserstein模糊集的思想，将CCP问题转化为一个确定性的混合非线性规划问题（MINLP）。我们提出了一个开放的RAN（ORAN）为基础的解决方案，MINLP在GAA基站（BS），提供了一个实时调度解决方案。
To maximize the potential benefit of Citizen Broadband Radio Service (CBRS), efficient coexistence algorithms are urgently needed for the general authorized access (GAA) users. The goal is to allow GAA users to share the same spectrum with priority access license (PAL) users, while providing the required interference protection to PAL users. The main challenge in designing an efficient coexistence solution is the absence of collaboration from the PAL users and the uncertainty in sensed channel information. This paper addresses these problems using a data-driven approach based on limited data samples. We develop a mathematical model based on chance-constrained programming (CCP) to address uncertainty in sensed data samples. By exploiting the idea of the ∞-Wasserstein ambiguity set, we reformulate the CCP problem into a deterministic Mixed-Integer Nonlinear Program (MINLP). We propose an open RAN (ORAN)-based solution to MINLP at the GAA base station (BS) that delivers a real-time scheduling solution.