Secure Broadcasting with Imperfect Channel State Information at the Transmitter

Handle URI:
http://hdl.handle.net/10754/582496
Title:
Secure Broadcasting with Imperfect Channel State Information at the Transmitter
Authors:
Hyadi, Amal; Rezki, Zouheir; Khisti, Ashish; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Abstract:
We investigate the problem of secure broadcasting over fast fading channels with imperfect main channel state information (CSI) at the transmitter. In particular, we 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 consider the realistic case where the transmitter is only aware of the statistics of the eavesdropper’s CSI and not of its channel’s realizations. First, we discuss the common message transmission case where the source broadcasts the same information to all the receivers, and we provide an upper and a lower bounds on the ergodic secrecy capacity. For this case, we show that the secrecy rate is limited by the legitimate receiver having, on average, the worst main channel link and we prove that a non-zero secrecy rate can still be achieved even when the CSI at the transmitter is noisy. Then, we look at the independent messages case where the transmitter broadcasts multiple messages to the receivers, and each intended user is interested in an independent message. For this case, we present an expression for the achievable secrecy sum-rate and an upper bound on the secrecy sum-capacity and we show that, in the limit of large number of legitimate receivers K, our achievable secrecy sum-rate follows the scaling law log((1−) log(K)), where is the estimation error variance of the main CSI. The special cases of high SNR, perfect and no-main CSI are also analyzed. Analytical derivations and numerical results are presented to illustrate the obtained expressions for the case of independent and identically distributed Rayleigh fading channels.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Secure Broadcasting with Imperfect Channel State Information at the Transmitter 2015:1 IEEE Transactions on Wireless Communications
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Transactions on Wireless Communications
Issue Date:
13-Nov-2015
DOI:
10.1109/TWC.2015.2500563
Type:
Article
ISSN:
1536-1276
Additional Links:
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7328736
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorHyadi, Amalen
dc.contributor.authorRezki, Zouheiren
dc.contributor.authorKhisti, Ashishen
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2015-11-22T12:12:11Zen
dc.date.available2015-11-22T12:12:11Zen
dc.date.issued2015-11-13en
dc.identifier.citationSecure Broadcasting with Imperfect Channel State Information at the Transmitter 2015:1 IEEE Transactions on Wireless Communicationsen
dc.identifier.issn1536-1276en
dc.identifier.doi10.1109/TWC.2015.2500563en
dc.identifier.urihttp://hdl.handle.net/10754/582496en
dc.description.abstractWe investigate the problem of secure broadcasting over fast fading channels with imperfect main channel state information (CSI) at the transmitter. In particular, we 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 consider the realistic case where the transmitter is only aware of the statistics of the eavesdropper’s CSI and not of its channel’s realizations. First, we discuss the common message transmission case where the source broadcasts the same information to all the receivers, and we provide an upper and a lower bounds on the ergodic secrecy capacity. For this case, we show that the secrecy rate is limited by the legitimate receiver having, on average, the worst main channel link and we prove that a non-zero secrecy rate can still be achieved even when the CSI at the transmitter is noisy. Then, we look at the independent messages case where the transmitter broadcasts multiple messages to the receivers, and each intended user is interested in an independent message. For this case, we present an expression for the achievable secrecy sum-rate and an upper bound on the secrecy sum-capacity and we show that, in the limit of large number of legitimate receivers K, our achievable secrecy sum-rate follows the scaling law log((1−) log(K)), where is the estimation error variance of the main CSI. The special cases of high SNR, perfect and no-main CSI are also analyzed. Analytical derivations and numerical results are presented to illustrate the obtained expressions for the case of independent and identically distributed Rayleigh fading channels.en
dc.language.isoenen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7328736en
dc.rights(c) 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.en
dc.subjectSecure broadcastingen
dc.subjectcommon message broadcasten
dc.subjectergodic secrecy capacityen
dc.subjectimperfect channel state informationen
dc.subjectindependent messages broadcasten
dc.titleSecure Broadcasting with Imperfect Channel State Information at the Transmitteren
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalIEEE Transactions on Wireless Communicationsen
dc.eprint.versionPost-printen
dc.contributor.institutionElectrical and Computer Engineering Department, University of Toronto, Toronto, ON, Canadaen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
kaust.authorHyadi, Amalen
kaust.authorRezki, Zouheiren
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.