机会SINR约束下基于样本近似的功率与接纳联合控制方法
Sample Approximation-Based Deflation Approaches for Chance SINR Constrained Joint Power and Admission Control
摘要：
考虑多用户单输入单输出（SISO）干扰信道的联合功率和接纳控制（JPAC）问题。现有的JPAC算法大多假设信道状态信息（CSI）是理想的。在本文中，我们考虑的JPAC问题与不完美的CSI，也就是说，我们假设只有信道分布信息（CDI）。我们制定的JPAC问题到一个机会（概率）约束的程序，其中每个链路的SINR中断概率被强制执行小于或等于一个指定的公差。为了规避机会SINR约束的计算困难，我们建议使用样本（场景）近似方案将它们转换为许多简单的线性约束。此外，我们重新制定的机会信干噪比约束JPAC问题的样本近似为一个复合组稀疏最小化问题，然后近似二阶锥规划（SOCP）。SOCP近似的解可用于检查网络中所有链路的同时可支持性，并指导迭代链路删除过程（紧缩方法）。我们利用SOCP近似的特殊结构，设计了一个有效的算法来求解它。最后，我们通过仿真验证了所提出的基于样本近似的紧缩方法的有效性和效率。
英文摘要：
Consider the joint power and admission control (JPAC) problem for a multi-user single-input single-output (SISO) interference channel. Most existing works on JPAC assume the perfect instantaneous channel state information (CSI). In this paper, we consider the JPAC problem with the imperfect CSI, that is, we assume that only the channel distribution information (CDI) is available. We formulate the JPAC problem into a chance (probabilistic) constrained program, where each link's SINR outage probability is enforced to be less than or equal to a specified tolerance. To circumvent the computational difficulty of the chance SINR constraints, we propose to use the sample (scenario) approximation scheme to convert them into finitely many simple linear constraints. Furthermore, we reformulate the sample approximation of the chance SINR constrained JPAC problem as a composite group sparse minimization problem and then approximate it by a second-order cone program (SOCP). The solution of the SOCP approximation can be used to check the simultaneous supportability of all links in the network and to guide an iterative link removal procedure (the deflation approach). We exploit the special structure of the SOCP approximation and custom-design an efficient algorithm for solving it. Finally, we illustrate the effectiveness and efficiency of the proposed sample approximation-based deflation approaches by simulations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
