Estimating the number of competing terminals without a state variation detector in wireless LAN

Abstract

Estimating the number of competing terminals n (who wish to transmit a packet at the same time) in the IEEE 802.11 system is important for system throughput performance because optimal back-off window size needs to be selected based on n. Therefore, as a new approach for estimating n, we propose H infinity filter that does not need a state variation detector as opposed to the cases of previously proposed approaches. The state variation detector’s flaw is incurring tracking latency in addition to the side effect of increased computational cost. All previously proposed approaches demand the employment of the state variation detector to detect the variation of n in the IEEE 802.11 system. By employing H infinity filter, we show improved throughput performance of the system compared to that of previously proposed approaches (e.g., the Kalman filter and particle filter) based on the improved performance in tracking n. In this paper, we justify the superiority of the proposed approach in the terms of tracking performance, throughput performance, and computational complexity.