It is shown that the performance of the maximal scheduling algorithm in wireless ad hoc networks under the hypergraph interference model can be further away from optimal than previously known. The exact worst-case performance of this distributed, greedy scheduling algorithm is analyzed.

中文翻译：

---

超图干扰模型的无线网络分布式调度算法研究

结果表明，在超图干扰模型下，无线自组网中最大调度算法的性能可能会比以前已知的更好。分析了此分布式贪婪调度算法的确切最坏情况性能。