Mobility-Assisted Covert Communication over Wireless Ad Hoc Networks

by   Hyeon-Seong Im, et al.

We study the effect of node mobility on the throughput scaling of the covert communication over a wireless adhoc network. It is assumed that n mobile nodes want to communicate each other in a unit disk while keeping the presence of the communication secret from each of Theta(n^s) non-colluding wardens (s>0). Our results show that the node mobility greatly improves the throughput scaling, compared to the case of fixed node location. In particular, for 0<s<1, the aggregate throughput scaling is shown to be linear in n when the number of channel uses that each warden uses to judge the presence of communication is not too large compared to n. For the achievability, we modify the two-hop based scheme by Grossglauser and Tse (2002), which was proposed for a wireless ad hoc network without a covertness constraint, by introducing a preservation region around each warden in which the senders are not allowed to transmit and by carefully analyzing the effect of covertness constraint on the transmit power and the resultant transmission rates. This scheme is shown to be optimal for 0<s<1under an assumption that each node outside preservation regions around wardens uses the same transmit power.


page 1

page 2

page 3

page 4


Throughput Scaling of Covert Communication over Wireless Adhoc Networks

We consider the problem of covert communication over wireless adhoc netw...

Cheat-Proof Communication through Cluster Head (C3H) in Mobile Ad Hoc Network

The mobile ad hoc network (MANET) is a wireless network based on a group...

Route Discovery and Capacity of Ad hoc Networks

Throughput capacity of large ad hoc networks has been shown to scale adv...

IRONWAN: Increasing Reliability of Overlapping Networks in LoRaWAN

LoRaWAN deployments follow an ad-hoc deployment model that has organical...

One Billion Apples' Secret Sauce: Recipe for the Apple Wireless Direct Link Ad hoc Protocol

Apple Wireless Direct Link (AWDL) is a proprietary and undocumented IEEE...

Federated Graph Learning for Low Probability of Detection in Wireless Ad-Hoc Networks

Low probability of detection (LPD) has recently emerged as a means to en...

Network-Decomposed Hierarchical Cooperation in Ad Hoc Networks With Social Relationships

In this paper, we introduce a network-decomposed hierarchical cooperatio...

Please sign up or login with your details

Forgot password? Click here to reset