Amal Hyadi

Performance Analysis of Underlay Cognitive Multihop Regenerative Relaying Systems with Multiple Primary Receivers

Multihop relaying is an efficient strategy to improve the connectivity and extend the coverage area of secondary networks in underlay cognitive systems. In this work, we provide a comprehensive performance study of cognitive multihop regenerative relaying systems in an underlay spectrum sharing scenario with the presence of multiple primary receivers. Both interference power and peak power constraints are taken into account. In our analysis, all the links are subject to independent, non-identically distributed Nakagami-m fading. We derive closed-form expressions for the outage probability, high-order amount of fading, bit error rate, symbol error rate, and ergodic capacity. Different scenarios are presented to illustrate the obtained results and Monte Carlo simulations confirm the accuracy of our analytical derivations.

Overlay cognitive radio systems with adaptive two-way relaying

In this paper, we propose a spectrum sharing mechanism with a two-phase two-way relaying protocol for an overlay cognitive network. The system comprises two primary users (PUs) and two secondary users (SUs). One of the SUs acts as a relay for the PUs and gains spectrum sharing as long as he respects outage probability constraints of the primary system. Moreover, we consider that the relaying node performs an optimal power allocation scheme that minimizes the outage performance of the secondary receiver. Closed form expressions for the outage probability are derived for the cases of Decode-and-Forward (DF), Amplify-and-Forward (AF), and adaptive relaying. Numerical simulations are presented to illustrate and compare the obtained results.

An Overview of Physical Layer Security in Wireless Communication Systems With CSIT Uncertainty

The concept of physical layer security builds on the pivotal idea of turning the channels imperfections, such as noise and fading, into a source of security. This is established through appropriately designed coding techniques and signal processing strategies. In this vein, it has been shown that fading channels can enhance the transmission of confidential information and that a secure communication can be achieved even when the channel to the eavesdropper is better than the main channel. However, to fully benefit from what fading has to offer, the knowledge of the channel state information at the transmitter (CSIT) is of primordial importance. In practical wireless communication systems, CSIT is usually obtained, prior to data transmission, through CSI feedback sent by the receivers. The channel links over which this feedback information is sent can be either noisy, rate-limited, or delayed, leading to CSIT uncertainty. In this paper, we present a comprehensive review of recent and ongoing research works on physical layer security with CSIT uncertainty. We focus on both information theoretic and signal processing approaches to the topic when the uncertainty concerns the channel to the wiretapper or the channel to the legitimate receiver. Moreover, we present a classification of the research works based on the considered channel uncertainty. Mainly, we distinguish between the cases when the uncertainty comes from an estimation error of the CSIT, from a CSI feedback link with limited capacity, or from an outdated CSI.

Outage Performance of Decode-and-Forward in Two-Way Relaying With Outdated CSI

In this paper, we analyze the outage behavior of decode-and-forward (DF) relaying in the context of selective two-way cooperative systems. First, a new relay selection metric is proposed to take into consideration both transmission rates and instantaneous link conditions between cooperating nodes. Afterward, the outage probability of the proposed system is derived for Nakagami-

Outage performance of two-way DF relaying systems with a new relay selection metric

m

Secure Broadcasting With Imperfect Channel State Information at the Transmitter

fading channels in the case when perfect channel state information (CSI) is available and then extended to the more realistic scenario where the available CSI is outdated due to fast fading. New expressions for the outage probability are obtained, and the impact of imperfect CSI on the performance is evaluated. Illustrative numerical results, Monte Carlo simulations, and comparisons with similar approaches are presented to assess the accuracy of our analytical derivations and confirm the performance gain of the proposed scheme.

On the Secrecy Capacity of the Multiple-Antenna Wiretap Channel with Limited CSI Feedback

This paper investigates a new constrained relay selection scheme for two-way relaying systems where two end terminals communicate simultaneously via a relay. The introduced technique is based on the maximization of the weighted sum rate of both users. To evaluate the performance of the proposed system, the outage probability is derived in a general case (where an arbitrary channel is considered), and then over independently but not necessarily identically distributed (i.n.i.d.) Rayleigh fading channels. The analytical results are verified through simulations.

On the secrecy capacity of the broadcast wiretap channel with imperfect channel state information

We investigate the problem of secure broadcasting over fast fading channels with imperfect main channel state information (CSI) at the transmitter. In particular, we analyze the effect of the noisy estimation of the main CSI on the throughput of a broadcast channel where the transmission is intended for multiple legitimate receivers in the presence of an eavesdropper. Besides, we consider the realistic case where the transmitter is only aware of the statistics of the eavesdroppers CSI and not of its channels realizations. First, we discuss the common message transmission case where the source broadcasts the same information to all the receivers, and we provide an upper and a lower bound on the ergodic secrecy capacity. For this case, we show that the secrecy rate is limited by the legitimate receiver having, on average, the worst main channel link and we prove that a nonzero secrecy rate can still be achieved even when the CSI at the transmitter is noisy. Then, we look at the independent messages case where the transmitter broadcasts multiple messages to the receivers, and each intended user is interested in an independent message. For this case, we present an expression for the achievable secrecy sum-rate and an upper bound on the secrecy sum-capacity and we show that, in the limit of large number of legitimate receivers K, our achievable secrecy sum-rate follows the scaling law log ((1-α)log(K)), where α is the estimation error variance of the main CSI. The special cases of high SNR, perfect and no-main CSI are also analyzed. Analytical derivations and numerical results are presented to illustrate the obtained expressions for the case of independent and identically distributed Rayleigh fading channels.

Performance analysis of cognitive multihop relaying with m-QAM detect-and-forward in Nakagami-m fading channels

We study the ergodic secrecy capacity of a block- fading wiretap channel when there are multiple antennas at the transmitter, the legitimate receiver and the eavesdropper. We consider that the receivers are aware of their respective channel matrices while the transmitter is only provided by a B-bits feedback of the main channel state information. The feedback bits are sent by the legitimate receiver, at the beginning of each fading block, over an error free public link with limited capacity. Assuming an average transmit power constraint, we provide an upper and a lower bounds on the ergodic secrecy capacity. Then, we present a framework to design the optimal codebooks for feedback and transmission. In addition, we show that the proposed lower and upper bounds coincide asymptotically as the capacity of the feedback link becomes large; hence, fully characterizing the secrecy capacity in this case.

Secure Multiple-Antenna Block-Fading Wiretap Channels With Limited CSI Feedback

In this paper, we consider secure broadcasting over fast fading channels. Assuming imperfect main channel state information (CSI) at the transmitter, we first provide an upper and a lower bounds on the ergodic secrecy capacity when a common message is broadcasted to multiple legitimate receivers in the presence of one eavesdropper. For this case, we show that the secrecy rate is limited by the legitimate receiver having, on average, the worst main channel link. Then, we present an expression for the achievable secrecy sum-rate when each legitimate receiver is interested in an independent message. The special cases of high SNR, perfect and no-main CSI are also analyzed. Numerical results are presented to illustrate the obtained results for the case of independent but not necessarily identically distributed Rayleigh fading channels.