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

On the Performance of X-Duplex Relaying

292   0   0.0 ( 0 )
 نشر من قبل Shuai Li
 تاريخ النشر 2017
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




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

In this paper, we study a X-duplex relay system with one source, one amplify-and-forward (AF) relay and one destination, where the relay is equipped with a shared antenna and two radio frequency (RF) chains used for transmission or reception. X-duplex relay can adaptively configure the connection between its RF chains and antenna to operate in either HD or FD mode, according to the instantaneous channel conditions. We first derive the distribution of the signal to interference plus noise ratio (SINR), based on which we then analyze the outage probability, average symbol error rate (SER), and average sum rate. We also investigate the X-duplex relay with power allocation and derive the lower bound and upper bound of the corresponding outage probability. Both analytical and simulated results show that the X-duplex relay achieves a better performance over pure FD and HD schemes in terms of SER, outage probability and average sum rate, and the performance floor caused by the residual self interference can be eliminated using flexible RF chain configurations.



قيم البحث

اقرأ أيضاً

The theory of wireless information and power transfer in energy constrained wireless networks has caught the interest of researchers due to its potential in increasing the lifetime of sensor nodes and mitigate the environment hazards caused by conven tional cell batteries. Similarly, the advancements in areas of cooperative spectrum sharing protocols has enabled efficient use of frequency spectrum between a licensed primary user and a secondary user. In this paper, we consider an energy constrained secondary user which harvests energy from the primary signal and relays the primary signal in exchange for the spectrum access. We consider Nakagami-m fading model and propose two key protocols, namely time-splitting cooperative spectrum sharing (TS-CSS) and power-sharing cooperative spectrum sharing (PS-CSS), and derive expressions for the outage probabilities of the primary and secondary user in decode-forward and amplify-forward relaying modes. From the obtained results, it has been shown that the secondary user can carry its own transmission without adversely affecting the performance of the primary user and that PS-CSS protocol outperforms the TS-PSS protocol in terms of outage probability over a wide range of Signal to noise ratio(SNRs). The effect of various system parameters on the outage performance of these protocols have also been studied.
This paper consider a new secure communication scene where a full-duplex transmitter (Alan) need to transmit confidential information to a half-duplex receiver (Bob), with a silent eavesdropper (Eve) that tries to eavesdrop the confidential informati on. For realizing secure communication between Alan and Bob, a novel two phases communication scheme is proposed: in Phase 1, Alan and Bob send artificial noises (AN) simultaneously, while in Phase 2, Alan superimposes the AN received in Phase 1 with its confidential signal and sends the mixed signalto Bob. Since the mixed AN could degrade the SINR (Signal to Interference and Noise Ratio) of Eve, but does not affect the SINR of Bob, a secrecy capacity can be achieved. We also derive the conditions that the secrecy capacity of the proposed scheme exists, and analyze the secrecy outage probability under Rayleigh fading channel. Numerical results show that the secrecy capacity is about two times higher than without AN, even though in the proposed scheme half of the time is used to transmit ANs, and the outage probability is about five times lower than that without AN.
We assume a full-duplex (FD) cooperative network subject to hostile attacks and undergoing composite fading channels. We focus on two scenarios: textit{a)} the transmitter has full CSI, for which we derive closed-form expressions for the textit{avera ge secrecy rate}; and textit{b)} the transmitter only knows the CSI of the legitimate nodes, for which we obtain closed-form expressions for the textit{secrecy outage probability}. We show that secure FD relaying is feasible, even under strong self-interference and in the presence of sophisticated multiple antenna eavesdropper.
In this paper, we propose a transceiver architecture for full-duplex (FD) eNodeB (eNB) and FD user equipment (UE) transceiver. For FD communication,.i.e., simultaneous in-band uplink and downlink operation, same subcarriers can be allocated to UE in both uplink and downlink. Hence, contrary to traditional LTE, we propose using single-carrier frequency division multiple accesses (SC-FDMA) for downlink along with the conventional method of using it for uplink. The use of multiple antennas at eNB and singular value decomposition (SVD) in the downlink allows multiple users (MU) to operate on the same set of ubcarriers. In the uplink, successive interference cancellation with optimal ordering (SSIC-OO) algorithm is used to decouple signals of UEs operating in the same set of subcarriers. A smart antenna approach is adopted which prevents interference, in downlink of a UE, from uplink signals of other UEs sharing same subcarriers. The approach includes using multiple antennas at UEs to form directed beams towards eNode and nulls towards other UEs. The proposed architecture results in significant improvement of the overall spectrum efficiency per cell of the cellular network.
Security is a critical issue in full duplex (FD) communication systems due to the broadcast nature of wireless channels. In this paper, joint design of information and artificial noise beamforming vectors is proposed for the FD simultaneous wireless information and power transferring (FD-SWIPT) systems with loopback self-interference cancellation. To guarantee high security and energy harvesting performance of the FD-SWIPT system, the proposed design is formulated as a secrecy rate maximization problem under energy transfer rate constraints. Although the secrecy rate maximization problem is non-convex, we solve it via semidefinite relaxation and a two-dimensional search. We prove the optimality of our proposed algorithm and demonstrate its performance via simulations.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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