Files in this item



application/pdfUILU-ENG-08-2211_DC-238 assembled.pdf (3MB)
(no description provided)PDF


Title:Enforcing End-to-End Proportional Fairness with Bounded Buffer Overflow Probabilities
Author(s):Singh, Nikhil; Sreenivas, Ramavarapu S.; Shanbhag, Uday V.
Subject(s):Proportional fairness
Buffer overflow probabilities
Wireless LAN
Access protocols
Resource management
Abstract:In this paper we present a distributed flow-based access scheme for slotted-time protocols, that provides proportional fairness in ad hoc wireless networks under constraints on the buffer overflow probabilities at each node. The proposed scheme requires local information exchange at the link-layer and end-to-end information exchange at the transport-layer, and is cast in the framework of nonlinear optimization. We say a medium access control protocol is proportionally fair with respect to individual end-to-end flows in a network, if the product of the end-to-end rates of flows is maximized. A key contribution of this work lies in the construction of a distributed dual approach that comes with low computational overhead. We discuss the convergence properties of the proposed scheme and present simulation results to support our conclusions.
Issue Date:2008-08
Publisher:Coordinated Science Laboratory, University of Illinois at Urbana-Champaign
Series/Report:Coordinated Science Laboratory Report no. UILU-ENG-08-2211, DC-238
Genre:Technical Report
Sponsor:NSF / CNS-0437415 and NSF ECCS-0426831
Date Available in IDEALS:2018-04-04

This item appears in the following Collection(s)

Item Statistics