Enforcing End-To-End Proportional Fairness with Bounded Buffer Overflow Probabilities in Ad-Hoc Wireless Networks

Overview & Synopsis

In this paper, we present a distributed flow-based access scheme for slotted-time protocols, that providesproportional fairness in ad-hoc wireless networks under constraints on the buffer overflow probabilities ateach node. The proposed scheme requires local information exchange at the link-layer and end-to-endinformation exchange at the transport-layer, and is cast as a nonlinear program. A medium access controlprotocol is said to be proportionally fair with respect to individual end-to-end flows in a network, if theproduct of the end-to-end flow rates is maximized. A key contribution of this work lies in the construction ofa distributed dual approach that comes with low computational overhead. We discuss the convergenceproperties of the proposed scheme and present simulation results to support our conclusions.