Throughput Scaling of Covert Communication over Wireless Adhoc Networks

2019/06/28 by Cho, Kang-Hee, Lee, Si-Hyeon, Tan, Vincent Y. F. · 1 citation
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1906.12092

Abstract

We consider the problem of covert communication over wireless adhoc networks in which (roughly) n legitimate nodes (LNs) and n^κ for 0

Cited by

• Experimental Validation of Provably Covert Communication Using Software-Defined Radio

Related

• Mobility-Assisted Covert Communication over Wireless Ad Hoc Networks
• Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading
• Multi-Hop Routing in Covert Wireless Networks
• Covert Communication Achieved by A Greedy Relay in Wireless Networks
• Covert Communication over a K-User Multiple Access Channel