On some distributed scheduling algorithms for wireless networks with hypergraph interference models
Information Theory
2021-06-08 v2 Networking and Internet Architecture
math.IT
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.
Cite
@article{arxiv.1910.01909,
title = {On some distributed scheduling algorithms for wireless networks with hypergraph interference models},
author = {Ashwin Ganesan},
journal= {arXiv preprint arXiv:1910.01909},
year = {2021}
}
Comments
IEEE Transactions on Information Theory, accepted/to appear