Topological Interference Management with Adversarial Perturbation

by   Ya-Chun Liang, et al.

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 re-coloring, 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.



There are no comments yet.


page 1

page 2

page 3

page 4


Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs

An equitable coloring of a graph G=(V,E) is a (proper) vertex-coloring o...

Improved Dynamic Graph Coloring

This paper studies the fundamental problem of graph coloring in fully dy...

Dynamic Algorithms for Graph Coloring

We design fast dynamic algorithms for proper vertex and edge colorings i...

Distributed recoloring of interval and chordal graphs

One of the fundamental and most-studied algorithmic problems in distribu...

Deep Learning-based Hybrid Graph-Coloring Algorithm for Register Allocation

Register allocation, which is a crucial phase of a good optimizing compi...

FO and MSO approach to Some Graph Problems: Approximation and Poly time Results

The focus of this paper is two fold. Firstly, we present a logical appro...

Measuring the Robustness of Graph Properties

In this paper, we propose a perturbation framework to measure the robust...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.