2000 character limit reached
On some distributed scheduling algorithms for wireless networks with hypergraph interference models
Published 3 Oct 2019 in cs.IT, cs.NI, and math.IT | (1910.01909v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.