In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the throughput of multi-user broadcast wiretap channels. We consider that the transmitter is only provided by a b -bits feedback of the main channel state information (CSI) sent by each legitimate receiver, at the beginning of each fading block, over error-free public links with limited capacity. Also, we assume that the transmitter is aware of the statistics of the eavesdropper's CSI but not of its channel's realizations. Under these assumptions of CSI uncertainty, we characterize the ergodic secrecy capacity of the system when a common message is broadcasted to all legitimate receivers, the ergodic secrecy sum-capacity when multiple independent messages are transmitted, and the ergodic secrecy capacity region for the broadcast channel with confidential messages (BCCM). In all three scenarios, we show that as long as the transmitter has some knowledge of the main CSI, obtained even through a 1-bit CSI feedback, a non-zero secrecy rate can still be achieved. The impact of having the feedback sent over a binary erasure channel (BEC) is also investigated for the BCCM case. Here again, and even with the possibility of having the feedback bits erased, a positive secrecy rate can still be achieved as long as the erasure event is not a probability-one event. An asymptotic analysis of the obtained results is provided for the high SNR regime, and the scaling law of the system, when the number of legitimate receivers is large, is also presented.

Spectrum sharing and device-to-device (D2D) transmission are among the key features of modern communication networks. In this work, we are particularly interested in these two techniques from a sharing for secrecy perspective. The considered communication model consists of a multi-user cellular system and an underlying secondary system comprising K D2D pairs. All cellular and D2D transmissions are subject to an eavesdropping attack. Given a predefined secrecy condition, imposed by the primary system to guarantee a desired secrecy throughput, KS D2D pairs are allowed to share the spectrum and send their secret data while the remaining K-KS device transmitters operate as cooperative jammers. First, we characterize the achievable secrecy rates for both systems under a joint secrecy constraint on all transmitted cellular and D2D messages. Then, we propose a device selection scheme to determine the optimal number of devices, KS, that maximizes the secrecy throughput of the secondary system while satisfying the primary's secrecy condition. The obtained results show that both parties can win under the proposed transmission scheme; the cellular system can significantly improve its secrecy throughput, and the D2D pairs get to share the spectrum and achieve secure transmissions.

In this work, we investigate the ergodic secrecy rate region of a block-fading spectrum-sharing system, where a D2D communication is underlying a cellular channel. We consider that both the primary and the secondary transmissions require their respective transmitted messages to be kept secret from a common eavesdropper under a joint secrecy constraint. The presented results are for three different scenarios, each corresponding to a particular requirement of the cellular system. First, we consider the case of a fair cellular system, and we show that the impact of jointly securing the transmissions can be balanced between the primary and the secondary systems. The second scenario examines the case when the primary network is demanding and requires the secondary transmission to be at a rate that is decodable by the primary receiver, while the last scenario assumes a joint transmission of artificial noise by the primary and the secondary transmitters. For each scenario, we present an achievable ergodic secrecy rate region that can be used as an indicator for the cellular and the D2D systems to agree under which terms the spectrum will be shared.

In this paper, we investigate the ergodic secrecy capacity of a block-fading wiretap channel with limited channel knowledge at the transmitter. We consider that the legitimate receiver, the eavesdropper, and the transmitter are equipped with multiple antennas and that the receiving nodes are aware of their respective channel matrices. On the other hand, the transmitter is only provided by a B-bit 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. The statistics of the main and the eavesdropper channel state information are known at all nodes. Assuming an average transmit power constraint, we establish upper and 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, i.e., B→∞, hence fully characterizing the ergodic secrecy capacity in this case. Besides, we analyze the asymptotic behavior of the presented secrecy rates, at high signal-to-noise ratio, and evaluate the gap between the bounds.

In this work, we examine the secrecy capacity region of the block-fading broadcast channel with confidential messages (BCC) when the transmitter has limited knowledge of the channel. In particular, we consider a two-user communication system where the transmitter has one common message to be transmitted to both users and one confidential message intended to only one of them. The confidential message has to be kept secret from the other user to whom the information is not intended. The transmitter is not aware of the channel state information (CSI) of neither channel and is only provided by limited CSI feedback sent at the beginning of each fading block. Assuming an error-free feedback link, we characterize the secrecy capacity region of this channel and show that even with a 1-bit CSI feedback, a positive secrecy rate can still be achieved. Then, we look at the case where the feedback link is not error- free and is rather a binary erasure channel (BEC). In the latter case, we provide an achievable secrecy rate region and show that as long as the erasure event is not a probability 1 event, the transmitter can still transmit the confidential information with a positive secrecy rate.

In this paper, we investigate the problem of secure broadcasting over block-fading channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having imperfect channel state information (CSI) via a finite rate feedback on the throughput of a broadcast channel where the transmission is intended for multiple legitimate receivers in the presence of an eavesdropper. First, we partially characterize the ergodic secrecy capacity of the system when the source broadcasts the same information to all the receivers, i.e., common message transmission. Then, we look at the independent messages case, where the transmitter broadcasts multiple independent messages to the legitimate receivers. For this case, we present lower and upper bounds on the ergodic secrecy sum-capacity. In both scenarios, we show that the proposed lower and upper bounds coincide asymptotically as the capacity of the feedback links becomes large, hence, fully characterizing the secrecy capacity in this case.

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 eavesdropper's CSI and not of its channel's 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.

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.

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.

In this paper, a delay-sensitive multi-hop wireless sensor network is considered, employing an M/G/1 with vacations framework. Sensors transmit measurements to a predefined data sink subject to maximum end-to-end delay constraint. In order to prolong the battery lifetime, a sleeping scheme is adopted throughout the network nodes. The objective of our proposed framework is to present an expression for maximum hop-count as well as an approximate expression of the probability of blocking at the sink node upon violating certain end-to-end delay threshold. Using numerical simulations, we validate the proposed analytical model and demonstrate that the blocking probability of the system for various vacation time distributions matches the simulation results.

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.

In this work, we investigate the performance of cognitive multihop regenerative relaying systems in the “underlay” spectrum sharing scenario. The multiple relays perform “detect-and-forward” relaying strategy to convey a message with an order m quadrature amplitude modulation (m-QAM) from the source to the destination over independent but not necessarily identical Nakagami-m fading channels. We adopt a closed-form analysis framework based on univariate and bivariate Meijer G-functions to derive the end-to-end error performance (in terms of bit and symbol error rates), the outage probability, and the ergodic capacity. Various numerical examples are presented to illustrate the results with a large combination of system and fading parameters, and simulation results confirm the accuracy of our closed-form analysis.

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.

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.