Robust Beamforming Design for Covert Communications

  title={Robust Beamforming Design for Covert Communications},
  author={Shuai Ma and Yunqi Zhang and Hang Li and Songtao Lu and Naofal Al-Dhahir and Sha Zhang and Shiyin Li},
  journal={IEEE Transactions on Information Forensics and Security},
In this paper, we consider a common unicast beamforming network where Alice utilizes the communication to Carol as a cover and covertly transmits a message to Bob without being recognized by Willie. We investigate the beamformer design of Alice to maximize the covert rate to Bob when Alice has either perfect or imperfect knowledge about Willie’s channel state information (WCSI). For the perfect WCSI case, the problem is formulated under the perfect covert constraint, and we develop a covert… 

Figures and Tables from this paper


Robust Power Allocation in Covert Communication: Imperfect CDI
Developing covert communication schemes for various assumptions on Alice's imperfect CDI, when the transmitter knows the channel distribution is within some distance of a nominal distribution; when only the mean and variance of the channels distribution are available; and when Alice knows theChannel distribution is complex Gaussian but the variance is unknown.
Covert Communication Using Null Space and 3D Beamforming: Uncertainty of Willie's Location Information
This work investigates a new practical scenario in which the information about Willie's location is imperfect at Alice, and equip the jammer with multiple antennas so that it can employ beamforming to place the intended receiver in the null space of the jamming.
Achieving Covert Wireless Communications Using a Full-Duplex Receiver
This paper provides guidelines for the optimal choice of artificial noise power range, and the optimal transmission probability of covert information to maximize the detection errors at Willie, where covertness is achieved by using a full-duplex receiver.
Covert Communication in Downlink NOMA Systems With Random Transmit Power
This letter considers covert communication in downlink N OMA systems, where a public action is used to provide a cover for a secret action (communication from Alice to the NOMA-strong user U2).
Covert Communications With a Full-Duplex Receiver in Non-Coherent Rayleigh Fading
This paper investigates covert communications over non-coherent Rayleigh fading channels, and analyses the achievable covert rates with fixed and varying AN power and shows that in both fast and slow fading cases, it is possible to achieve a positive covert rate.
Joint Information-Theoretic Secrecy and Covert Communication in the Presence of an Untrusted User and Warden
An optimization problem is formulated with the aim of maximizing the average rate subject to a covert communication requirement and a secure communications constraint in a single-input–multioutput (SIMO) system where a transmitter (Alice) is communicating with two legitimate users.
Covert communication with the help of an uninformed jammer achieves positive rate
This work establishes covert communication of O(n) bits in n channel uses while generalizing the environment; and removing any restrictions on Willie's receiver while establishing the optimality of the power detector for Willie.
Robust Beamforming for Secure Communication in Systems With Wireless Information and Power Transfer
A suboptimal resource allocation scheme with low computational complexity for providing communication secrecy and facilitating efficient energy transfer is proposed for a multiuser multiple-input single-output (MISO) downlink system with simultaneous wireless information and power transfer.
Time-Division is Optimal for Covert Communication over Some Broadcast Channels
The result implies that a code that uses two separate optimal point-to-point codes each designed for the constituent channels and each used for a fraction of the time is optimal in the sense that it achieves the best constants of the $\sqrt{n}$-scaling for the throughputs.
Limits of Covert Communication on Two-Hop AWGN Channels
This paper focuses on the maximum throughput analysis of a two-hop wireless system where the source only communicates with the destination via a relay node, and shows that the transmitter can communicate with the receiver under a certain detection probability less than a constant.