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.

翻译：事实表明,根据高压干扰模型,无线特设网络最高排期算法的性能可能比以前所知道的要好得多。 对分布式、贪婪的排期算法的准确最坏性能进行了分析。