TY - GEN
T1 - The Gaussian interference channel in the presence of a malicious jammer
AU - Hosseinigoki, Fatemeh
AU - Kosut, Oliver
N1 - Funding Information:
This material is based upon work supported by the National Science Foundation under Grant No. CCF-1422358
Publisher Copyright:
© 2016 IEEE.
PY - 2017/2/10
Y1 - 2017/2/10
N2 - This paper considers the two-user Gaussian interference channel in the presence of one or two adversarial jammers. Existing outer and inner bounds for the Gaussian interference channel are generalized in the presence of the jammer(s). We show that for certain problem parameters, precisely the same bounds hold, but with the noise variance increased by the received power of the jammer at each receiver. Thus, the jammers can do no better than to transmit Gaussian noise. For these problem parameters, this allows us to recover the half-bit theorem. Moreover, we show that, if the jammer has greater received power than the legitimate user, symmetrizability makes the capacity zero. The proof of the outer bound is straightforward, while the inner bound generalizes the Han-Kobayashi rate splitting scheme. As a novel aspect, the inner bound takes advantage of the common message acting as common randomness for the private message; hence, the jammer cannot symmetrize only the private codeword without being detected. We also prove a new version of a packing lemma for the Gaussian arbitrarily-varying channel.
AB - This paper considers the two-user Gaussian interference channel in the presence of one or two adversarial jammers. Existing outer and inner bounds for the Gaussian interference channel are generalized in the presence of the jammer(s). We show that for certain problem parameters, precisely the same bounds hold, but with the noise variance increased by the received power of the jammer at each receiver. Thus, the jammers can do no better than to transmit Gaussian noise. For these problem parameters, this allows us to recover the half-bit theorem. Moreover, we show that, if the jammer has greater received power than the legitimate user, symmetrizability makes the capacity zero. The proof of the outer bound is straightforward, while the inner bound generalizes the Han-Kobayashi rate splitting scheme. As a novel aspect, the inner bound takes advantage of the common message acting as common randomness for the private message; hence, the jammer cannot symmetrize only the private codeword without being detected. We also prove a new version of a packing lemma for the Gaussian arbitrarily-varying channel.
KW - Gaussian interference channel
KW - adversarial jammer
KW - capacity region
UR - http://www.scopus.com/inward/record.url?scp=85015157696&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85015157696&partnerID=8YFLogxK
U2 - 10.1109/ALLERTON.2016.7852297
DO - 10.1109/ALLERTON.2016.7852297
M3 - Conference contribution
AN - SCOPUS:85015157696
T3 - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
SP - 679
EP - 686
BT - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016
Y2 - 27 September 2016 through 30 September 2016
ER -