ترغب بنشر مسار تعليمي؟ اضغط هنا

Robust Secure Transmission Design for IRS-Assisted mmWave Cognitive Radio Networks

127   0   0.0 ( 0 )
 نشر من قبل Xuewen Wu
 تاريخ النشر 2021
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

Cognitive radio networks (CRNs) and millimeter wave (mmWave) communications are two major technologies to enhance the spectrum efficiency (SE). Considering that the SE improvement in the CRNs is limited due to the interference temperature imposed on the primary user (PU), and the severe path loss and high directivity in mmWave communications make it vulnerable to blockage events, we introduce an intelligent reflecting surface (IRS) into mmWave CRNs. This paper investigates the robust secure beamforming (BF) design in the IRS-assisted mmWave CRNs. By using a uniform linear array (ULA) at the cognitive base station (CBS) and a uniform planar array (UPA) at the IRS, and supposing that the imperfect channel state information (CSI) of wiretap links is known, we formulate a constrained problem to maximize the worst-case achievable secrecy rate (ASR) of the secondary user (SU) by jointly designing the transmit BF at the CBS and reflect BF at the IRS. To solve the non-convex problem with coupled variables, an efficient alternating optimization algorithm is proposed. As for the transmit BF at the CBS, we propose a heuristic robust transmit BF algorithm to attain the BF vectors analytically. As for the reflect BF at the IRS, by means of an auxiliary variable, we transform the non-convex problem into a semi-definite programming (SDP) problem with rank-1 constraint, which is handled with the help of an iterative penalty function, and then obtain the optimal reflect BF through CVX. Finally, the simulation results indicate that the ASR performance of our proposed algorithm has a small gap with that of the optimal solution with perfect CSI compared with the other benchmarks.



قيم البحث

اقرأ أيضاً

