PROJECT TITLE :

Secure Broadcasting With Imperfect Channel State Information at the Transmitter - 2016

ABSTRACT:

We have a tendency to investigate the problem of secure broadcasting over fast fading channels with imperfect main channel state info (CSI) at the transmitter. In particular, we have a tendency to 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 contemplate the realistic case where the transmitter is only conscious of the statistics of the eavesdropper's CSI and not of its channel's realizations. Initial, we have a tendency to discuss the common message transmission case where the supply broadcasts the same info to all the receivers, and we tend to provide an higher and a lower bound on the ergodic secrecy capacity. For this case, we tend to show that the secrecy rate is limited by the legitimate receiver having, on average, the worst main channel link and we tend to prove that a nonzero secrecy rate will still be achieved even when the CSI at the transmitter is noisy. Then, we tend to study the independent messages case where the transmitter broadcasts multiple messages to the receivers, and every meant user is fascinated by an freelance message. For this case, we present an expression for the achievable secrecy total-rate and an upper certain on the secrecy total-capability and we tend to show that, within the limit of large number of legitimate receivers K, our achievable secrecy total-rate follows the scaling law log ((one-a)log(K)), where a is that the estimation error variance of the most CSI. The special cases of high SNR, excellent and no-main CSI also are analyzed. Analytical derivations and numerical results are presented to illustrate the obtained expressions for the case of independent and identically distributed Rayleigh fading channels.