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
2129374252 2111854969 1992067851 2133492106
The IEEE 802.11 standard for wireless local area networks (WLANs) employs a medium access control (MAC), called distributed coordination function (DCF), which is based on carrier sense multiple access with collision avoidance (CSMA CA). The collision avoidance mechanism utilizes the random backoff prior to each frame transmission attempt. The random nature of the backoff reduces the collision probability, but cannot completely eliminate collisions. It is known that the throughput performance of the 802.11 WLAN is significantly compromised as the number of stations increases. In this paper, we propose a novel distributed reservation-based MAC protocol, called early backoff announcement (EBA), which is backward compatible with the legacy DCF. Under EBA, a station announces its future backoff information in terms of the number of backoff slots via the MAC header of its frame being transmitted. All the stations receiving the information avoid collisions by excluding the same backoff duration when selecting their future backoff value. Through extensive simulations, EBA is found to achieve a significant increase in the throughput performance as well as a higher degree of fairness compared to the 802.11 DCF. The MAC layer of the 802.11 standard, based on the CSMA CA mechanism, specifies a set of parameters to control the aggressiveness of stations when trying to access the channel. However, these parameters are statically set independently of the conditions of the WLAN (e.g. the number of contending stations), leading to poor performance for most scenarios. To overcome this limitation previous work proposes to adapt the value of one of those parameters, namely the CW, based on an estimation of the conditions of the WLAN. However, these approaches suffer from two major drawbacks: i) they require extending the capabilities of standard devices or ii) are based on heuristics. In this paper we propose a control theoretic approach to adapt the CW to the conditions of the WLAN, based on an analytical model of its operation, that is fully compliant with the 802.11e standard. We use a Proportional Integrator controller in order to drive the WLAN to its optimal point of operation and perform a theoretic analysis to determine its configuration. We show by means of an exhaustive performance evaluation that our algorithm maximizes the total throughput of the WLAN and substantially outperforms previous standard-compliant proposals. We focus on energy saving in 802.11-based WLANs. Previous work has shown that, on the one hand, 802.11 wireless interfaces consume a significant amount of energy, on the other hand the use of current power management schemes can severely degrade the QoS performance of several Internet-based applications. Furthermore, the energy spent by wireless devices may even increase when the standard 802.11 power-saving mode (PSM) is implemented. These facts suggest that other solutions to energy saving are highly needed.In this paper, we consider the 802.11 distributed access scheme and we propose a novel approach that enables a station to enter a low-power operational state during channel contention. More specifically, our technique exploits the virtual carrier sense mechanism and the backoff function specified in the IEEE 802.11 DCF, so that a station can dramatically reduce its energy consumption without significant degradation of the QoS performance. To efficiently implement our mechanism, a low-power state with negligible transition time into the active state must be identified. This can be any of the non-standard, low-power states defined by proprietary solutions in the current or next-generation products [7,15,22]. By using the network simulator ns2, we evaluate the performance improvement that is obtained when the proposed mechanism is implemented, against the results attained through the standard DCF. The results show that we can achieve a reduction in energy consumption as large as 80 and 28 under, respectively, UDP and TCP traffic. The popularity of IEEE 802.11 WLANs has led to dense deployments in urban areas. High density leads to sub-optimal performance unless the interfering networks learn how to optimally use and share the spectrum. This paper proposes two fully distributed algorithms that allow (i) multiple interfering 802.11 access points to select their operating frequency in order to minimize interference, and (ii) users to choose the access point they attach to, in order to get their fair share of the whole network bandwidth. The proposed algorithms rely on Gibbs sampler, and do not require explicit coordination among the wireless devices. They only require the participating wireless nodes to measure local quantities such as interference and transmission delay. The algorithms are shown to lead to optimal bandwidth sharing, where optimality is defined according to the minimal potential delay. We analytically prove the convergence of the proposed algorithms, and study their performance by simulation.