TY - JOUR
T1 - Covert wireless communication with artificial noise generation
AU - Soltani, Ramin
AU - Goeckel, Dennis
AU - Towsley, Don
AU - Bash, Boulat A.
AU - Guha, Saikat
N1 - Funding Information:
Manuscript received September 20, 2017; revised February 22, 2018 and June 27, 2018; accepted July 30, 2018. Date of publication August 24, 2018; date of current version November 9, 2018. This work was supported in part by the National Science Foundation under Grants CNS-1018464, ECCS-1309573, and CNS-1564067. This paper was presented at the 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton, Monti-cello, IL, USA, October 2014 [1]. The associate editor coordinating the review of this paper and approving it for publication was S. Yang. (Corresponding author: Ramin Soltani.) R. Soltani and D. Goeckel are with the Electrical and Computer Engineering Department, University of Massachusetts, Amherst, MA 01002 USA (e-mail: soltani@ecs.umass.edu; goeckel@ecs.umass.edu).
Publisher Copyright:
© 2002-2012 IEEE.
PY - 2018/11
Y1 - 2018/11
N2 - Covert communication conceals the transmission of the message from an attentive adversary. Recent work on the limits of covert communication in additive white Gaussian noise channels has demonstrated that a covert transmitter (Alice) can reliably transmit a maximum of O(√n) bits to a covert receiver (Bob) without being detected by an adversary (Warden Willie) in n channel uses. This paper focuses on the scenario where other 'friendly' nodes distributed according to a two-dimensional Poisson point process with density m are present. We propose a strategy where the friendly node closest to the adversary, without close coordination with Alice, produces artificial noise. We show that this method allows Alice to reliably and covertly send O(min {{n,mgamma/2√n) bits to Bob in n channel uses, where γ is the path-loss exponent. We also consider a setting where there are Nw collaborating adversaries uniformly and randomly located in the environment and show that in n channel uses, Alice can reliably and covertly send O(min n,(mgamma/2} √n/Nw γ) bits to Bob when γ >2 , and O(min {n,(m√n/Nw 2log2 Nw)) when γ = 2. Conversely, we demonstrate that no higher covert throughput is possible for γ >2.
AB - Covert communication conceals the transmission of the message from an attentive adversary. Recent work on the limits of covert communication in additive white Gaussian noise channels has demonstrated that a covert transmitter (Alice) can reliably transmit a maximum of O(√n) bits to a covert receiver (Bob) without being detected by an adversary (Warden Willie) in n channel uses. This paper focuses on the scenario where other 'friendly' nodes distributed according to a two-dimensional Poisson point process with density m are present. We propose a strategy where the friendly node closest to the adversary, without close coordination with Alice, produces artificial noise. We show that this method allows Alice to reliably and covertly send O(min {{n,mgamma/2√n) bits to Bob in n channel uses, where γ is the path-loss exponent. We also consider a setting where there are Nw collaborating adversaries uniformly and randomly located in the environment and show that in n channel uses, Alice can reliably and covertly send O(min n,(mgamma/2} √n/Nw γ) bits to Bob when γ >2 , and O(min {n,(m√n/Nw 2log2 Nw)) when γ = 2. Conversely, we demonstrate that no higher covert throughput is possible for γ >2.
KW - Covert communication
KW - additive white Gaussian noise
KW - artificial noise generation
KW - jamming
KW - low probability of detection
KW - security and privacy
KW - wireless communication
UR - http://www.scopus.com/inward/record.url?scp=85052693361&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85052693361&partnerID=8YFLogxK
U2 - 10.1109/TWC.2018.2865946
DO - 10.1109/TWC.2018.2865946
M3 - Article
AN - SCOPUS:85052693361
VL - 17
SP - 7252
EP - 7267
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
SN - 1536-1276
IS - 11
M1 - 8445707
ER -