174 - Xuewen Wu , Jingxiao Ma , Zhe Xing 2021
This paper investigates the application of intelligent reflecting surface (IRS) in an underlay cognitive radio network (CRN), where a multi-antenna cognitive base station (CBS) utilizes spectrum assigned to the primary user (PU) to communicate with a secondary user (SU) via IRS in the presence of multiple coordinated eavesdroppers. To achieve the trade-off between the secrecy rate (SR) and energy consumption, we propose a secrecy energy efficiency (SEE) maximization scheme by jointly design the transmit beamforming at CBS and the reflect beamforming at IRS under the SR constraint of SU, the transmit power constraint of CBS, the limited interference temperature of PU and the unit modulus constraint of IRS. The problem is challenging to solve due to the coupled optimization variables and unit modulus constraint, for which an iterative alternating optimization algorithm is proposed. As for optimizing the reflect beamforming, we introduce an auxiliary variable and convert the original non-convex problem into a semi-definite programming with rank-1 constraint, and then propose an iterative penalty function based algorithm to implement the optimal reflect beamforming. As for optimizing the transmit beamforming, we convert the original problem into an equivalent subtractive form, which is further transformed into a convex function by employing the difference of two-convex functions method. Furthermore, we provide a second-order-cone-programming approximation approach to reduce the computational complexity. The effectiveness and superiority of our proposed algorithm are verified in the simulation results.
This paper investigates a machine learning-based power allocation design for secure transmission in a cognitive radio (CR) network. In particular, a neural network (NN)-based approach is proposed to maximize the secrecy rate of the secondary receiver under the constraints of total transmit power of secondary transmitter, and the interference leakage to the primary receiver, within which three different regularization schemes are developed. The key advantage of the proposed algorithm over conventional approaches is the capability to solve the power allocation problem with both perfect and imperfect channel state information. In a conventional setting, two completely different optimization frameworks have to be designed, namely the robust and non-robust designs. Furthermore, conventional algorithms are often based on iterative techniques, and hence, they require a considerable number of iterations, rendering them less suitable in future wireless networks where there are very stringent delay constraints. To meet the unprecedented requirements of future ultra-reliable low-latency networks, we propose an NN-based approach that can determine the power allocation in a CR network with significantly reduced computational time and complexity. As this trained NN only requires a small number of linear operations to yield the required power allocations, the approach can also be extended to different delay sensitive applications and services in future wireless networks. When evaluate the proposed method versus conventional approaches, using a suitable test set, the proposed approach can achieve more than 94% of the secrecy rate performance with less than 1% computation time and more than 93% satisfaction of interference leakage constraints. These results are obtained with significant reduction in computational time, which we believe that it is suitable for future real-time wireless applications.
In this paper, we investigate different secrecy energy efficiency (SEE) optimization problems in a multiple-input single-output underlay cognitive radio (CR) network in the presence of an energy harvesting receiver. In particular, these energy effici ent designs are developed with different assumptions of channels state information (CSI) at the transmitter, namely perfect CSI, statistical CSI and imperfect CSI with bounded channel uncertainties. In particular, the overarching objective here is to design a beamforming technique maximizing the SEE while satisfying all relevant constraints linked to interference and harvested energy between transmitters and receivers. We show that the original problems are non-convex and their solutions are intractable. By using a number of techniques, such as non-linear fractional programming and difference of concave (DC) functions, we reformulate the original problems so as to render them tractable. We then combine these techniques with the Dinkelbachs algorithm to derive iterative algorithms to determine relevant beamforming vectors which lead to the SEE maximization. In doing this, we investigate the robust design with ellipsoidal bounded channel uncertainties, by mapping the original problem into a sequence of semidefinite programs by employing the semidefinite relaxation, non-linear fractional programming and S-procedure. Furthermore, we show that the maximum SEE can be achieved through a search algorithm in the single dimensional space. Numerical results, when compared with those obtained with existing techniques in the literature, show the effectiveness of the proposed designs for SEE maximization.
In this paper we investigate the practical design for the multiple-antenna cognitive radio (CR) networks sharing the geographically used or unused spectrum. We consider a single cell network formed by the primary users (PU), which are half-duplex two -hop relay channels and the secondary users (SU) are single user additive white Gaussian noise channels. In addition, the coexistence constraint which requires PUs coding schemes and rates unchanged with the emergence of SU, should be satisfied. The contribution of this paper are twofold. First, we explicitly design the scheme to pair the SUs to the existing PUs in a single cell network. Second, we jointly design the nonlinear precoder, relay beamformer, and the transmitter and receiver beamformers to minimize the sum mean square error of the SU system. In the first part, we derive an approximate relation between the relay ratio, chordal distance and strengths of the vector channels, and the transmit powers. Based on this relation, we are able to solve the optimal pairing between SUs and PUs efficiently. In the second part, considering the feasibility of implementation, we exploit the Tomlinson-Harashima precoding instead of the dirty paper coding to mitigate the interference at the SU receiver, which is known side information at the SU transmitter. To complete the design, we first approximate the optimization problem as a convex one. Then we propose an iterative algorithm to solve it with CVX. This joint design exploits all the degrees of design. To the best of our knowledge, both the two parts have never been considered in the literature. Numerical results show that the proposed pairing scheme outperforms the greedy and random pairing with low complexity. Numerical results also show that even if all the channel matrices are full rank, under which the simple zero forcing scheme is infeasible, the proposed scheme can still work well.
Cognitive radio is a promising technology to improve spectral efficiency. However, the secure performance of a secondary network achieved by using physical layer security techniques is limited by its transmit power and channel fading. In order to tac kle this issue, a cognitive unmanned aerial vehicle (UAV) communication network is studied by exploiting the high flexibility of a UAV and the possibility of establishing line-of-sight links. The average secrecy rate of the secondary network is maximized by robustly optimizing the UAVs trajectory and transmit power. Our problem formulation takes into account two practical inaccurate location estimation cases, namely, the worst case and the outage-constrained case. In order to solve those challenging non-convex problems, an iterative algorithm based on $mathcal{S}$-Procedure is proposed for the worst case while an iterative algorithm based on Bernstein-type inequalities is proposed for the outage-constrained case. The proposed algorithms can obtain effective suboptimal solutions of the corresponding problems. Our simulation results demonstrate that the algorithm under the outage-constrained case can achieve a higher average secrecy rate with a low computational complexity compared to that of the algorithm under the worst case. Moreover, the proposed schemes can improve the secure communication performance significantly compared to other benchmark schemes.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا