Skip to main content

Optimal Power Allocation in Block Fading Channels With Confidential Messages

Author(s): Chorti, Arsenia; Papadaki, Katerina; Poor, H Vincent

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1z78b
Abstract: The optimal power allocation for block fading (BF) networks with confidential messages is investigated under an M -block delay and power constraint. First, we study networks without channel state information (CSI) feedback to the transmitter and demonstrate that the optimal power allocation is the equidistribution of the power budget, denoted as the “blind policy.” In blind scenarios secrecy can be achieved through receiver diversity; the probability of secrecy outage (PSO) is shown to decay exponentially with the diversity order of the legitimate user. Then, we investigate networks with CSI feedback. For comparison purposes, we restate the acausal secure waterfilling algorithm with full CSI before moving to the causal feedback scenario. In the latter, an approximate “threshold policy” for the low SNR and an approximate “high power policy” for the high SNR regimes are derived. Furthermore, a novel universal transmission policy is proposed across all SNRs, denoted as the “blind horizon approximation” (BHA). Through numerical results, the BHA policy is shown to outperform both the threshold and high power policies when the legitimate user has an SNR advantage with respect to the eavesdropper, while it also compares well with the secure waterfilling policy.
Publication Date: Sep-2015
Citation: Chorti, Arsenia, Katerina Papadaki, and H. Vincent Poor. "Optimal power allocation in block fading channels with confidential messages." IEEE Transactions on Wireless Communications 14, no. 9 (2015): 4708-4719. doi:10.1109/TWC.2015.2424964
DOI: 10.1109/TWC.2015.2424964
ISSN: 1536-1276
EISSN: 1558-2248
Pages: 4708 - 4719
Type of Material: Journal Article
Journal/Proceeding Title: IEEE Transactions on Wireless Communications
Version: Author's manuscript



Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.