On some distributed scheduling algorithms for wireless networks with hypergraph interference models

TL;DR

This paper analyzes the worst-case performance of a distributed greedy scheduling algorithm in wireless ad hoc networks considering hypergraph interference, revealing it can be less optimal than previously thought.

Contribution

It provides the exact worst-case performance analysis of the maximal scheduling algorithm under hypergraph interference models.

Findings

Maximal scheduling can perform worse than previously estimated.

The paper derives the exact worst-case bounds for the algorithm.

Hypergraph interference models significantly impact scheduling performance.

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.