TY - GEN
T1 - Gaussian fading channel with secrecy outside a bounded range
AU - Zou, Shaofeng
AU - Liang, Yingbin
AU - Shamai, Shlomo
N1 - Publisher Copyright: © 2017 IEEE.
PY - 2017/12/19
Y1 - 2017/12/19
N2 - The Gaussian fading channel is studied, in which the channel from the transmitter to the receiver is corrupted by a multiplicative fading coefficient H and an additive Gaussian random noise. It is assumed that the channel is experiencing block fading, and the transmitter does not know the channel state information (CSI). The receiver is assumed to have full knowledge of the CSI. If the channel state is better, then more information is required to be decoded by the receiver, and if the channel state is worse, more information is required to be secure from the receiver. Furthermore, the information intended to be decoded by the receiver with a better state (e.g., |H| ≥ |h0|) is required to be secure from the receiver if it has a state worse than |h0| by Δ (i.e., |H| ≤ |h0| - Δ), which is referred to as secrecy outside a bounded range. A (layered) broadcast approach is studied for this problem, which views the fading channel as a degraded broadcast channel with a number of receivers each experiencing a different fading coefficient. The achievable scheme designates one superposition layer to each message with binning employed to protect all upper-layer messages from lower-layer receivers. Furthermore, the scheme allows adjacent layers to share rates so that part of the rate of each message can be shared with its upper-layer messages to enlarge the rate region. The achievable secrecy rate region via the broadcast approach is characterized. The developed scheme can adapt the transmission rate to the actual unknown channel state without exploiting the CSI at the transmitter.
AB - The Gaussian fading channel is studied, in which the channel from the transmitter to the receiver is corrupted by a multiplicative fading coefficient H and an additive Gaussian random noise. It is assumed that the channel is experiencing block fading, and the transmitter does not know the channel state information (CSI). The receiver is assumed to have full knowledge of the CSI. If the channel state is better, then more information is required to be decoded by the receiver, and if the channel state is worse, more information is required to be secure from the receiver. Furthermore, the information intended to be decoded by the receiver with a better state (e.g., |H| ≥ |h0|) is required to be secure from the receiver if it has a state worse than |h0| by Δ (i.e., |H| ≤ |h0| - Δ), which is referred to as secrecy outside a bounded range. A (layered) broadcast approach is studied for this problem, which views the fading channel as a degraded broadcast channel with a number of receivers each experiencing a different fading coefficient. The achievable scheme designates one superposition layer to each message with binning employed to protect all upper-layer messages from lower-layer receivers. Furthermore, the scheme allows adjacent layers to share rates so that part of the rate of each message can be shared with its upper-layer messages to enlarge the rate region. The achievable secrecy rate region via the broadcast approach is characterized. The developed scheme can adapt the transmission rate to the actual unknown channel state without exploiting the CSI at the transmitter.
UR - http://www.scopus.com/inward/record.url?scp=85042617256&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/CNS.2017.8228688
DO - https://doi.org/10.1109/CNS.2017.8228688
M3 - منشور من مؤتمر
T3 - 2017 IEEE Conference on Communications and Network Security, CNS 2017
SP - 545
EP - 549
BT - 2017 IEEE Conference on Communications and Network Security, CNS 2017
T2 - 2017 IEEE Conference on Communications and Network Security, CNS 2017
Y2 - 9 October 2017 through 11 October 2017
ER -