Topological Interference Management with Adversarial Perturbation



Liang, Ya-Chun, Liao, Chung-Shou and Yi, Xinping ORCID: 0000-0001-5163-2364
(2021) Topological Interference Management with Adversarial Perturbation. In: 2021 IEEE International Symposium on Information Theory (ISIT), 2021-7-12 - 2021-7-20.

Access the full-text of this item by clicking on the Open Access link.

Abstract

In this paper, we consider the topological interference management (TIM) problem in a dynamic setting, where an adversary perturbs network topology to prevent the exploitation of sophisticated coding opportunities (e.g., interference alignment). Focusing on a special class of network topology - chordal networks - we investigate algorithmic aspects of the TIM problem under adversarial topology perturbation. In particular, given the adversarial perturbation with respect to edge insertion/deletion, we propose a dynamic graph coloring algorithm that allows for a constant number of re-coloring updates against each inserted/deleted edge to achieve the information-theoretic optimality. This is a sharp reduction of the general graph recoloring, whose optimal number of updates scales as the size of the network, thanks to the delicate exploitation of the structural properties of weakly chordal graphs.

Item Type: Conference or Workshop Item (Unspecified)
Divisions: Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User: Symplectic Admin
Date Deposited: 17 Jan 2022 16:42
Last Modified: 18 Jan 2023 21:15
DOI: 10.1109/ISIT45174.2021.9518022
Open Access URL: https://arxiv.org/pdf/2101.12673.pdf
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3147052