SIAM Journal on Computing, Volume 50, Issue 2, Page 718-759, January 2021.
An overarching issue in resource management of wireless networks is assessing their capacity: How much communication can be achieved in a network, utilizing all the tools available: power control, scheduling, routing, channel assignment, and rate adjustment? We propose the first framework for approximation algorithms in the physical model of wireless interference that addresses these questions in full in interference-limited networks. The approximations obtained are at most doubly logarithmic in the link length and rate diversity. Where previous bounds are known, this gives an exponential improvement or better. The key insight is the discovery that a properly chosen power assignment infers a form of locality, or tolerance to the interference of both shorter and longer communication links. This allows us to simplify the complex interference relationship of the physical model into a new form of conflict graphs, at a small cost. We also show that the approximation obtained is provably the best possible for any conflict graph formulation.

中文翻译：

---

通过超图草图进行有效的无线调度

SIAM Journal on Computing，第 50 卷，第 2 期，第 718-759 页，2021 年 1 月。
无线网络资源管理中的一个首要问题是评估其容量：利用所有可用工具：功率控制、调度、路由、信道分配和速率调整，网络中可以实现多少通信？我们在无线干扰的物理模型中提出了第一个近似算法框架，它在干扰受限的网络中完全解决了这些问题。获得的近似值至多是链路长度和速率分集的双对数。在已知先前边界的情况下，这给出了指数改进或更好。关键的见解是发现正确选择的功率分配可以推断出一种局部性形式，或对较短和较长通信链路的干扰的容忍度。这使我们能够以很小的代价将物理模型的复杂干扰关系简化为一种新形式的冲突图。我们还表明，对于任何冲突图公式，所获得的近似值可以证明是最好的。