A Simple Critical-Load-Based CAC Scheme for IEEE 802.11 DCF Networks

This paper proposes a simple and practical call admission control (CAC) scheme for one-hop IEEE 802.11 distributed coordination function (DCF) networks in heterogeneous environments. The proposed scheme is the first CAC scheme derived from an asymptotic analysis of the critical traffic load, where t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2011-10, Vol.19 (5), p.1485-1498
Main Authors: Qinglin Zhao, Tsang, D. H. K., Sakurai, T.
Format: Article
Language:English
Subjects:
Admission control
Analytical models
Approximation methods
Asymptotic properties
buffer size
Delay
IEEE 802.11
IEEE 802.11 Standards
Load modeling
Mathematical analysis
Network topology
Networks
Performance measurement
Queueing analysis
Simulation
Traffic engineering
Traffic flow
traffic load
Voice
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes a simple and practical call admission control (CAC) scheme for one-hop IEEE 802.11 distributed coordination function (DCF) networks in heterogeneous environments. The proposed scheme is the first CAC scheme derived from an asymptotic analysis of the critical traffic load, where the critical traffic load represents the threshold for queue stability. The salient feature of our CAC scheme is that it can be performed quickly and easily without the need for network performance measurements and complex calculations. Using the proposed scheme, we specifically investigate the voice capacity of 802.11 DCF networks with unbalanced traffic. Extensive simulations covering both ad hoc and infrastructure-based networks, and a variety of nonsaturated traffic types, show that the proposed CAC scheme is very effective.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2011.2116801