About: Distributed coordination function is a research topic. Over the lifetime, 2044 publications have been published within this topic receiving 48849 citations.
TL;DR: In this paper, a simple but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions, is presented.
Abstract: The IEEE has standardized the 802.11 protocol for wireless local area networks. The primary medium access control (MAC) technique of 802.11 is called the distributed coordination function (DCF). The DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slotted exponential backoff. This paper provides a simple, but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions. The proposed analysis applies to both the packet transmission schemes employed by DCF, namely, the basic access and the RTS/CTS access mechanisms. In addition, it also applies to a combination of the two schemes, in which packets longer than a given threshold are transmitted according to the RTS/CTS mechanism. By means of the proposed model, we provide an extensive throughput performance evaluation of both access mechanisms of the 802.11 protocol.
TL;DR: A distributed algorithm is proposed that enables each station to tune its backoff algorithm at run-time and indicates that the capacity of the enhanced protocol is very close to the theoretical upper bound in all the configurations analyzed.
Abstract: In wireless LANs (WLANs), the medium access control (MAC) protocol is the main element that determines the efficiency in sharing the limited communication bandwidth of the wireless channel. In this paper we focus on the efficiency of the IEEE 802.11 standard for WLANs. Specifically, we analytically derive the average size of the contention window that maximizes the throughput, hereafter theoretical throughput limit, and we show that: 1) depending on the network configuration, the standard can operate very far from the theoretical throughput limit; and 2) an appropriate tuning of the backoff algorithm can drive the IEEE 802.11 protocol close to the theoretical throughput limit. Hence we propose a distributed algorithm that enables each station to tune its backoff algorithm at run-time. The performances of the IEEE 802.11 protocol, enhanced with our algorithm, are extensively investigated by simulation. Specifically, we investigate the sensitiveness of our algorithm to some network configuration parameters (number of active stations, presence of hidden terminals). Our results indicate that the capacity of the enhanced protocol is very close to the theoretical upper bound in all the configurations analyzed.
TL;DR: This paper proposes a scheme named DCF+, which is compatible with DCF, to enhance the performance of reliable transport protocol over WLAN and introduces an analytical model to compute the saturated throughput of WLAN.
Abstract: IEEE 802.11 medium access control (MAC) is proposed to support asynchronous and time bounded delivery of radio data packets in infrastructure and ad hoc networks. The basis of the IEEE 802.11 WLAN MAC protocol is a distributed coordination function (DCF), which is a carrier sense multiple access with collision avoidance (CSMA/CA) with a binary slotted exponential back-off scheme. Since IEEE 802.11 MAC has its own characteristics that are different from other wireless MAC protocols, the performance of reliable transport protocol over 802.11 needs further study. This paper proposes a scheme named DCF+, which is compatible with DCF, to enhance the performance of reliable transport protocol over WLAN. To analyze the performance of DCF and DCF+, this paper also introduces an analytical model to compute the saturated throughput of WLAN. Compared with other models, this model is shown to be able to predict the behavior of 802.11 more accurately. Moreover, DCF+ is able to improve the performance of TCP over WLAN, which is verified by modeling and elaborate simulation results.
TL;DR: This paper proposes an adaptive contention window mechanism, which dynamically selects the optimal backoff window according to the estimate of the number of contending stations, and shows that this technique leads to stable behavior, and it outperforms the standard protocol when the network load and theNumber of mobile stations are high.
Abstract: The IEEE 802.11 protocol for wireless local area networks adopts a CSMA/CA protocol with exponential backoff as medium access control technique. As the throughput performance of such a scheme becomes critical when the number of mobile stations increases, in this paper we propose an adaptive contention window mechanism, which dynamically selects the optimal backoff window according to the estimate of the number of contending stations. We show that this technique leads to stable behavior, and it outperforms the standard protocol when the network load and the number of mobile stations are high. We also investigate the CSMA/CA with the optional RTS/CTS technique, and we show that our adaptive technique reaches better performance only when the packet size is short. Finally, the performance of a system environment with hidden terminals show that the RTS/CTS mechanism, which can also be used in conjunction with the adaptive contention window mechanism, provides significant improvements.
TL;DR: Simulation results show that the proposed algorithm is able to schedule transmissions such that the bandwidth allocated to different flows is proportional to their weights.
Abstract: Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weightsof the packet flows sharing the channel. This paper presents a fully distributed algorithm for fair scheduling in a wireless LAN. The algorithm can be implemented without using a centralized coordinator to arbitrate medium access. The proposed protocol is derived from the Distributed Coordination Function in the IEEE 802.11 standard. Simulation results show that the proposed algorithm is able to schedule transmission such that the bandwidth allocated to different flows is proportional to their weights. An attractive feature of the proposed approach is that it can be implemented with simple modifications to the IEEE 802.11 standard.