This paper investigates the limit covert rate of the backscatter communication systems based on undecodable ambient radio frequency (RF) signals over additive white Gaussian noise channel. In the considered network, source node Alice expects to transmit information to receiver Bob without being detected by warden Willie, by backscattering undecodable ambient RF signals. In this case, it is challenging for Bob to recover the information from Alice, since the undecodable signals result in both unknown additive and multiplicative interference. A subtle communication strategy is proposed to alleviate the influences of the interference, by which we prove that no matter Willie can or cannot decode the information from the RF source and then eliminate its interference, the limit covert rate is subject to the well-known square root law (i.e.,O(√n) bits pernchannel uses). This interesting result means that even if the RF source is a cooperative node of Willie (e.g., a jammer deployed by Willie to restrict Alice from active transmission), Alice can still covertly and reliably transmit information to Bob by backscattering the ambient RF signals (e.g., the malicious jamming signals).
This paper investigates the limit covert rate of the backscatter communication systems based on undecodable ambient radio frequency (RF) signals over additive white Gaussian noise channel. In the considered network, source node Alice expects to transmit information to receiver Bob without being detected by warden Willie, by backscattering undecodable ambient RF signals. In this case, it is challenging for Bob to recover the information from Alice, since the undecodable signals result in both unknown additive and multiplicative interference. A subtle communication strategy is proposed to alleviate the influences of the interference, by which we prove that no matter Willie can or cannot decode the information from the RF source and then eliminate its interference, the limit covert rate is subject to the well-known square root law (i.e.,O(√n) bits pernchannel uses). This interesting result means that even if the RF source is a cooperative node of Willie (e.g., a jammer deployed by Willie to restrict Alice from active transmission), Alice can still covertly and reliably transmit information to Bob by backscattering the ambient RF signals (e.g., the malicious jamming signals).
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.
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.
Covert communication enables Alice to transmit to Bob while making the transmission difficult for Willie to detect. We study a scalar Gaussian covert-overlay model in which Alice's low-power covert signal is superimposed on an aggregate public component generated by Alice or other trackable sources. Willie is given all physically obtainable side information, including protocol details, timing, pilots, channel estimates, and calibration information, and subtracts his best estimate of the public component before testing. Covertness is imposed on the resulting residual through a relative-entropy constraint with budget δ conditioned on Willie's side information. In the stationary case, the residual under no covert transmission has variance σ02=σW2+σe2, where σW2 is Willie's receiver-noise variance and σe2 is the irreducible cancellation error. Over n channel uses, the maximal reliably transmissible covert payload is RC⋆n(1+o(1)) bits, where RC⋆=σB2ln2σ02δ, and σB2 is Bob's receiver-noise variance. Thus, the square-root-law (SRL) constant is governed by the variance at Willie's actual detector input, not by receiver noise alone. Low-power Gaussian signaling achieves this constant, and a matching converse establishes first-order optimality within the conditioned additive Gaussian innovation model. For known time-varying conditioned residual variances, we also derive the first-order allocation, which assigns more covert power to larger residual variances. The results require a Gaussian post-cancellation null residual with known conditioned variance; non-Gaussian residuals and fixed non-vanishing variance uncertainty are outside the scope of this paper.
Covert communication can prevent an adversary from knowing that a wireless transmission has occurred. In additive white Gaussian noise (AWGN) channels, a square root law is found that Alice can reliably and covertly transmit O(n) bits to Bob in n channel uses. In this paper, we consider covert communications in noisy wireless networks, where the receivers not only experience the background noise, but also the aggregate interference from other transmitters. Our results show that uncertainty in interference experienced by the adversary Willie is beneficial to Alice. In AWGN channels, when the distance between Alice and Willie da,w=ω(n1/(2α)) (α is the path loss exponent), Alice can reliably and covertly transmit O(log2n) bits to Bob in n channel uses. Although the covert throughput is lower than the square root law, the spatial throughput is higher. In THz (Terahertz) Band networks,covert communication is more difficult because Willie can simply place a receiver in the narrow beam between Alice and Bob to detect or block their LOS (Line-of-Sight) communications. We then present a covert communication scheme that utilizes the reflection or diffuse scattering from a rough surface to prevent being detected by Willie. From the network perspective, the communications are hidden in the interference of noisy wireless networks, and what Willie sees is merely a "shadow" wireless network.
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 result is predicated on Willie having an accurate statistical characterization of the background noise. When Willie has uncertainty about his noise characteristics and his receiver is limited to a power detector, O(n) bits can be covertly delivered. Here, we establish covert communication of O(n) bits in n channel uses while: (i) generalizing the environment; and (ii) removing any restrictions on Willie's receiver. We consider the case where an additional node, called the "jammer", is present to help Alice and Bob communicate covertly. This jammer is termed "uninformed", as it does not know the content or timing of Alice's transmission. We consider both AWGN channels and a scenario with a block faded jammer with a single fade per codeword. In these scenarios, we are able to establish the optimality of the power detector for Willie, from which the achievability of reliable and covert communication at a positive rate follows.
Covert communication can prevent the adversary from knowing that a wireless transmission has occurred. In the additive white Gaussian noise channels, a square root law is obtained and the result shows that Alice can reliably and covertly transmit O(n) bits to Bob in n channel uses. If additional "friendly" node near the adversary can inject artificial noise to aid Alice in hiding her transmission attempt, covert throughput can be improved, i.e., Alice can covertly transmit O(min{n,λα/2n}) bits to Bob over n uses of the channel (λ is the density of friendly nodes and α is the path loss exponent of wireless channels). In this paper, we consider the covert communication in a noisy wireless network, where Bob and the adversary Willie not only experience the background noise, but also the aggregated interference from other transmitters. Our results show that uncertainty in interference experienced by Willie is beneficial to Alice. When the distance between Alice and Willie da,w=ω(nδ/4) (δ=2/α is stability exponent), Alice can reliably and covertly transmit O(log2n) bits to Bob in n channel uses. Although the covert throughput is lower than the square root law and the friendly jamming scheme, the spatial throughput is higher. From the network perspective, the communications are hidden in "the sound and the fury" of noisy wireless networks, and what Willie sees is merely a "shadow" wireless network. He knows for certain that some nodes are transmitting, but he cannot catch anyone red-handed.