On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 endto-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].

Original languageEnglish (US)
Title of host publicationProceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007
DOIs
StatePublished - Dec 1 2007
Event5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007 - Limassol, Cyprus
Duration: Apr 16 2007Apr 20 2007

Publication series

NameProceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007

Other

Other5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2007
Country/TerritoryCyprus
CityLimassol
Period4/16/074/20/07

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'On distributed algorithms that enforce proportional fairness in ad-hoc wireless networks'. Together they form a unique fingerprint.

Cite this