Prefer a chat interface with context about you and your work?
Throughput Scaling of Covert Communication over Wireless Adhoc Networks
We study the throughput scaling law of covert communication over wireless adhoc networks where (roughly) n legitimate nodes (LNs) and n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">κ</sup> for 0 <; κ <; 1 warden nodes (WNs) are randomly distributed in a unit area. Each legitimate source wants to communicate with its destination while …