Topological Interference Management With Adversarial Topology Perturbation: An Algorithmic Perspective

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