In this paper, we study covert communications between {a pair of} legitimate transmitter-receiver against a watchful warden over slow fading channels. There coexist multiple friendly helper nodes who are willing to protect the covert communication from being detected by the warden. We propose an uncoordinated jammer selection scheme where those helpers whose instantaneous channel gains to the legitimate receiver fall below a pre-established selection threshold will be chosen as jammers radiating jamming signals to defeat the warden. By doing so, the detection accuracy of the warden is expected to be severely degraded while the desired covert communication is rarely affected. We then jointly design the optimal selection threshold and message transmission rate for maximizing covert throughput under the premise that the detection error of the warden exceeds a certain level. Numerical results are presented to validate our theoretical analyses. It is shown that the multi-jammer assisted covert communication outperforms the conventional single-jammer method in terms of covert throughput, and the maximal covert throughput improves significantly as the total number of helpers increases, which demonstrates the validity and superiority of our proposed scheme.
翻译:在本文中,我们研究合法发报机接收器与看守人之间在缓慢下降的通道上的隐蔽通讯; 共存多个友好的助手节点,他们愿意保护秘密通讯不被典狱官发现; 我们提出一个不协调的干扰器选择计划,即那些其瞬间通过信道获得合法接收者的干扰器低于预先确定的甄选门槛的帮助者,将被选为散布干扰信号以击败典狱长的干扰器; 通过这样做,典狱官的检测准确性预计将严重降低,而所希望的隐蔽通讯很少受到影响; 然后,我们共同设计最佳的选择门槛和信息传输率,以便在典狱长的检测错误超过一定水平的前提下最大限度地进行隐蔽输送; 提出数字结果,以证实我们的理论分析。 事实证明,多干扰器协助的隐蔽通信在隐蔽中超越了传统的单一干扰器方法,而最大隐蔽的吞吐量则随着帮手总人数的增加而显著提高,这证明了我们提议的计划的有效性和优越性。