Opportunistic Topological Interference Management



Yi, Xinping ORCID: 0000-0001-5163-2364 and Sun, Hua
(2019) Opportunistic Topological Interference Management. In: 2019 IEEE International Symposium on Information Theory (ISIT), 2019-7-7 - 2019-7-12, Paris, France.

This is the latest version of this item.

[img] Text
TCOM-TPS-19-0472.pdf - Author Accepted Manuscript
Available under License : See the attached licence file.

Download (2MB) | Preview

Abstract

The topological interference management (TIM) problem studies the degrees of freedom (DoF) of partially- connected interference networks with no channel state information (CSI) at the transmitters except the network topology (i.e., partial connectivity). In this paper, we consider a variant of the TIM problem with uncertainty in network topology, where the channel state with partial connectivity is only known to belong to one of M states at the transmitters. In particular, the transmitter has access to all network topological information over M states, but is unaware of which state it falls in exactly for communication. The receiver at any state is aware of the exact state it falls in besides the network topologies of all states, and wish to recover as much highly-prioritized information at current state as possible. We formulate it as the opportunistic TIM problem with network uncertainty modeled by M state-varying network topologies. To adapt to network topology uncertainty and different message decoding priority, joint encoding and opportunistic decoding are enabled at the transmitters and receivers respectively. Specifically, being aware of all possible network topologies, each transmitter sends a signal jointly encoded from all messages desired over M states, say M distinct messages, and at a certain State m, Receiver k wishes to opportunistically decode the first πk(m) {1,2,...,M} higher-priority messages. Under this opportunistic TIM setting, we construct a multi-state conflict graph to capture the mutual conflict of messages over M states, and characterize the optimal DoF region of two classes of network topologies via polyhedral combinatorics. A remarkable fact is that, under an additional mild monotonous condition, the optimality conditions of orthogonal access and one-to-one interference alignment still apply to TIM with uncertainty in network topology.

Item Type: Conference or Workshop Item (Unspecified)
Depositing User: Symplectic Admin
Date Deposited: 28 Feb 2020 14:29
Last Modified: 19 Jan 2023 00:09
DOI: 10.1109/isit.2019.8849458
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3071000

Available Versions of this Item