论文标题
安全毫米波云无线电访问网络依靠微波多播fronthaul
Secure Millimeter Wave Cloud Radio Access Networks Relying on Microwave Multicast Fronthaul
论文作者
论文摘要
在本文中,我们研究了依靠多播Fronthaul的云无线电访问网络(C-RAN)的下行链路安全光束(BF)设计问题,在此分别将毫米波和微波炉用于访问链接和Fronthaul链接。基站(BSS)通过合作混合模拟/数字BF共同为用户提供服务。我们首先开发用于合作BSS的模拟BF。在此基础上,我们制定了属于现实的fronthaul容量和总BS传输功率约束的秘密率最大化(SRM)问题。由于提出了非凸问题的棘手性,高级凸面近似技术,受约束的凹面凸面程序和半明确编程(SDP)弛豫被应用于将其转换为凸形。随后,提出了共同优化多播BF,合作数字BF和人工噪声(AN)协方差的迭代算法。接下来,我们通过利用SDP - 重新释放问题的原始解决方案和双重最佳解决方案来构建原始问题的解决方案。此外,还考虑了BBS传输功率约束,因此需要对SRM问题进行重新制定,这可以通过有效的迭代算法来解决。然后,我们消除了具有理想化的简化假设,即在窃听链路上拥有完美的通道状态信息(CSI)并调用现实的不完美CSI。此外,还研究了最严重的SRM问题。最后,通过将所谓的$ \ Mathcal {s} $ - 过程和凸面近似技术组合,我们设计了一种有效的迭代算法来解决它。提出了仿真结果以评估保密率并证明所提出算法的有效性。
In this paper, we investigate the downlink secure beamforming (BF) design problem of cloud radio access networks (C-RANs) relying on multicast fronthaul, where millimeter-wave and microwave carriers are used for the access links and fronthaul links, respectively. The base stations (BSs) jointly serve users through cooperating hybrid analog/digital BF. We first develop an analog BF for cooperating BSs. On this basis, we formulate a secrecy rate maximization (SRM) problem subject both to a realistic limited fronthaul capacity and to the total BS transmit power constraint. Due to the intractability of the non-convex problem formulated, advanced convex approximated techniques, constrained concave convex procedures and semi-definite programming (SDP) relaxation are applied to transform it into a convex one. Subsequently, an iterative algorithm of jointly optimizing multicast BF, cooperative digital BF and the artificial noise (AN) covariance is proposed. Next, we construct the solution of the original problem by exploiting both the primal and the dual optimal solution of the SDP-relaxed problem. Furthermore, a per-BS transmit power constraint is considered, necessitating the reformulation of the SRM problem, which can be solved by an efficient iterative algorithm. We then eliminate the idealized simplifying assumption of having perfect channel state information (CSI) for the eavesdropper links and invoke realistic imperfect CSI. Furthermore, a worst-case SRM problem is investigated. Finally, by combining the so-called $\mathcal{S}$-Procedure and convex approximated techniques, we design an efficient iterative algorithm to solve it. Simulation results are presented to evaluate the secrecy rate and demonstrate the effectiveness of the proposed algorithms.