Treating Interference as Noise Is Optimal for Covert Communication Over Interference Channels

Cho, Kang-Hee; Lee, Si-Hyeon

doi:10.1109/tifs.2020.3013213

Cited by 30 publications

(6 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such result is also called the square root law (SRL). Subsequent works have extended this result to various channel models such as binary symmetric channels [15], broadcast communications [16], multiple access channels [17], and interference channels [18].…”

Section: Introductionmentioning

confidence: 85%

Optimal Probabilistic Constellation Shaping for Covert Communications

Haihong

et al. 2022

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

In this paper, we investigate the optimal probabilistic constellation shaping design for covert communication systems from a practical view. Different from conventional covert communications with equiprobable constellations modulation, we propose non-equiprobable constellations modulation schemes to further enhance the covert rate. Specifically, we derive covert rate expressions for practical discrete constellation inputs for the first time. Then, we study the covert rate maximization problem by jointly optimizing the constellation distribution and power allocation. In particular, an approximate gradient descent method is proposed for obtaining the optimal probabilistic constellation shaping. To strike a balance between the computational complexity and the transmission performance, we further develop a framework that maximizes a lower bound on the achievable rate where the optimal probabilistic constellation shaping problem can be solved efficiently using the Frank-Wolfe method. Extensive numerical results show that the optimized probabilistic constellation shaping strategies provide significant gains in the achievable covert rate over the state-of-the-art schemes.

show abstract

Section: Introductionmentioning

confidence: 85%

Optimal Probabilistic Constellation Shaping for Covert Communications

Haihong

et al. 2022

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

show abstract

“…Note that the transmission rate approaches zero as n grows to infinity. This seminal theorem has subsequently been extended to various channel models, including discrete memoryless channels [26][27][28], binary symmetric channels [29], state-dependent channels [30], and multi-user channels [31][32][33][34][35], etc.…”

Section: Related Workmentioning

confidence: 99%

Optimization of Covert Communication in Multi-Sensor Asymmetric Noise Systems

Qiao,

Zhu,

et al. 2024

Sensors

View full text Add to dashboard Cite

This work investigates wireless covert communication in a multi-sensor asymmetric noise scenario. We adopt KL (Kullback–Leibler) divergence as the covertness constraint metric and mutual information as the transmission rate metric. To accurately approximate KL divergence and mutual information in covert communication, we employ the Taylor series expansion technique. Analytical expressions for KL divergence and mutual information in covert communication are derived, and we optimize the amplitude gain and phase angles based on these analytical expressions. Our findings underscore the importance of phase angle selection in covert communication within asymmetric noise systems. We propose an effective method for optimizing the transmission amplitude gain and phase angles in scenarios with asymmetric noise. Numerical results validate the effectiveness and superiority of our proposed method.

show abstract

“…multiuser channels [18]- [22], channel with states [23], [24], channel with jammers [25]- [28], Rayleigh-fading channels [29]- [31], continuous-time channels [32]- [34], quantum channels [35]- [37], MIMO channels [38], adhoc networks [39], [40], etc. In addition to characterizing the information-theoretic limits, researchers have also studied covert communication from a coding perspective, and have investigated various coding techniques such as concatenated codes [41], PPM [8], multilevel coding with PPM [42]- [44], and polar codes [45].…”

Section: B Related Workmentioning

confidence: 99%

Covert Communication With Mismatched Decoders

Zhang¹,

Tan²

2021

Preprint

View full text Add to dashboard Cite

This paper considers the problem of covert communication with mismatched decoding, in which a sender wishes to reliably communicate with a receiver whose decoder is fixed and possibly sub-optimal, and simultaneously to ensure that the communication is covert with respect to a warden. We present single-letter lower and upper bounds on the information-theoretically optimal throughput as a function of the given decoding metric, channel laws, and the desired level of covertness. These bounds match for a variety of scenarios of interest, such as (i) when the channel between the sender and receiver is a binary-input binary-output channel, and (ii) when the decoding metric is particularized to the so-called erasures-only metric. The lower bound is obtained based on a modified random coding union bound with pulse position modulation (PPM) codebooks, coupled with a non-standard expurgation argument. The proof of the upper bound relies on a non-trivial combination of analytical techniques for the problems of covert communication and mismatched decoding.

show abstract

Treating Interference as Noise Is Optimal for Covert Communication Over Interference Channels

Cited by 30 publications

References 26 publications

Optimal Probabilistic Constellation Shaping for Covert Communications

Optimal Probabilistic Constellation Shaping for Covert Communications

Optimization of Covert Communication in Multi-Sensor Asymmetric Noise Systems

Covert Communication With Mismatched Decoders

Contact Info

Product

Resources

About