Covert, Low-Delay, Coded Message Passing in Mobile (IoT) Networks

08/07/2021
by   Pei Peng, et al.
0

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 (Ioe̱ṯa̱T) objects. Alice and Bob perform random walks on a random regular graph. The Ioe̱ṯa̱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.

READ FULL TEXT
research
08/15/2019

Straggling for Covert Message Passing on Complete Graphs

We introduce a model for mobile, multi-agent information transfer that i...
research
04/21/2023

Convergence of Message Passing Graph Neural Networks with Generic Aggregation On Large Random Graphs

We study the convergence of message passing graph neural networks on ran...
research
06/23/2022

Affinity-Aware Graph Networks

Graph Neural Networks (GNNs) have emerged as a powerful technique for le...
research
12/31/2020

Graph Networks with Spectral Message Passing

Graph Neural Networks (GNNs) are the subject of intense focus by the mac...
research
12/24/2021

Aligning random graphs with a sub-tree similarity message-passing algorithm

The problem of aligning Erdös-Rényi random graphs is a noisy, average-ca...
research
01/17/2019

Message-Passing Neural Networks Learn Little's Law

The paper presents a solution to the problem of universal representation...
research
07/01/2022

Grant-Free Transmission by LDPC Matrix Mapping and Integrated Cover-MPA Detector

In this paper, a novel transceiver architecture is proposed to simultane...

Please sign up or login with your details

Forgot password? Click here to reset