Covert communication with time uncertainty in time-critical wireless networks

Authors

Xingbo Lu
Shihao Yan, Edith Cowan UniversityFollow
Weiwei Yang
Min Li
Derrick Wing Kwan Ng

Document Type

Journal Article

Publication Title

IEEE Transactions on Wireless Communications

Publisher

IEEE

School

School of Science / ECU Security Research Institute

RAS ID

51903

Funders

Australian Research Council's Discovery Project / National Natural Science Foundation of China, grant numbers: 62071005, 62071486, 62171464 / Natural Science Foundation on Frontier Leading Technology Basic Research Project of Jiangsu (Grant Number: BK20212001) / Key R & D Program of Jiangsu Province Key project and topics (Grant Number: BE2021095)

Grant Number

ARC Number: DP210102169

Grant Link

http://purl.org/au-research/grants/arc/DP210102169

Comments

Lu, X., Yan, S., Yang, W., Li, M., & Ng, D. W. K. (2023). Covert communication with time uncertainty in time-critical wireless networks. IEEE Transactions on Wireless Communications, 22(2), 1116-1129

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

Abstract

In this work, we investigate the status packet covert communication with time uncertainty in time-critical wireless networks. We model the packet generation as a Poisson process that concatenates the information timeliness and communication covertness, since the prior transmission probability is highly correlated with the packet generation. To balance between the timeliness and covertness of the status packet transmission, we propose two schemes, named random sub-slot selection(RSS) scheme and random channel use selection (RCUS) scheme, by exploiting the random transmission time to confuse a warden Willie's binary detection on the covert communication. Subsequently, the average age of information (AoI) subject to the covertness constraint is derived for the proposed RSS and RCUS schemes. It is demonstrated that the symbol-length of the status packet introduces a non-trivial tradeoff between the covertness and timeliness. Inspired by this, further designs of the symbol-length and the transmit power for the proposed two schemes are formulated as optimization problems and solved optimally. Our numerical results demonstrate the superiority of proposed schemes over the existing covert communication strategies. In addition, our examination reveals that the RCUS scheme outperforms the RSS scheme when the covertness constraint is extremely strict. Otherwise, the RSS scheme generally outperforms the RCUS scheme in terms of achieving a lower AoI.

DOI

10.1109/TWC.2022.3201872

Access Rights

subscription content