In this letter, we propose reliable covert communications with the aim of minimizing age of information (AoI) in the time-varying channels. We named the time duration that channel state information (CSI) is valid as a new metric, as age of channel variation (AoC). To find reliable covert communication in a fresh manner in dynamic environments, this work considers a new constraint that shows a relation between AoI and AoC. With the aid of the proposed constraint, this paper addresses two main challenges of reliable covert communication with the aim of minimizing AoI: 1) users packets with desirable size; 2) guaranteeing the negligible probability of Willies detection, in time-varying networks. In the simulation results, we compare the performance of the proposed constraint in reliable covert communication with the aim of minimizing AoI with conventional optimization of the requirement of information freshness in covert communications.
翻译:在这封信中,我们提出可靠的隐蔽通信,目的是尽量减少在时间变化的渠道中信息的年龄(AoI),我们把频道国家信息(CSI)的时间期限定为新的衡量标准,作为频道变异(AoC)的年龄。为了以新的方式在动态环境中找到可靠的隐蔽通信(AoC),这项工作考虑了显示AoI和AoC之间关系的新的制约因素。 在拟议的限制的帮助下,本文件讨论了可靠的隐蔽通信的两个主要挑战,目的是尽量减少AoI的用户数量;1) 保证在时间变化的网络中发现威利斯的概率很小;2) 在模拟结果中,我们比较了拟议在可靠的隐蔽通信中限制的性能,目的是尽可能减少AoI对隐蔽通信信息新鲜性的要求进行常规的优化。