Technical Program

Paper Detail

Paper Title Throughput Scaling of Covert Communication over Wireless Adhoc Networks
Paper IdentifierTH3.R5.1
Authors Kang-Hee Cho, Si-Hyeon Lee, Pohang University of Science and Technology (POSTECH), Korea (South); Vincent Y. F. Tan, National University of Singapore, Singapore
Session Secure and Covert Communication
Location Saint Victor, Level 3
Session Time Thursday, 11 July, 14:30 - 16:10
Presentation Time Thursday, 11 July, 14:30 - 14:50
Manuscript  Click here to download the manuscript
Abstract We study the throughput scaling law of covert communication over wireless adhoc networks where (roughly) n legitimate nodes (LNs) and n^{\kappa} for 0<\kappa<1 warden nodes (WNs) are randomly distributed in a unit area. Each legitimate source wants to communicate with its destination while ensuring that each WN is unable to detect the presence of communication. A preservation region, where the transmission of the LNs is not permitted, is introduced around each WN to increase the transmit power of the LNs outside the preservation regions. For achievability, multi-hop (MH), hierarchical cooperation (HC), and hybrid HC-MH schemes in the literature are utilized with some modifications. In the MH and the hybrid schemes, because the preservation regions may block the direct data paths, a detouring method that distributes the detours evenly over a wide region is proposed to avoid the concentration of relaying burdens. In the HC scheme, we properly control the symbol power and the MIMO transmission scheduling. We also present matching upper bounds on the throughput scaling under an assumption that every active LN consumes a same average transmit power over the time period that the WNs observe.