Maximize Spectrum Efficiency in Underlay Coexistence With Channel Uncertainty

Maximize Spectrum Efficiency in Underlay Coexistence With Channel Uncertainty
复制标题

DOI:
10.1109/tnet.2020.3047760
复制
发表时间:
2021-04
期刊:
IEEE/ACM Transactions on Networking
影响因子:
--
通讯作者:
Shaoran Li;Yan Huang;Chengzhang Li;Brian Jalaian;Y. T. Hou;Wenjing Lou;Stephen Russell
Shaoran Li;Yan Huang;Chengzhang Li;Brian Jalaian;Y. T. Hou;Wenjing Lou;Stephen Russell
中科院分区:
其他
文献类型:
--
作者:
Shaoran Li;Yan Huang;Chengzhang Li;Brian Jalaian;Y. T. Hou;Wenjing Lou;Stephen Russell

文献摘要

被引文献

相似文献

我们认为一个并行共存的情况下,次要用户(SU)必须保持他们的干扰下的主要用户(PU)。然而,从PU到SU的信道增益由于PU和SU之间缺乏合作而不确定。在这种情况下,优选的是允许每个PU的干扰阈值偶尔被违反,只要这种违反保持低于概率。在这篇文章中,我们采用机会约束规划(CCP),利用这个想法偶尔干扰阈值违规。我们假设不确定的信道增益只知道他们的平均值和协方差。这些数量变化缓慢,易于估计。我们的主要贡献是引入了一种新颖而强大的数学工具,称为精确圆锥重构(ECR),它将棘手的机会约束重新表述为易于处理的凸约束。此外,ECR保证了从线性机会约束到确定性圆锥约束的等效重新表述,而没有与伯恩斯坦近似相关的限制,我们的研究界多年来一直专注于此。通过大量的模拟,我们表明,我们提出的解决方案提供了一个显着的改善现有的方法在性能和能力,以处理信道相关性(其中伯恩斯坦近似不再适用)。
We consider an underlay coexistence scenario where secondary users (SUs) must keep their interference to the primary users (PUs) under control. However, the channel gains from the PUs to the SUs are uncertain due to a lack of cooperation between the PUs and the SUs. Under this circumstance, it is preferable to allow the interference threshold of each PU to be violated occasionally as long as such violation stays below a probability. In this article, we employ Chance-Constrained Programming (CCP) to exploit this idea of occasional interference threshold violation. We assume the uncertain channel gains are only known by their mean and covariance. These quantities are slow-changing and easy to estimate. Our main contribution is to introduce a novel and powerful mathematical tool called Exact Conic Reformulation (ECR), which reformulates the intractable chance constraints into tractable convex constraints. Further, ECR guarantees an equivalent reformulation from linear chance constraints into deterministic conic constraints without the limitations associated with Bernstein Approximation, on which our research community has been fixated on for years. Through extensive simulations, we show that our proposed solution offers a significant improvement over existing approaches in terms of performance and ability to handle channel correlations (where Bernstein Approximation is no longer applicable).