Thyagarajan Nandagopal
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.
- 1.A. Demers, $. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," in A CM SIG- COMM., August 1989. Google Scholar
Digital Library
- 2.V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, "MACAW: A Media Access Protocol for Wireless LANs," in A CM SIGCOMM, September 1994. Google ScholarDigital Library
- 3.J. Garcia-Luna-Aceves and C. Fullmer, "Floor Acquisition Multiple Access (FAMA) in Single-Channel Wireless Networks," Mobile Networks and Applications, vol. 4, pp. 157-174, 1999. Google ScholarDigital Library
- 4.IEEE, "Wireless LAN Medium Access Control(MAC) and Physical Layer(PHY) specifications." IEEE Standard 802.11, June 1999.Google Scholar
- 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.Google Scholar
- 6.T. Ozugur, M. Naghshineh, P. Kermani, C. Olsen, B. Rezvani, and J. Copeland, "Balanced Media Access Methods for Wireless Networks," in A CM MOBICOM, October 1998. Google ScholarDigital Library
- 7.S. Lu, T. Nandagopal, and V. Bharghavan, "Fair scheduling in wireless packet networks," in A CM MO- BICOM, October 1998.Google Scholar
- 8.H. Luo, S. Lu, and V. Bharghavan, "A New Model for Packet Scheduling in Multihop Wireless Networks," in A CM MOBICOM, August 2000. Google ScholarDigital Library
- 9.V. Bharghavan, "Performance Analysis of a Medium Access Protocol for Wireless Packet Networks," in IEEE Performance and Dependability Symposium, August 1998.Google Scholar
- 10.S. Shenker, "Some Conjenctures on the Behavior of Acknowledgement-Based Transmission Control of Random Access Communication Channels," in A CM SIG- METRICS, September 1987. Google ScholarDigital Library
- 11."ns-2 Network Simulator," http://www-mash.cs.berkeley, edu/ns/, 1998.Google Scholar
- 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.Google Scholar
- 13.S. Shenker, "Fundamental Design Issues for the Future Internet," IEEE Journal on Selected Areas in Communications(JSAC), vol. 13, pp. 1176-1188, 1995. Google ScholarDigital Library
- 14.S. Kunniyur and R. Srikant, "End-to-End Congestion Control Schemes: Utility Functions, Random Losses and ECN Marks," in IEEE iNFOCOM, March 2000.Google Scholar
- 15.L. Massoulie and J. Roberts, "Bandwidth Sharing: Objectives and Algorithms," in iEEE INFOCOM, March 1999.Google Scholar
Index Terms
- Achieving MAC layer fairness in wireless packet networks
Recommendations
Achieving MAC-layer fairness in CSMA/CA networks
We demonstrate that CSMA/CA networks, including IEEE 802.11 networks, exhibit severe fairness problem in many scenarios, where some hosts obtain most of the channel's bandwidth while others starve. Most existing solutions require nodes to overhear ...
Achieving per-station fairness in IEEE 802.11 wireless LANs
WOWMOM '10: Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)In this paper, we address the issue of per-station fairness in IEEE 802.11-based wireless local area networks (WLANs). Although the IEEE 802.11 Distributed Coordination Function (DCF) has been designed to provide a fair channel access for all competing ...
MAC-layer time fairness across multiple wireless LANs
INFOCOM'10: Proceedings of the 29th conference on Information communicationsWireless LANs have been densely deployed in many urban areas. Contention among nearby WLANs is locationsensitive, which makes some hosts much more capable than others to obtain the channel for their transmissions. Another reality is that wireless hosts ...
Comments