اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPractical Design for Multiple-Antenna Cognitive Radio Networks with Coexistence Constraint
153
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 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.
With the increasing number of wireless communication systems and the demand for bandwidth, the wireless medium has become a congested and contested environment. Operating under such an environment brings several challenges, especially for military co
mmunication systems, which need to guarantee reliable communication while avoiding interfering with other friendly or neutral systems and denying the enemy systems of service. In this work, we investigate a novel application of Rate-Splitting Multiple Access(RSMA) for joint communications and jamming with a Multi-Carrier(MC) waveform in a multiantenna Cognitive Radio(CR) system. RSMA is a robust multiple access scheme for downlink multi-antenna wireless networks. RSMA relies on multi-antenna Rate-Splitting (RS) at the transmitter and Successive Interference Cancellation (SIC) at the receivers. Our aim is to simultaneously communicate with Secondary Users(SUs) and jam Adversarial Users(AUs) to disrupt their communications while limiting the interference to Primary Users(PUs) in a setting where all users perform broadband communications by MC waveforms in their respective networks. We consider the practical setting of imperfect CSI at transmitter(CSIT) for the SUs and PUs, and statistical CSIT for AUs. We formulate a problem to obtain optimal precoders which maximize the mutual information under interference and jamming power constraints. We propose an Alternating Optimization-Alternating Direction Method of Multipliers(AOADMM) based algorithm for solving the resulting non-convex problem. We perform an analysis based on Karush-Kuhn-Tucker conditions to determine the optimal jamming and interference power thresholds that guarantee the feasibility of problem and propose a practical algorithm to calculate the interference power threshold. By simulations, we show that RSMA achieves a higher sum-rate than Space Division Multiple Access(SDMA).
In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of s
ecret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users with perfect secrecy. That is, each user would like to obtain its own message reliably and confidentially. First, a computable Sato-type outer bound on the secrecy capacity region is provided for a multi-antenna broadcast channel with confidential messages. Next, a dirty-paper secure coding scheme and its simplified version are described. For each case, the corresponding achievable rate region is derived under the perfect secrecy requirement. Finally, two numerical examples demonstrate that the Sato-type outer bound is consistent with the boundary of the simplified dirty-paper coding secrecy rate region.
Spectrum sensing is an essential enabling functionality for cognitive radio networks to detect spectrum holes and opportunistically use the under-utilized frequency bands without causing harmful interference to legacy networks. This paper introduces
a novel wideband spectrum sensing technique, called multiband joint detection, which jointly detects the signal energy levels over multiple frequency bands rather than consider one band at a time. The proposed strategy is efficient in improving the dynamic spectrum utilization and reducing interference to the primary users. The spectrum sensing problem is formulated as a class of optimization problems in interference limited cognitive radio networks. By exploiting the hidden convexity in the seemingly non-convex problem formulations, optimal solutions for multiband joint detection are obtained under practical conditions. Simulation results show that the proposed spectrum sensing schemes can considerably improve the system performance. This paper establishes important principles for the design of wideband spectrum sensing algorithms in cognitive radio networks.
Blind Null Space Learning (BNSL) has recently been proposed for fast and accurate learning of the null-space associated with the channel matrix between a secondary transmitter and a primary receiver. In this paper we propose a channel tracking enhanc
ement of the algorithm, namely the Blind Null Space Tracking (BNST) algorithm that allows transmission of information to the Secondary Receiver (SR) while simultaneously learning the null-space of the time-varying target channel. Specifically, the enhanced algorithm initially performs a BNSL sweep in order to acquire the null space. Then, it performs modified Jacobi rotations such that the induced interference to the primary receiver is kept lower than a given threshold $P_{Th}$ with probability $p$ while information is transmitted to the SR simultaneously. We present simulation results indicating that the proposed approach has strictly better performance over the BNSL algorithm for channels with independent Rayleigh fading with a small Doppler frequency.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
