How Well Can Graphs Represent Wireless Interference?

TL;DR

This paper investigates how effectively graphs can model wireless interference under the SINR framework, proposing a family of conflict graphs that approximate feasibility with minimal gap and demonstrating tight bounds and limitations.

Contribution

It introduces a parameterized family of conflict graphs that closely approximate wireless feasibility, establishing bounds and limitations of graph-based models for interference.

Findings

Conflict graphs can approximate feasibility with an $O( ext{log}^* \Delta)$ cost.

The upper bound on the approximation gap is tight, with a lower bound of $ ext{Omega}( ext{log}^* \Delta)$.

The approach improves link scheduling algorithms and reveals fundamental limits of graph-based interference modeling.

Abstract

Efficient use of a wireless network requires that transmissions be grouped into feasible sets, where feasibility means that each transmission can be successfully decoded in spite of the interference caused by simultaneous transmissions. Feasibility is most closely modeled by a signal-to-interference-plus-noise (SINR) formula, which unfortunately is conceptually complicated, being an asymmetric, cumulative, many-to-one relationship. We re-examine how well graphs can capture wireless receptions as encoded in SINR relationships, placing them in a framework in order to understand the limits of such modelling. We seek for each wireless instance a pair of graphs that provide upper and lower bounds on the feasibility relation, while aiming to minimize the gap between the two graphs. The cost of a graph formulation is the worst gap over all instances, and the price of (graph) abstraction is the smallest cost of a graph formulation. We propose a family of conflict graphs that is parameterized by a non-decreasing sub-linear function, and show that with a judicious choice of functions, the graphs can capture feasibility with a cost of $O(\log^* \Delta)$, where $\Delta$ is the ratio between the longest and the shortest link length. This holds on the plane and more generally in doubling metrics. We use this to give greatly improved $O(\log^* \Delta)$-approximation for fundamental link scheduling problems with arbitrary power control. We explore the limits of graph representations and find that our upper bound is tight: the price of graph abstraction is $\Omega(\log^* \Delta)$. We also give strong impossibility results for general metrics, and for approximations in terms of the number of links.