The secrecy rate of limited feedback beamforming is studied for a Multiple-Input Single-Output (MISO) wiretap channel with a multi-antenna eavesdropper. We first obtain the secrecy rate of limited feedback beamforming achieved at the legitimate receiver. We then derive a lower bound for the asymptotic secrecy rate in the large system limit. From this bound, we observe a threshold for the ratio of eavesdrop antennas to transmit antennas to obtain a positive secrecy rate. We further show that the secrecy rate loss due to limited feedback decays with the number of feedback bits per transmit antenna.
The secrecy rate of limited feedback beamforming is studied for a Multiple-Input Single-Output (MISO) wiretap channel with a multi-antenna eavesdropper. We first obtain the secrecy rate of limited feedback beamforming achieved at the legitimate receiver. We then derive a lower bound for the asymptotic secrecy rate in the large system limit. From this bound, we observe a threshold for the ratio of eavesdrop antennas to transmit antennas to obtain a positive secrecy rate. We further show that the secrecy rate loss due to limited feedback decays with the number of feedback bits per transmit antenna.
In this paper, we investigate the secrecy performance for a multiple-input multiple-output (MIMO) wiretap channel in the presence of a multiantenna eavesdropper. In particular, the legitimate transmitter uses transmit antenna selection (TAS) to transmit on a single antenna with the largest signal-to-noise ratio (SNR) while both the legitimate receiver and the eavesdropper adopt maximal ratio combining (MRC) for reception. We derive exact closed-form expressions for the probabilities of achieving positive secrecy rate and secrecy outage in the case of imperfect feedback due to feedback delay and/or feedback error. Furthermore, we derive the asymptotic secrecy outage probability at high SNR, which accurately reveals the secrecy diversity loss due to imperfect feedback. Simulation results are provided to verify our analytical results and illustrate the impact of imperfect feedback on the secrecy performance of such a wiretap system.
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.
This paper studies the beamforming design of a multiple-input single-output system with eavesdropping, when a quantized channel feedback is available. We consider two basic cases a) the beamforming vector belongs to the quantization codebook and b) the beamforming design is not limited to the quantization codebook. For the first case, we design two beamforming schemes that incorporate a feedback channel from the eavesdropper, which provides the direction of its physical channel or the direction of its null-space. For the case where the codebook constraint is relaxed, we design an optimal beamformer that requires feedback from both receivers as well as a scheme that transmits towards the quantized null-space of the eavesdropper's channel. The ergodic secrecy rate is derived in closed-form and we show that all schemes suffer from a secrecy rate floor for a constant-size feedback. Simplified asymptotic expressions are proposed and the scaling laws of the feedback, which ensure constant secrecy losses, are provided.
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.
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.
We study strategies for enhanced secrecy using cooperative jamming in secure communication systems with limited rate feedback. A Gaussian multiple-input multiple-output (MIMO) wiretap channel with a jamming helper is considered. The transmitter and helper both require channel state information (CSI), which is quantized at the receiver and fed back through two sum-rate-limited feedback channels. The quantization errors result in reduced beamforming gain from the transmitter, as well as interference leakage from the helper. First, under the assumption that the eavesdropper's CSI is completely unknown, we derive a lower bound on the average main channel rate and find the feedback bit allocation that maximizes the jamming power under a constraint on the bound. For the case where statistical CSI for the eavesdropper's channel is available, we derive a lower bound on the average secrecy rate, and we optimize the bound to find a suitable bit allocation and the transmit powers allocated to the transmitter and helper. For the case where the transmitter and helper have the same number of antennas, we obtain a closed-form solution for the optimal bit allocation. Simulations verify the theoretical analysis and demonstrate the significant performance gain that results with intelligent feedback bit allocation and power control.