Covert communication over wireless ad hoc networks with n legitimate nodes and n^κ wardens yields throughput scaling laws derived via modified multi-hop, hierarchical cooperation, and hybrid schemes with preservation regions around wardens.
Time-division is optimal for covert communication over some broadcast channels
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Throughput Scaling of Covert Communication over Wireless Adhoc Networks
Covert communication over wireless ad hoc networks with n legitimate nodes and n^κ wardens yields throughput scaling laws derived via modified multi-hop, hierarchical cooperation, and hybrid schemes with preservation regions around wardens.