Secure Degrees of Freedom of the Asymmetric Gaussian MIMO Interference Channel

被引:34
作者
Wang, Qiang [1 ]
Wang, Yi [1 ]
Wang, Haojin [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Natl Engn Lab Mobile Network Technol, Sch Informat & Commun Engn, Beijing 100876, Peoples R China
基金
中国国家自然科学基金;
关键词
Secure degrees of freedom (s.d.o.f.); asymmetric interference channel; multiple-input multiple-output (MIMO); interference alignment; WIRE-TAP CHANNEL; EAVESDROPPER CHANNEL; MULTIPLE-ACCESS; SECRECY;
D O I
10.1109/TVT.2017.2685526
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We study the secure degrees of freedom (s.d.o.f.) for a two-user multiple-input multiple-output (MIMO) Gaussian interference channel with confidential messages, each transmitter-receiver pair of which intends to keep secret from the other pair. Different from existing works on symmetric scenario, in this paper, an asymmetric system is considered, where transmitters have M-1, M-2 antennas and receivers have N-1, N-2 antennas, respectively. The channel is assumed to be fast fading and channel matrices are fixed and full rank. We subdivide the problem into several regimes based on the configuration of antennas at each node and present the exact secure degrees of freedom of corresponding regime. To prove a converse, the outer bound is developed by combining information theoretic derivation and the results of fundamental models. We also provide the achievable schemes based on zero forcing, real interference alignment, and cooperative jamming. One part of private signal is sent in the null space, while the other part is sent in a way that it aligns with cooperative jamming signal at unintended receiver, but leaves the secret message intact at intended receiver. As a consequence of the scheme, the objective s.d.o.f. can be achieved and the system ensures that the confidential messages cannot be eavesdropped by unintended receivers.
引用
收藏
页码:8001 / 8009
页数:9
相关论文
共 50 条
  • [21] Degrees of freedom region of the MIMO X channel
    Jafar, Syed A.
    Shamai, Shlomo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (01) : 151 - 170
  • [22] Secure Degrees of Freedom of the Gaussian Wiretap Channel with Helpers and No Eavesdropper CSI: Blind Cooperative Jamming
    Xie, Jianwei
    Ulukus, Sennur
    2013 47TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2013,
  • [23] Degrees of Freedom Region of the MIMO Interference Channel With Output Feedback and Delayed CSIT
    Tandon, Ravi
    Mohajer, Soheil
    Poor, H. Vincent
    Shamai , Shlomo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (03) : 1444 - 1457
  • [24] Secure Degrees of Freedom of the Multiple Access Wiretap Channel With Multiple Antennas
    Mukherjee, Pritam
    Ulukus, Sennur
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (03) : 2093 - 2103
  • [25] Secure Degrees of Freedom in Cooperative MIMO Cognitive Radio Systems
    Mu, Hua
    Tugnait, Jitendra K.
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2015, 63 (11) : 4377 - 4389
  • [26] Secure Degrees of Freedom Regions of Multiple Access and Interference Channels: The Polytope Structure
    Xie, Jianwei
    Ulukus, Sennur
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (04) : 2044 - 2069
  • [27] Secure Degrees of Freedom for the MIMO Wire-Tap Channel With a Multi-Antenna Cooperative Jammer
    Nafea, Mohamed
    Yener, Aylin
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (11) : 7420 - 7441
  • [28] Secure Degrees of Freedom of MIMO Two-Way Wiretap Channel With no CSI Anywhere
    Liang, Qingpeng
    Liu, Donglin
    Hu, Jiangping
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2020, 19 (12) : 7927 - 7941
  • [29] Degrees of Freedom of Rank-Deficient MIMO Interference Channels
    Krishnamurthy, Sundar R.
    Ramakrishnan, Abinesh
    Jafar, Syed Ali
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (01) : 341 - 365
  • [30] Interference alignment and degrees of freedom of the K-user interference channel
    Cadambe, Viveck R.
    Jafar, Syed Ali
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) : 3425 - 3441