The two-user Gaussian fading broadcast channel

Jafarian, Amin; Vishwanath, Sriram

doi:10.1109/isit.2011.6034121

Cited by 19 publications

(19 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the achievable scheme, it is clear that allowing each receiver to decode both messages from the two transmitters provides an inner bound, i.e., (19), of the capacity region. We now establish a matching outer bound, by showing that (20) is an outer bound of the capacity region of the considered model, where a genie bestows the information of the interference to only one of the receivers, e.g., the second receiver, which is equivalent to setting h 21 = 0. By this genie aided channel, we aim to prove 6 .…”

Section: Validation Of Fmentioning

confidence: 99%

See 1 more Smart Citation

On Stochastic Orders and Fading Gaussian Multi-User Channels with Statistical CSIT

Lin

Jorswieck

Janda

et al. 2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

In this paper, fading Gaussian multiuser channels are considered. If the channel is perfectly known to the transmitter, capacity has been established for many cases in which the channels may satisfy certain information theoretic orders such as degradedness or strong/very strong interference. Here, we study the case when only the statistics of the channels are known at the transmitter which is an open problem in general. The main contribution of this paper is the following: First, we introduce a framework to classify random fading channels based on their joint distributions by leveraging three schemes: maximal coupling, coupling, and copulas. The underlying spirit of all scheme is, we obtain an equivalent channel by changing the joint distribution in such a way that it now satisfies a certain information theoretic order while ensuring that the marginal distributions of the channels to the different users are not changed. The construction of this equivalent multi-user channel allows us to directly make use of existing capacity results, which includes Gaussian interference channels, Gaussian broadcast channels, and Gaussian wiretap channels. We also extend the framework to channels with a specific memory structure, namely, channels with finite-state, wherein the Markov fading broadcast channel is discussed as a special case. Several practical examples such as Rayleigh fading and Nakagami-m fading illustrate the applicability of the derived results.

show abstract

Section: Validation Of Fmentioning

confidence: 99%

“…After comparing the outer bounds (73) and (77) to (19) and (20), we can observe that decoding both messages at each receiver can achieve the capacity region outer bound.…”

mentioning

confidence: 99%

On Stochastic Orders and Fading Gaussian Multi-User Channels with Statistical CSIT

Lin

Jorswieck

Janda

et al. 2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

show abstract

“…The achievable rate region derived in [6] is the best known achievable rate region for a general discrete memoryless BC. The work in [5] provided a partial characterization of the capacity region of the two-user Gaussian fading broadcast channel.…”

Section: A Related Workmentioning

confidence: 99%

“…The stability region of the system is obtained by taking union of R 1 and R 2 , i.e., R = R 1 ∪ R 2 , where R 1 and R 2 corresponds to the stability regions of dominant systems in (4) and (5), respectively. The stability region above is expressed as a function of the success probabilities without the secrecy constraint i.e., P D i/T , and with the secrecy constraint i.e., P D s i/i,T .…”

Section: A the Stability Region Of The General Casementioning

confidence: 99%

See 1 more Smart Citation

Secure Communications for the Two-User Broadcast Channel With Random Traffic

Mohapatra

Παππάς

Lee

et al. 2018

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

In this work, we study the stability region of the two-user broadcast channel (BC) with bursty data arrivals and security constraints. We consider the scenario, where one of the receivers has a secrecy constraint and its packets need to be kept secret from the other receiver. This is achieved by employing fullduplexing at the receiver with the secrecy constraint, so that it transmits a jamming signal to impede the reception of the other receiver. In this context, the stability region of the two-user BC is characterized for the general decoding case. Then, assuming two different decoding schemes the respective stability regions are derived. The effect of self-interference due to the full-duplex operation on the stability region is also investigated. The stability region of the BC with a secrecy constraint, where the receivers do not have full duplex capability can be obtained as a special case of the results derived in this paper. In addition, the paper considers the problem of maximizing the saturated throughput of the queue, whose packets does not require to be kept secret under minimum service guarantees for the other queue. The results provide new insights on the effect of the secrecy constraint on the stability region of the BC. In particular, it is shown that the stability region with secrecy constraint is sensitive to the coefficient of self-interference cancelation under certain cases.

show abstract

Delay Performance of a Two-User Broadcast Channel with Security Constraints

et al. 2019

View full text Add to dashboard Cite

In this paper, we consider the two-user broadcast channel with security constraints. We assume that a source broadcasts packets to two receivers, and that one of them has secrecy constraints, i.e., its packets need to be kept secret from the other receiver. The receiver with secrecy constraint has full-duplex capability, allowing it to transmit a jamming signal to increase its secrecy. We derive the average delay per packet and provide simulations and numerical results, where we compare different performance metrics for the cases when both receivers treat interference as noise, when the legitimate receiver performs successive decoding, and when the eavesdropper performs successive decoding. The results show that successive decoding provides better average packet delay for the legitimate user. Furthermore, we define a new metric that characterizes the reduction on the success probability for the legitimate user that is caused by the secrecy constraint. The results show that secrecy poses a significant amount of packet delay for the legitimate receiver when either receiver performs successive decoding. We also formulate an optimization problem, wherein the throughput of the eavesdropper is maximized under delay and secrecy rate constraints at the legitimate receiver. We provide numerical results for the optimization problem, where we show the trade-off between the transmission power for the jamming and the throughput of the non-legitimate receiver. The results provide insights into how channel ordering and encoding differences can be exploited to improve performance under different interference conditions.

show abstract

The two-user Gaussian fading broadcast channel

Cited by 19 publications

References 9 publications

On Stochastic Orders and Fading Gaussian Multi-User Channels with Statistical CSIT

On Stochastic Orders and Fading Gaussian Multi-User Channels with Statistical CSIT

Secure Communications for the Two-User Broadcast Channel With Random Traffic

Delay Performance of a Two-User Broadcast Channel with Security Constraints

Contact Info

Product

Resources

About