Novel Adaptive DCF Protocol Using the Computationally-Efficient Optimization with the Feedback Network Information for Wireless Local-Area Networks

摘要

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.