Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...