移动（IoT）网络中的隐蔽、低延迟、编码消息传递
Covert, Low-Delay, Coded Message Passing in Mobile (IoT) Networks
摘要：
我们引入了一个类似于八卦的协议，当爱丽丝和鲍勃在一个由监狱长威利监视的区域移动时，他们之间进行秘密消息传递。该地区拥有大量的（战场）物联网（IO \b{eta} T）对象。Alice和Bob在一个随机正则图上进行随机游动。Io \b{eta} T对象驻留在该图的顶点上，并且一些对象可以充当Alice和Bob之间的中继。协议开始时，爱丽丝将她的消息分成小块，她可以秘密地将其存放到她遇到的中继中。协议以Bob收集块结束。Alice可以在传播之前对她的数据进行编码。威利既可以像爱丽丝和鲍勃那样进行随机漫步，也可以对该区域进行统一的监视。在任何一种情况下，他一次只能观察一个继电器。我们通过隐蔽概率和消息传递延迟来评估系统的性能。在我们的协议中，爱丽丝分裂她的消息，以增加隐蔽性的概率，并添加（编码）冗余，以减少传输延迟。性能指标取决于图形、通信延迟和代码参数。我们表明，在大多数情况下，它是不可能找到的设计参数，同时最大化的隐蔽性概率和最小化的消息延迟。
英文摘要：
We introduce a gossip-like protocol for covert message passing between Alice and Bob as they move in an area watched over by a warden Willie. The area hosts a multitude of Internet of (Battlefield) Things (Io\b{eta}T) objects. Alice and Bob perform random walks on a random regular graph. The Io\b{eta}T objects reside on the vertices of this graph, and some can serve as relays between Alice and Bob. The protocol starts with Alice splitting her message into small chunks, which she can covertly deposit to the relays she encounters. The protocol ends with Bob collecting the chunks. Alice may encode her data before the dissemination. Willie can either perform random walks as Alice and Bob do or conduct uniform surveillance of the area. In either case, he can only observe one relay at a time. We evaluate the system performance by the covertness probability and the message passing delay. In our protocol, Alice splits her message to increase the covertness probability and adds (coded) redundancy to reduce the transmission delay. The performance metrics depend on the graph, communications delay, and code parameters. We show that, in most scenarios, it is impossible to find the design parameters that simultaneously maximize the covertness probability and minimize the message delay.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
