RUcore Resource Object
RUcore Resource Object
PDF-1(1.30 MB)
TitleOpportunistic secret communication in wireless systems
NameLi, Zang (author), Trappe, Wade (chair), Yates, Roy (internal member), Mandayam, Narayan (internal member), Liu, Ruoheng (outside member), Rutgers University, Graduate School - New Brunswick,
Degree Date2009-10
Date Created2009
SubjectElectrical and Computer Engineering,
Wireless communication systems
DescriptionThis thesis examines the challenges of information-theoretic secret communication that exploits the temporal and spatial variations of the wireless medium to improve secret communication rates.
We first examine the secrecy capacity of a system consisting of independent parallel channels with one transmitter, one intended receiver and one eavesdropper. We show that the secrecy capacity of the system is the sum of the secrecy capacities of the individual subchannels. We further derive the optimal power allocation strategy for a system of parallel AWGN channels subject to a total power constraint, and also extend the results to random fading channels with additive Gaussian noise.
We then study the achievable secrecy rate with Gaussian random codes for the situation where the channel of the intended receiver is a constant AWGN channel, while the eavesdropper's channel is fast Rayleigh fading with unknown realizations but known statistics to the transmitter. The proposed method with artificial noise and bursting provides ways to achieve positive secrecy rate even when Bob's channel is worse than Eve's channel on average.
We also examine the achievable secrecy rate for a multiple antenna system, and the optimal input structure needed to achieve this rate. For the multiple input single output case, an analytical solution is derived. Multiple antenna systems provide extra degrees of freedom to the transmitter so that a beamforming-like approach can be used to provide advantage to the intended receiver against the eavesdropper.
Next we derive a secrecy capacity outer bound region for a class of one-sided interference channels. The outer bound is shown to be tight for a class of binary deterministic one-sided interference channels, and can be achieved within one bit for some Gaussian one-sided interference channels.
Finally, as Gaussian random codes are impractical, we evaluate achievable secrecy rates with discrete signaling. We observe that with discrete signaling, there exists an optimal power that maximizes the achievable secrecy rate. For the AWGN channel, larger constellation is always better. While for fading channel, the optimal constellation size varies with the power constraint, and discrete signaling can perform better than random Gaussian coding.
We first examine the secrecy capacity of a system consisting of independent parallel channels with one transmitter, one intended receiver and one eavesdropper. We show that the secrecy capacity of the system is the sum of the secrecy capacities of the individual subchannels. We further derive the optimal power allocation strategy for a system of parallel AWGN channels subject to a total power constraint, and also extend the results to random fading channels with additive Gaussian noise.
We then study the achievable secrecy rate with Gaussian random codes for the situation where the channel of the intended receiver is a constant AWGN channel, while the eavesdropper's channel is fast Rayleigh fading with unknown realizations but known statistics to the transmitter. The proposed method with artificial noise and bursting provides ways to achieve positive secrecy rate even when Bob's channel is worse than Eve's channel on average.
We also examine the achievable secrecy rate for a multiple antenna system, and the optimal input structure needed to achieve this rate. For the multiple input single output case, an analytical solution is derived. Multiple antenna systems provide extra degrees of freedom to the transmitter so that a beamforming-like approach can be used to provide advantage to the intended receiver against the eavesdropper.
Next we derive a secrecy capacity outer bound region for a class of one-sided interference channels. The outer bound is shown to be tight for a class of binary deterministic one-sided interference channels, and can be achieved within one bit for some Gaussian one-sided interference channels.
Finally, as Gaussian random codes are impractical, we evaluate achievable secrecy rates with discrete signaling. We observe that with discrete signaling, there exists an optimal power that maximizes the achievable secrecy rate. For the AWGN channel, larger constellation is always better. While for fading channel, the optimal constellation size varies with the power constraint, and discrete signaling can perform better than random Gaussian coding.
NotePh.D.
NoteIncludes bibliographical references (p. 129-134)
Noteby Zang Li
Genretheses
Persistent URLhttp://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051859
Languageeng
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work