On some distributed scheduling algorithms for wireless networks with hypergraph interference models
arXiv:1910.01909 · doi:10.1109/TIT.2021.3059719
Abstract
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.
IEEE Transactions on Information Theory, accepted/to appear