Novel adaptive DCF protocol using the computationally-efficient optimization with the feedback network information for wireless local-area networks

Authors:
Shih Yu Chang;Hsiao-Chun Wu
Affiliations:
Department of Computer Science, National Tsing Hua University, Taiwan;Department of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, LA
Venue:
IEEE Transactions on Wireless Communications
Year:
2009

Citing 4
Cited 1

Runtime Optimization of IEEE 802.11 Wireless LANs Performance

IEEE Transactions on Parallel and Distributed Systems
Distributed optimal contention window control for elastic traffic in single-cell wireless LANs

IEEE/ACM Transactions on Networking (TON)
Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications
Cooperative Relay Service in a Wireless LAN

IEEE Journal on Selected Areas in Communications

Novel adaptive DCF protocol with efficient optimization for wireless local-area networks

Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we design a novel computationally-efficient linear programming (LP) algorithm to maximize the throughput with respect to the minimum contention window size for the IEEE 802.11 Distributed Coordination Function (DCF) protocol. Based on our LP scheme, a new DCF protocol which can select the best access mode and the optimal size of the minimum contention window is proposed by considering the channel condition and the number of competing stations jointly. The numerical results demonstrate that our proposed DCF protocol significantly outperforms the conventional method.