A-DRAFT: an adaptive QoS mechanism to support absolute and relative throughput in 802.11 wireless LANs

Authors:
Wasan Pattara-Atikom;Sujata Banerjee;Prashant Krishnamurthy
Affiliations:
University of Pittsburgh, Pittsburgh, PA;University of Pittsburgh, Pittsburgh, PA and Hewlett-Packard Laboratories, Palo Alto, CA;University of Pittsburgh, Pittsburgh, PA
Venue:
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Year:
2004

Citing 4
Cited 4

Distributed fair scheduling in a wireless LAN

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Quality of service schemes for IEEE 802.11 wireless LANs: an evaluation

Mobile Networks and Applications
Distributed mechanisms for quality of service in wireless LANs

IEEE Wireless Communications
Saturation throughput analysis of IEEE 802.11e enhanced distributed coordination function

IEEE Journal on Selected Areas in Communications

Modelling and analysis of bandwidth competition in 802.11 wireless networks

International Journal of Mobile Network Design and Innovation
An adaptive fair-distributed scheduling algorithm to guarantee QoS for both VBR and CBR video traffics on IEEE 802.11e WLANs

EURASIP Journal on Advances in Signal Processing
C3F2-DMAC: clustered contention and contention free fully decentralized MAC for the 3M environment: Real-time multimedia, multi-hop, and mobile

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Novel mechanisms for quality of service improvements in wireless ad hoc networks

WSEAS TRANSACTIONS on SYSTEMS

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several distributed QoS mechanisms have been proposed to augment the existing distributed coordination function of the IEEE 802.11 MAC protocol to provide QoS support for QoS-sensitive applications. These mechanisms use well-known QoS enabling techniques such as priority assignment and fair scheduling within existing 802.11 MAC parameters. Although these mechanisms provide differentiated throughput for different classes of traffic, they cannot provide both relative and absolute throughput support simultaneously.In this paper, we propose a new mechanism called A-DRAFT that supports both absolute and relative throughput in an adaptive and a fully distributed manner. This paper describes an adaptive mechanism that supports absolute throughput as long as the total demand from this class is below the effective channel capacity. The proposed mechanism also provides relative or fair throughput support with low variation and a high degree of fairness even in a saturated network with a large number of MSs. We make use of deficit round robin scheduling with different levels of quantum rate to provide fairness, and different weights to provide absolute and relative throughput. We evaluate the performance of the proposed mechanism via mathematical analysis and confirm this analysis with simulations.