Research Article
On Distributed Algorithms that Enforce Proportional Fairness in Ad-hoc Wireless Networks
@INPROCEEDINGS{10.1109/WIOPT.2007.4480038, author={Nikhil Singh and Ramavarapu S. Sreenivas}, title={On Distributed Algorithms that Enforce Proportional Fairness in Ad-hoc Wireless Networks}, proceedings={5th International ICST Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks}, publisher={IEEE}, proceedings_a={WIOPT}, year={2008}, month={3}, keywords={Access protocols Computer industry Costs Delay estimation Distributed algorithms Media Access Protocol Modeling Systems engineering and theory Wireless application protocol Wireless networks}, doi={10.1109/WIOPT.2007.4480038} }- Nikhil Singh
Ramavarapu S. Sreenivas
Year: 2008
On Distributed Algorithms that Enforce Proportional Fairness in Ad-hoc Wireless Networks
WIOPT
IEEE
DOI: 10.1109/WIOPT.2007.4480038
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 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 ns2 simulations [12].
Copyright © 2007–2024 IEEE
