4.8 Article

Degrees of Freedom of the Circular Multirelay MIMO Interference Channel in IoT Networks

Journal

IEEE INTERNET OF THINGS JOURNAL
Volume 5, Issue 3, Pages 1957-1966

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2018.2817580

Keywords

Degrees of freedom (DoFs); Internet of Things (IoT); multiple-input multiple-output (MIMO); signal alignment; the circular multirelay multiple-input multiple-output interference channel (CMMI)

Funding

  1. National Natural Science Foundation of China [61571329, 61771345, 6140144, 61390513]
  2. National Science and Technology Major Project [2016ZX03001015]
  3. National Science and Technology Support Plan [2012BAH15F03]

Ask authors/readers for more resources

In this paper, we study the degrees of freedom (DoF) of a new network information flow model named the circular multirelay multiple-input multiple-output interference channel (CMMI). In this model, there are two clusters and each of them contains three users. Each user equipped with M antennas in one cluster intends to deliver data streams to another user in the same cluster in a circular one-way transmission via the common distributed K N-antenna relay nodes. The CMMI network model can be considered as a basic component to construct the complicated Internet of Things networks. By assuming linear processing at the users and the relays, we show that the original analysis of DoF comes down in finding solutions of some nonlinear matrix equations with rank constraints. Toward this end, by using linear precoding and post-processing techniques, we propose two different approaches to solve the nonlinear matrix equations based on different antenna configurations. We show that a DoF of max{min{M, (root 6K/12)}, min{(M/3), (KN/2)}} is achievable for for all(M/N) is an element of(0,+infinity). In addition, to assess the optimal DoF, the cut-set approach is used for deriving the DoF upper bound by innovatively separating certain users to form two-pair two-way relay channels. We show that the DoF of CMMI is upper bounded by max{min{M, (KN/3)}, min{(2M/3), (KN/2)}}. By combining the achievable DoF and the upper bound, we finally show that the optimal DoF of CMMI can be achieved for (M/N)is an element of[0, (root 6K/12)].[(3K/2),+8), for all K >= 1.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available