On some distributed scheduling algorithms for wireless networks with hypergraph interference models
No Thumbnail Available
Date
2021-05-01
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
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.
Description
uGDX
Keywords
Hypergraph interference models, wireless net- works, admission control, fractional chromatic number, upper bounds, maximal scheduling, distributed algorithms