High performance distributed coordination function for wireless LANs

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The performance of DCF, the basic MAC scheme in IEEE 802.11, degrades under larger network sizes, and higher loads due to higher contention and so more idle slots and higher collision rates. We propose a new high-performance DCF (HDCF) protocol that achieves a higher and more stable performance while providing fair access among all users. In HDCF, the transmitting stations randomly select the next transmitter and so active stations do not contend for the channel, and an interrupt scheme is used by newly transmitting stations without contending with the existing active stations. Thus, HDCF achieves collision avoidance and fairness without idle slots added by the backoff algorithm used in DCF. For evaluation, we provide Opnet simulation that considers saturated and non-saturated stations. Results show that HDCF outperforms DCF in terms of throughput, and long-term and short-term fairness with gains up to 391.2% of normalized throughput and 26.8% of fairness index. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Al-Mefleh, H., & Chang, J. M. (2008). High performance distributed coordination function for wireless LANs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4982 LNCS, pp. 812–823). https://doi.org/10.1007/978-3-540-79549-0_71

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free