Abstract
dc:description.abstractThe objective of the proposed research is to characterize the maximum rate at which information can be transmitted reliably to a legitimate receiver over certain multi-user channels while simultaneously escaping detection from one or more adversaries. Specifically, we investigate the fundamental limits of covert communication over the following multi-user channel models — a K-user discrete memoryless multiple-access channel (MAC) monitored by a single warden, a discrete memoryless broadcast channel in which one of the receivers is a warden trying to detect the presence of a covert message, and a relay channel model in which the relay aids covert transmission amidst two non-colluding wardens each monitoring the transmitter and the relay, respectively. In all three models, we observe that the covert throughput is subject to the square-root law. Also, building upon a previous result that codeword-level asynchronism results in an improved covert throughput that circumvents the square-root law, we analyze the impact on the covert throughput as a result of symbol-level asynchronism at the receiver and the warden.
Degree
thesis:*- Level thesis:degree_level
- Doctoral
- Department dc:contributor.department
- Electrical and Computer Engineering
- Grantor dc:publisher
- Georgia Institute of Technology
- Year dc:date.issued
- 2019
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Arumugam, Keerthi Suria Kumar
- Committee members dc:contributor.committeemember
-
- Bloch, Matthieu
- Weitnauer, Mary Ann
- Davenport, Mark
- Pokutta, Sebastian
- Barry, John
Subjects
dc:subject × 6Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1853/61256