In 802.11 WLANs, adapting the contention parameters to network conditions results in substantial performance improvements. Even though the ability to change these parameters has been available in standard devices for years, so far no adaptive mechanism using this functionality has been validated in a realistic deployment. In this paper we report our experiences with implementing and evaluating two adaptive algorithms based on control theory, one centralized and one distributed, in a large-scale testbed consisting of 18 commercial off-the-shelf devices. We conduct extensive measurements, considering different network conditions in terms of number of active nodes, link qualities, and data traffic. We show that both algorithms significantly outperform the standard configuration in terms of total throughput. We also identify the limitations inherent in distributed schemes, and demonstrate that the centralized approach substantially improves performance under a large variety of scenarios, which confirms its suitability for real deployments.
Distributed approaches. Several works @cite_4 @cite_0 @cite_19 @cite_22 @cite_27 have proposed mechanisms that independently adjust the backoff operation of each stations in the WLAN. The main disadvantages of these approaches are that they change the rules of the IEEE 802.11 standard and therefore require introducing significant hardware or firm-ware modifications.
@cite_4 @cite_22 @cite_0 @cite_19 @cite_27
2040476490 2145859593 2107830311 2104935654 2021521923
This paper presents a theoretical study on distributed contention window control algorithms for achieving arbitrary bandwidth allocation policies and efficient channel utilization. By modeling different bandwidth allocation policies as an optimal contention window assignment problem, the authors design a general and fully distributed contention window control algorithm, called general contention window adaptation (GCA), and prove that it converges to the solution of the contention window assignment problem. By examining the stability of GCA, we identify the optimal stable point that maximizes channel utilization and provide solutions to control the stable point near the optimal point. Due to the generality of GCA, this work provides a theoretical foundation to analyze existing and design new contention window control algorithms. IEEE 802.11 is the standard for wireless local area networks (WLANs) promoted by the Institute of Electrical and Electronics Engineers. Wireless technologies in the LAN environment are becoming increasingly important and the IEEE 802.11 is the most mature technology to date. Previous works have pointed out that the standard protocol can be very inefficient and that an appropriate tuning of its congestion control mechanism (i.e., the backoff algorithm) can drive the IEEE 802.11 protocol close to its optimal behavior. To perform this tuning, a station must have exact knowledge of the network contention level; unfortunately, in a real case, a station cannot have exact knowledge of the network contention level (i.e., number of active stations and length of the message transmitted on the channel), but it, at most, can estimate it. We present and evaluate a distributed mechanism for contention control in IEEE 802.11 wireless LANs. Our mechanism, named asymptotically optimal backoff (AOB), dynamically adapts the backoff window size to the current network contention level and guarantees that an IEEE 802.11 WLAN asymptotically achieves its optimal channel utilization. The AOB mechanism measures the network contention level by using two simple estimates: the slot utilization and the average size of transmitted frames. These estimates are simple and can be obtained by exploiting information that is already available in the standard protocol. AOB can be used to extend the standard 802.11 access mechanism without requiring any additional hardware. The performance of the IEEE 802.11 protocol, with and without the AOB mechanism, is investigated through simulation. Simulation results indicate that our mechanism is very effective, robust, and has traffic differentiation potentialities. The IEEE 802.11 medium access control (MAC) protocol provides a contention-based distributed channel access mechanism for mobile stations to share the wireless medium, which may introduce a lot of collisions in case of overloaded active stations. Slow contention window (CW) decrease scheme is a simple and efficient solution for this problem. In this paper, we use an analytical model to compare the slow CW decrease scheme to the IEEE 802.11 MAC protocol. Several parameters are investigated such as the number of stations, the initial CW size, the decrease factor value, the maximum backoff stage and the coexistence with the RequestToSend and ClearToSend (RTS CTS) mechanism. The results show that the slow CW decrease scheme can efficiently improve the throughput of IEEE 802.11, and that the throughput gain is higher when the decrease factor is larger. Moreover, the initial CW size and maximum backoff stage also affect the performance of slow CW decrease scheme. We consider wireless LANs such as IEEE 802.11 operating in the unlicensed radio spectrum. While their nominal bit rates have increased considerably, the MAC layer remains practically unchanged despite much research effort spent on improving its performance. We observe that most proposals for tuning the access method focus on a single aspect and disregard others. Our objective is to define an access method optimized for throughput and fairness, able to dynamically adapt to physical channel conditions, to operate near optimum for a wide range of error rates, and to provide equal time shares when hosts use different bit rates.We propose a novel access method derived from 802.11 DCF [2] (Distributed Coordination Function) in which all hosts use similar values of the contention window CW to benefit from good short-term access fairness. We call our method Idle Sense, because each host observes the mean number of idle slots between transmission attempts to dynamically control its contention window. Unlike other proposals, Idle Sense enables each host to estimate its frame error rate, which can be used for switching to the right bit rate. We present simulations showing how the method leads to high throughput, low collision overhead, and low delay. The method also features fast reactivity and time-fair channel allocation. In WLANs, the medium access control (MAC) protocol is the main element that determines the efficiency of sharing the limited communication bandwidth of the wireless channel. The fraction of channel bandwidth used by successfully transmitted messages gives a good indication of the protocol efficiency, and its maximum value is referred to as protocol capacity. In a previous paper we have derived the theoretical limit of the IEEE 802.11 MAC protocol capacity. In addition, we showed that if a station has an exact knowledge of the network status, it is possible to tune its backoff algorithm to achieve a protocol capacity very close to its theoretical bound. Unfortunately, in a real case, a station does not have an exact knowledge of the network and load configurations (i.e., number of active stations and length of the message transmitted on the channel) but it can only estimate it. In this work we analytically study the performance of the IEEE 802.11 protocol with a dynamically tuned backoff based on the estimation of the network status. Results obtained indicate that under stationary traffic and network configurations (i.e., constant average message length and fixed number of active stations), the capacity of the enhanced protocol approaches the theoretical limits in all the configurations analyzed. In addition, by exploiting the analytical model, we investigate the protocol performance in transient conditions (i.e., when the number of active stations sharply changes).