—We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints....
— We propose a unifying framework for max-min fairness in orthogonal networks and networks with interference. First, a universal formulation of the max-min fairness problem for o...
Marcin Wiczanowski, Holger Boche, Slawomir Stancza...
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
We compare the performance of three usual allocations (max-min fairness, proportional fairness and balanced fairness) in a communication network whose resources are shared by a ra...