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^{\kappa } for \kappa > 0 non-communicating warden nodes (WNs) are randomly distributed in a square of unit area. Each legitimate source wants to communicate with it...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2020-12, Vol.66 (12), p.7684-7701
Hauptverfasser:	Cho, Kang-Hee, Lee, Si-Hyeon, Tan, Vincent Y. F.
Format:	Artikel
Sprache:	eng
Schlagworte:	Ad hoc networks capacity scaling law Communication Covert communication Data paths Gaussian noise Indexes low probability of detection Nickel Nodes Power consumption Scaling laws Throughput Upper bound Upper bounds wireless adhoc networks Wireless communication Wireless communications Wireless networks
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!