On Distributed Algorithms that Enforce Proportional Fairness in Ad-hoc Wireless Networks

In this paper we present a distributed flow-based access scheme for slotted-time protocols, that provides proportional- fairness in ad hoc wireless networks based on the local two- hop information of nodes. We say a medium access control algorithm is
proportionally

fair
with respect to individual end- to-end flows in a network, if the product of the end-to-end
flow-success

probabilities
is maximized. The proposed scheme is implemented using a slotted-time protocol - ST-MAC [14]. We then present the preliminary results evaluating the fairness properties of the ST-MAC protocol using
ns
2 simulations [12].