Probabilistic accumulate-then-transmit in wireless-powered covert communications

Document Type

Journal Article

Publication Title

IEEE Transactions on Wireless Communications

Publisher

IEEE

School

School of Science / ECU Security Research Institute

RAS ID

52188

Funders

National Key Research and Development Project under Grant 2018YFB1801104

National Natural Science Foundation of China under Grants: 61922071, 6207148

Australian Research Council’s Discovery Project

Grant Number

ARC Number : DP210102169

Comments

Wang, Y., Yan, S., Yang, W., Zhong, C., & Ng, D. W. K. (2022). Probabilistic accumulate-then-transmit in wireless-powered covert communications. IEEE Transactions on Wireless Communications, 21(12), 10393-10406.

https://doi.org/10.1109/TWC.2022.3183892

Abstract

In this paper, we investigate the optimal design of a wireless-powered covert communication (WP-CC) system, where a full-duplex (FD) receiver transmits artificial noise (AN) to simultaneously charge an energy-constrained transmitter and to confuse a warden’s detection on the transmitter’s communication activity. In order to achieve a higher level of covertness, we propose a probabilistic accumulate-then-transmit (ATT) protocol, where the transmitter is able to adjust the prior probability conditioned on the available energy being sufficient, i.e., p, rather than setting p = 1 as in the traditional ATT protocol to maximize the system throughput. Then, we derive the warden’s minimum detection error probability and characterize the effective covert rate from the transmitter to the receiver to quantify the communication covertness and quality, respectively. The derived analytical results facilitate the joint optimization of the probability p and the information transmit power to maximize the communication covertness subject to a quality-of-service (QoS) requirement on communication. We further present the optimal design of a cable-powered covert communication (CP-CC) system as a benchmark for comparison. Our simulation shows that the proposed probabilistic ATT protocol (with a varying p) can achieve the covertness upper bound determined by the CP-CC system, while the traditional ATT protocol (with p = 1) cannot, which confirms the benefits brought by the proposed probabilistic ATT protocol in covert communications.

DOI

10.1109/TWC.2022.3183892

Access Rights

subscription content

Link to Full Text

Share

 
COinS