Analysis of Maximal Topologies and Their DoFs in Topological Interference Management

Topological interference management (TIM) can obtain degrees of freedom (DoF) gains with no channel state information at the transmitters (CSIT) except topological information of network in the interference channel. It was shown that TIM achieves symmetric DoF 1/2 when internal conflict does not exi...

Full description

Bibliographic Details
Main Authors: Jongyoon Yoon, Jong-Seon No
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8968427/
_version_ 1819295754554966016
author Jongyoon Yoon
Jong-Seon No
author_facet Jongyoon Yoon
Jong-Seon No
author_sort Jongyoon Yoon
collection DOAJ
description Topological interference management (TIM) can obtain degrees of freedom (DoF) gains with no channel state information at the transmitters (CSIT) except topological information of network in the interference channel. It was shown that TIM achieves symmetric DoF 1/2 when internal conflict does not exist among messages [7]. However, it is difficult to assure whether a specific topology can achieve symmetric DoF 1/2 without scrutinizing internal conflict. It is also hard to derive a specific topology directly from the conventional condition for symmetric DoF 1/2. Even except for the topology achieving symmetric DoF 1/2, topology achieving specific DoF less than 1/2 is not well known. With these problems in mind, we propose a method to derive all maximal topologies directly in TIM, named as alliance construction in K-user interference channel. That is, it is proved that a topology is maximal if and only if it is derived from alliance construction. Further we translate a topology design by alliance construction in the alignment-conflict graph into topology matrix and propose conditions for maximal topology matrix (MTM). Moreover, we propose a generalized alliance construction that derives topologies achieving DoF 1/n for n ≥ 3 by generalizing sub-alliances. A topology matrix can also be used to analyze topologies with DoF 1/n .
first_indexed 2024-12-24T04:47:15Z
format Article
id doaj.art-b4a479705736466db51d9d2365bd9c88
institution Directory Open Access Journal
issn 2169-3536
language English
last_indexed 2024-12-24T04:47:15Z
publishDate 2020-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj.art-b4a479705736466db51d9d2365bd9c882022-12-21T17:14:40ZengIEEEIEEE Access2169-35362020-01-018264052641810.1109/ACCESS.2020.29692608968427Analysis of Maximal Topologies and Their DoFs in Topological Interference ManagementJongyoon Yoon0https://orcid.org/0000-0002-4415-2458Jong-Seon No1https://orcid.org/0000-0002-3946-0958Department of Electrical and Computer Engineering, INMC, Seoul National University, Seoul, South KoreaDepartment of Electrical and Computer Engineering, INMC, Seoul National University, Seoul, South KoreaTopological interference management (TIM) can obtain degrees of freedom (DoF) gains with no channel state information at the transmitters (CSIT) except topological information of network in the interference channel. It was shown that TIM achieves symmetric DoF 1/2 when internal conflict does not exist among messages [7]. However, it is difficult to assure whether a specific topology can achieve symmetric DoF 1/2 without scrutinizing internal conflict. It is also hard to derive a specific topology directly from the conventional condition for symmetric DoF 1/2. Even except for the topology achieving symmetric DoF 1/2, topology achieving specific DoF less than 1/2 is not well known. With these problems in mind, we propose a method to derive all maximal topologies directly in TIM, named as alliance construction in K-user interference channel. That is, it is proved that a topology is maximal if and only if it is derived from alliance construction. Further we translate a topology design by alliance construction in the alignment-conflict graph into topology matrix and propose conditions for maximal topology matrix (MTM). Moreover, we propose a generalized alliance construction that derives topologies achieving DoF 1/n for n ≥ 3 by generalizing sub-alliances. A topology matrix can also be used to analyze topologies with DoF 1/n .https://ieeexplore.ieee.org/document/8968427/Alliancealliance constructiondegrees-of-freedom (DoF)interference channelalignment graphconflict graph
spellingShingle Jongyoon Yoon
Jong-Seon No
Analysis of Maximal Topologies and Their DoFs in Topological Interference Management
IEEE Access
Alliance
alliance construction
degrees-of-freedom (DoF)
interference channel
alignment graph
conflict graph
title Analysis of Maximal Topologies and Their DoFs in Topological Interference Management
title_full Analysis of Maximal Topologies and Their DoFs in Topological Interference Management
title_fullStr Analysis of Maximal Topologies and Their DoFs in Topological Interference Management
title_full_unstemmed Analysis of Maximal Topologies and Their DoFs in Topological Interference Management
title_short Analysis of Maximal Topologies and Their DoFs in Topological Interference Management
title_sort analysis of maximal topologies and their dofs in topological interference management
topic Alliance
alliance construction
degrees-of-freedom (DoF)
interference channel
alignment graph
conflict graph
url https://ieeexplore.ieee.org/document/8968427/
work_keys_str_mv AT jongyoonyoon analysisofmaximaltopologiesandtheirdofsintopologicalinterferencemanagement
AT jongseonno analysisofmaximaltopologiesandtheirdofsintopologicalinterferencemanagement