Throughput Scaling of Covert Communication Over Wireless Adhoc Networks

We consider the problem of covert communication over wireless adhoc networks in which (roughly) n legitimate nodes (LNs) and n
^κ
for κ > 0 non-communicating warden nodes (WNs) are randomly distributed in a square of unit area. Each legitimate source wants to communicate with its intended destination node while ensuring that every WN is unable to detect the presence of the communication. In this scenario, we study the throughput scaling law. Due to the covert communication constraint, the transmit powers are necessarily limited. Under this condition, we introduce a preservation region around each WN. This regionsuitably modified by taking a detour around each preservation region. To avoid the concentration of detours resulting extra relaying burdens, we distribute the detours evenly over a wide region. In the proposed HC scheme, we control the symbol power and the scheduling of distributed multiple-input multiple-output transmission. We also present upper bounds on the throughput scaling under the assumption that every active LN consumes the same average transmit power over the time period in which the WNs observe the channel outputs. For 0 <; κ <; 1, these upper bounds match with the achievable throughput scalings.