ACM Home Page
Please provide us with feedback. Feedback
Achieving MAC layer fairness in wireless packet networks
Full text PdfPdf (1.36 MB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 6th annual international conference on Mobile computing and networking table of contents
Boston, Massachusetts, United States
Pages: 87 - 98  
Year of Publication: 2000
ISBN:1-58113-197-6
Authors
Thyagarajan Nandagopal  Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1308 W. Main Street, Urbana, IL
Tae-Eun Kim  Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1308 W. Main Street, Urbana, IL
Xia Gao  Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1308 W. Main Street, Urbana, IL
Vaduvur Bharghavan  Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1308 W. Main Street, Urbana, IL
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
IEICE : Inst of Electronics, Info & Communication Engineers
IFIP WG 6.3 : IFIP WG 6.3
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 28,   Downloads (12 Months): 293,   Citation Count: 86
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/345910.345925
What is a DOI?

ABSTRACT

Link-layer fairness models that have been proposed for wireline and packet cellular networks cannot be generalized for shared channel wireless networks because of the unique characteristics of the wireless channel, such as location-dependent contention, inherent conflict between optimizing channel utilization and achieving fairness, and the absence of any centralized control. In this paper, we propose a general analytical framework that captures the unique characteristics of shared wireless channels and allows the modeling of a large class of system-wide fairness models via the specification of per-flow utility functions. We show that system-wide fairness can be achieved without explicit global coordination so long as each node executes a contention resolution algorithm that is designed to optimize its local utility function. We present a general mechanism for translating a given fairness model in our framework into a corresponding contention resolution algorithm. Using this translation, we derive the backoff algorithm for achieving proportional fairness in wireless shared channels, and compare the fairness properties of this algorithm with both the ideal proportional fairness objective, and state-of-the-art backoff-based contention resolution algorithms. We believe that the two aspects of the proposed framework, i.e. the ability to specify arbitrary fairness models via local utility functions, and the ability to automatically generate local contention resolution mechanisms in response to a given utility function, together provide the path for achieving flexible service differentiation in future shared channel wireless networks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
IEEE, "Wireless LAN Medium Access Control(MAC) and Physical Layer(PHY) specifications." IEEE Standard 802.11, June 1999.
 
5
F. P. Kelly, A. Maulloo, and D. Tan, "Kate control in communication networks: shadow prices, proportional fairness and stability," journal of the Operational Research Society, vol. 49, pp. 237-252, March 1998.
6
 
7
S. Lu, T. Nandagopal, and V. Bharghavan, "Fair scheduling in wireless packet networks," in A CM MO- BICOM, October 1998.
8
 
9
V. Bharghavan, "Performance Analysis of a Medium Access Protocol for Wireless Packet Networks," in IEEE Performance and Dependability Symposium, August 1998.
10
 
11
"ns-2 Network Simulator," http://www-mash.cs.berkeley, edu/ns/, 1998.
 
12
T. Nandagopal, T. Kim, X. Gao, and V. Bharghavan, "Fairness Models for Medium Access Control in Wireless Packet Networks," TIMELY Research Report, June 2000.
 
13
S. Shenker, "Fundamental Design Issues for the Future Internet," IEEE Journal on Selected Areas in Communications(JSAC), vol. 13, pp. 1176-1188, 1995.
 
14
S. Kunniyur and R. Srikant, "End-to-End Congestion Control Schemes: Utility Functions, Random Losses and ECN Marks," in IEEE iNFOCOM, March 2000.
 
15
L. Massoulie and J. Roberts, "Bandwidth Sharing: Objectives and Algorithms," in iEEE INFOCOM, March 1999.

CITED BY  86

Collaborative Colleagues:
Thyagarajan Nandagopal: colleagues
Tae-Eun Kim: colleagues
Xia Gao: colleagues
Vaduvur Bharghavan: colleagues