Covert communications with constrained age of information

Yida Wang, Shihao Yan*, Weiwei Yang, Yueming Cai

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

33 Citations (Scopus)

Abstract

In this letter, we consider the requirement of information freshness in covert communications for the first time. With artificial noise (AN) generated from a full-duplex (FD) receiver, we formulate a covertness maximization problem under the average age of information (AoI) constraint to optimize the transmit probability of information signal. In particular, the transmit probability not only represents the generation rate of information signal but also represents the prior probability of the alternative hypothesis in covert communications, which builds up a bridge between information freshness and communication covertness. Our analysis shows that the best transmit probability is not always 0.5, which differs from the equal prior probabilities assumption in most related works on covert communications. Furthermore, the limitation of average AoI enlarges the transmit probability at the cost of the covertness reduction and leads to a positive lower bound on the information transmit power for non-zero covertness.

Original languageEnglish
Pages (from-to)368-372
Number of pages5
JournalIEEE Wireless Communications Letters
Volume10
Issue number2
DOIs
Publication statusPublished - Feb 2021

Fingerprint

Dive into the research topics of 'Covert communications with constrained age of information'. Together they form a unique fingerprint.

Cite this