Data networks
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit
IEEE/ACM Transactions on Networking (TON)
A capacity analysis for the IEEE 802.11 MAC protocol
Wireless Networks
Improving protocol capacity with model-based frame scheduling in IEEE 802.11-operated WLANs
Proceedings of the 9th annual international conference on Mobile computing and networking
Delay Analysis of IEEE 802.11 in Single-Hop Networks
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
An Analysis for Differentiated Services in IEEE 802.11 and IEEE 802.11e Wireless LANs
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
A scalable model for channel access protocols in multihop ad hoc networks
Proceedings of the 10th annual international conference on Mobile computing and networking
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
CSMA/CA performance under high traffic conditions: throughput and delay analysis
Computer Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Saturation throughput analysis of IEEE 802.11e enhanced distributed coordination function
IEEE Journal on Selected Areas in Communications
Performance analysis of IEEE 802.11 ad hoc based broadcast
Proceedings of the 2011 ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Along with the success of IEEE 802.11-compliant WLANs, the distributed coordinated function (DCF) specified as the contention-based medium access mechanism in IEEE 802.11 has been widely used to support applications in new regimes. A thorough understanding of the characteristics of IEEE 802.11 DCF is therefore a research focus. DCF assumes the binary exponential backoff algorithm (BEBA) [D. Bertsekas, R. Gallager, Data Networks, Prentice Hall, 1992]. Several existing models that characterize BEBA as a p-persistent scheme have ignored several subtle protocol details. This has practically constrained the models from being applied in a broader range of configurations, e.g., small contention window, and from being further extended, e.g., 802.11e EDCA. In this paper, we develop an analytical model that captures the subtlety, and faithfully describes the channel activities as governed by DCF. Based on the devised model, we perform a rigorous analysis on the saturation throughput performance in a single-hop WLAN. We show that the stochastic property of the backoff time, r, may substantially impact the system performance. For example, setting the range of r to [1,CW] instead of [0,CW-1], can degrade the system throughput considerably. We also identify, by clearly defining and thus being able to differentiate the two terms, attempt probability and transmission probability, an erroneous extension made to Bianchi's model [G. Bianchi, Performance analysis of the IEEE 802.11 distributed coordination function, IEEE JSAC, 18(3) (2000) 535-547]. All the findings are corroborated by ns-2 simulation.