Uncertainty about noise variance is unavoidable. Many existing works exploited the noise uncertainty for covert communication and meanwhile assumed that the adversary third party Willie adopts a radiometer detector, in which case a positive covert and reliable rate O(N) bits/N channel uses is achievable. Nonetheless, the radiometer is not optimal in general. The limit covert and reliable rate based on noise uncertainty against the optimal detector remains unknown. To shed light on this problem, this letter proves that when Willie suffers from noise uncertainty but has two or more antennas for detection, the limit covert and reliable rate over additive white Gaussian noise channels is O(N) bits/N channel uses. This rate is the same as the limit rate without the noise uncertainty, which means that the covert performance gain stemming from the noise uncertainty is indeed fragile. The key of the proof is the proposed correlation detector for Willie, which is easy to deploy and does not require any knowledge about channel coefficients or transmitter’s codebook.
Uncertainty about noise variance is unavoidable. Many existing works exploited the noise uncertainty for covert communication and meanwhile assumed that the adversary third party Willie adopts a radiometer detector, in which case a positive covert and reliable rate O(N) bits/N channel uses is achievable. Nonetheless, the radiometer is not optimal in general. The limit covert and reliable rate based on noise uncertainty against the optimal detector remains unknown. To shed light on this problem, this letter proves that when Willie suffers from noise uncertainty but has two or more antennas for detection, the limit covert and reliable rate over additive white Gaussian noise channels is O(N) bits/N channel uses. This rate is the same as the limit rate without the noise uncertainty, which means that the covert performance gain stemming from the noise uncertainty is indeed fragile. The key of the proof is the proposed correlation detector for Willie, which is easy to deploy and does not require any knowledge about channel coefficients or transmitter’s codebook.
Covert communication is achieved when a transmitter Al-ice can successfully transmit a message to a receiver Bob without being detected by an attentive and capable adversary Willie. Early results demonstrated the difficulty of the covert communications problem: with AWGN discrete-time channels between all parties, onlyO(n)bits can be sent innchannel uses. But it was soon recognized that uncertainty about the environment at Willie, for example, uncertainty in his own noise statistics, could allow for a positive rate:O(n)bits can be sent covertly innchannel uses. However, most covert communication results, including this promising positive rate result, have been obtained for a discrete-time communications channel. Here, we demonstrate that the assumption of a discrete-time channel is problematic when trying to exploit Willie's noise uncertainty. In particular, we demonstrate that if Alice transmitsω(T)bits in a lengthTinterval to Bob on a continuous-time channel, then there exists a detector at Willie that can detect her transmission, as the probability of false alarm and missed detectionPMD+PFA→0asT→∞. In other words, the communication is not covert, unlike the case of a discrete-time channel.
In this paper, we investigate covert communications under multi-antenna detection, and explore the impacts of the warden's channel state information (CSI) availability and the noise uncertainty on system covert capability. The detection performance at warden is analyzed in two cases under the perfect and statistical CSI at warden, respectively. In particular, for the former one, the warden utilizes the likelihood ratio (LR) detector, while for the latter one, the generalized likelihood ratio (GLR) detector is adopted. We first consider the scenario where the blocklength is finite, and demonstrate that the covert rate under both cases asymptotically goes to zero as the blocklength goes to infinity. Subsequently, we take the noise uncertainty at the warden into account which leads to positive covert rate, and characterize the covert rate for infinite blocklength. Specially, we derive the optimal transmit power for the legitimate transmitter that maximizes the covert rate. Besides, the rate gap under two cases, with different CSI availability at the warden, can be presented in closed form. Finally, numerical results validate the effectiveness of our theoretical analysis and also demonstrate the impacts of the factors studied on the system covertness.
Recent work has established that when transmitter Alice wishes to communicate reliably to recipient Bob without detection by warden Willie, with additive white Gaussian noise (AWGN) channels between all parties, communication is limited to O(√n) bits in n channel uses. However, this assumes that Willie has an accurate statistical characterization of the channel. When Willie has uncertainty about such and his receiver is limited to a threshold test on the received power, Alice can transmit covertly with a power that does not decrease with n, thus conveying O(n) bits covertly and reliably in n uses of an AWGN channel. Here, we consider covert communication of O(n) bits in n channel uses while generalizing the environment and removing any restrictions on Willie's receiver. We assume that an uninformed “jammer” is present to help Alice, and we consider AWGN and block fading channels. In some scenarios, Willie's optimal detector is a threshold test on the received power. When the channel between the jammer and Willie has multiple fading blocks per codeword, a threshold test on the received power is not optimal. However, we establish that Alice can remain covert with a transmit power that does not decrease with n even when Willie employs an optimal detector.
In this paper, we consider a covert communication system with a multi-antenna full-duplex (FD) receiver to enhance covert performance. More precisely, the receiver Bob (i.e., multiple antennas) selects the best antenna to receive the covert message, and then it sends artificial noise (AN) to the warden Willie causing uncertainty by utilizing an antenna among the remaining antennas. In order to take full advantage of multi-antenna technology, we consider two cases: (1) Willie does not know which antenna Bob chooses to send AN, and Willie knows only part of the channel information. (2) Willie knows which antenna Bob chooses to send AN, and Willie knows all the channel information. Based on the analysis of the optimal detection threshold, we derive the minimum detection error probability of the two cases. Furthermore, given the pre-determined convert constraints, the closed-form expression of the maximum effective convert rate is derived. When the power of AN sent by Bob is greater than that of covert message sent by the sender Alice, surprised research results are shown: (1) the detection error rate of case 1 is higher than that of case 2. (2) the effective covert rate of case 1 is always lower than that of case 2. The simulation results show that the proposed scheme is more conducive to sending covert messages for Alice; in addition, the numerical results imply that the maximum effective covert rate of the system using the multi-antenna FD receiver is significantly higher than that of the traditional dual-antenna FD receiver system.
Covert communication conceals transmission of messages between Alice and Bob from an adversary, Willie, who tries to determine if a transmission took place or not. While covert communication in a basic, standard setting where all variables are known to Willie, results in the well-known square-root law, when a jammer is present and assists Alice by creating uncertainty in Willie's decoder, a strictly positive transmission rate is possible. In this work, we analyze the case where the jammer is equipped with multiple antennas. Specifically, we analyze the effect of multiple antennas at the jammer on Alice's transmission power and consequently on the transmission rate. We consider both the case where the channel knowledge of Willie is known as well as the case where it is unknown. We formulate several optimization problems for the transmission strategies of the jammer to maximize his assistance to Alice, in terms of maximizing Bob's received SNR and consequently the covert rate. When the channel information is known to the jammer, we show that under an achievable covertness scheme, the optimal strategy of the jammer is to perform beamforming towards a single direction with all his available power. This direction though, is not trivial, since it reflects a tradeoff point between minimizing the interference at Bob and maximizing the interference at Willie. When the channel knowledge is unknown, we show that the optimal strategy of the jammer is either to transmit isotropically to all directions or to the null-space of Bob, where this choice depends on certain channel conditions. This is in contrast to current schemes in the literature. Furthermore, we extend the optimization problems to the case where Bob is also equipped with multiple antennas, and provide insightful results, shown to be asymptotically optimal, accompanied by simulations.
Covert wireless communication aims to establish a reliable link while hiding the transmission from an adversary. In wireless settings, uncertainty plays a central role in this tradeoff: it can help mask the signal from a warden, but it also complicates robust system design. This raises a basic question: under bounded uncertainty, are reliability and covertness governed by the same adverse conditions? If not, robust covert design cannot be reduced to a single worst-case environment. In this paper, we study this question in a covert wireless model with quasi-static fading, outage-based reliability at Bob and radiometric detection at Willie. Uncertainty is represented through bounded intervals for Bob's average channel strength and Willie's noise power. To obtain a tractable characterization, we adopt a conditional large-N midpoint-threshold surrogate for Willie's detector, parameterized by a Willie-side fading realization. Within this framework, we show that the reliability constraint is governed by Bob's smallest admissible channel parameter, whereas the covertness constraint is governed by Willie's smallest admissible noise level. This establishes a conflict-aware robust-design principle: the adverse realizations for reliability and covertness differ. Based on this result, we derive closed-form expressions for the robustly feasible transmit power and the corresponding robust optimal rate. Numerical results show that bounded uncertainty contracts the feasible region, monotonically reduces the robust optimal rate, and can cause substantial loss relative to the nominal design. Monte Carlo results further show that the conditional surrogate closely tracks the midpoint-threshold radiometer in the intended low-effective-SNR regime. Overall, the paper shows that even in a streamlined wireless setting, robust covert design requires different adverse-case reasoning for reliability and covertness.