Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network

@inproceedings{citeulike:311938, abstract = {Throughput performance of the IEEE 802.11 distributed coordination function (DCF) is very sensitive to the number n of competing stations. The contribute of this paper is threefold. First, we show that n can be expressed as function of the collision probability encountered on the channel; hence, it can be estimated based on run-time measurements. Second, we show that the estimation of n, based on exponential smoothing of the measured collision probability (specifically, an ARMA filter), results to be a biased estimation, with poor performance in terms of accuracy/tracking trade-offs. Third, we propose a methodology to estimate n, based on an extended Kalman filter coupled with a change detection mechanism. This approach shows both high accuracy as well as prompt reactivity to changes in the network occupancy status. Numerical results show that, although devised in the assumption of saturated terminals, our proposed approach results effective also in non-saturated conditions, and specifically in tracking the average number of competing terminals.}, author = {Bianchi, G. and Tinnirello, I. }, citeulike-article-id = {311938}, journal = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE}, keywords = {network, wifi}, pages = {844--852 vol.2}, posted-at = {2008-02-05 16:38:47}, priority = {2}, title = {Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1208922}, volume = {2}, year = {2003} }

TY - CONF ID - citeulike:311938 L3 - citeulike-article-id:311938 TI - Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network JF - INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE VL - 2 SP - 844 EP - 852 vol.2 N2 - Throughput performance of the IEEE 802.11 distributed coordination function (DCF) is very sensitive to the number n of competing stations. The contribute of this paper is threefold. First, we show that n can be expressed as function of the collision probability encountered on the channel; hence, it can be estimated based on run-time measurements. Second, we show that the estimation of n, based on exponential smoothing of the measured collision probability (specifically, an ARMA filter), results to be a biased estimation, with poor performance in terms of accuracy/tracking trade-offs. Third, we propose a methodology to estimate n, based on an extended Kalman filter coupled with a change detection mechanism. This approach shows both high accuracy as well as prompt reactivity to changes in the network occupancy status. Numerical results show that, although devised in the assumption of saturated terminals, our proposed approach results effective also in non-saturated conditions, and specifically in tracking the average number of competing terminals. KW - network KW - wifi AU - Bianchi, G AU - Tinnirello, I PY - 2003/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1208922 ER -