Abstract
Correlated sources passing through broadcast channels is considered in this paper. Each receiver has access to correlated source side information and each source at the sender is kept secret from the unintended receiver. This communication model can be seen as generalizations of Tuncel’s source over broadcast channel and Villard et al.’s source over wiretap channel. An outer bound for secure transmission region of arbitrarily correlated sources with the equivocation-rate levels is derived with ultra-low latency and used to prove capacity results for several classes of sources and channels.
Highlights
The communication of two correlated sources S1 and S2S1 −H (S2) over broadcast channel (BC) p(y1, y2|x) with correlated side information (SI) S1 and S2 at the receivers is considered [1,2,3,4,5]
We studied broadcast channels with confidential sources (BCCS) and without side information [24], which generalizes Han-Costa model to secure situation by considering each source kept secret from the unintended recipient
(ii) Consider security constraints, S with secrecy level ES is admissible for wiretap channel, Receiver 1 is legitimate user, Receiver 2 can be seen as an eavesdropper, if
Summary
The communication of two correlated sources S1 and S2 over broadcast channel (BC) p(y1, y2|x) with correlated side information (SI) S1 and S2 at the receivers is considered [1,2,3,4,5]. Each source should be kept as secret as possible from the unintended receiver where the secrecy is measured by the equivocation rate [6,7,8,9] We refer to this model as the discrete memoryless BC-SI with two confidential sources (DM-BCCS-SI). We establish outer and inner bounds of secure transmission region of the DM-BCCS-SI, which consists of a set of admissible sources with a range of secrecy levels. (iii) Informational separation refers to classical separation in Shannon sense, that is, comparison of the optimal source coding rate region and the channel capacity region is sufficient to find the optimal secure transmission region. Remarks 1 Without the side information S1, S2, S ̄1, S ̄2, the bounds ( 2)-( 11) are reduced to the bounds given in [24, Theorem 2]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
