新的改进IEEE 802.11 DCF性能的退避机制

分布式协调功能DCF是IEEE802.11标准最基本的媒体接入方法,它的核心是载波检测多址接入/冲突避免（CSMA/CA）机制,通过退避算法,减少碰撞的概率。提出了一种新的退避机制改进IEEE802.11DCF饱和吞吐量性能,建立了三维马尔可夫链网络模型详细研究分析,同时利用NS2对所提出的机制进行仿真,比较了改进后的802.11DCF饱和吞吐量与原802.11DCF的饱和吞吐量的大小,仿真结果证明了算法的准确有效。     

Performance analysis of the IEEE 802.11 distributed coordinationfunction

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     

IEEE 802.11协议中分布式协调机制的性能模型

IEEE 802.11采用异步传输方式作为媒体层的主要技术,而基于载波检测碰撞避免的分布式接入机制则是其最大的特点.关于分布式接入机制的研究,目前已经有了许多的模型,但是,大部分的模型都是研究终端所产生的数据包是固定长度,很少有模型来研究终端数据包是可变长度的情况.这种情况下的难点就是不易求得碰撞发生时信道所消耗的时间长度.本文则研究在终端数据包长度的分布函数为f(x)下协议的吞吐量和延迟性能模型.首先本文将原标准协议的退避算法看成是有固定大小的竞争窗口,用以求得站点的发送概率;然后,分析信道的工作状态,给出了性能模型,重点在求解碰撞消耗的信道时间,在文章的最后,我们通过仿真试验来验证了模型的正确性.     

Performance analysis of the IEEE 802.11 MAC protocol for wireless LANs

Wireless local area networks (WLANs) are extremely popular being almost everywhere including business, office and home deployments. The IEEE 802.11 protocol is the dominating standard for WLANs. The essential medium access control (MAC) mechanism of 802.11 is called distributed co‐ordination function (DCF). This paper provides a simple and accurate analysis using Markov chain modelling to compute IEEE 802.11 DCF performance, in the absence of hidden stations and transmission errors. This mathematical analysis calculates in addition to the throughput efficiency, the average packet delay, the packet drop probability and the average time to drop a packet for both basic access and RTS/CTS medium access schemes. The derived analysis, which takes into account packet retry limits, is validated by comparison with OPNET simulation results. We demonstrate that a Markov chain model presented in the literature, which also calculates throughput and packet delay by introducing an additional transition state to the Markov chain model, does not appear to model IEEE 802.11 correctly, leading to ambiguous conclusions for its performance. We also carry out an extensive and detailed study on the influence on performance of the initial contention window size (CW), maximum CW size and data rate. Performance results are presented to identify the dependence on the backoff procedure parameters and to give insights on the issues affecting IEEE 802.11 DCF performance. Copyright © 2005 John Wiley & Sons, Ltd.     

Performance Analysis of IEEE 802.11 DCF in Imperfect Channels

IEEE 802.11 is the most important standard for wireless local area networks (WLANs). In IEEE 802.11, the fundamental medium access control (MAC) scheme is the distributed coordination function (DCF). To understand the performance of WLANs, it is important to analyze IEEE 802.11 DCF. Recently, several analytical models have been proposed to evaluate the performance of DCF under different incoming traffic conditions. However, to the best of the authors' knowledge, there is no accurate model that takes into account both the incoming traffic loads and the effect of imperfect wireless channels, in which unsuccessful packet delivery may occur due to bit transmission errors. In this paper, the authors address this issue and provide an analytical model to evaluate the performance of DCF in imperfect wireless channels. The authors consider the impact of different factors together, including the binary exponential backoff mechanism in DCF, various incoming traffic loads, distribution of incoming packet size, queueing system at the MAC layer, and the imperfect wireless channels, which has never been done before. Extensive simulation and analysis results show that the proposed analytical model can accurately predict the delay and throughput performance of IEEE 802.11 DCF under different channel and traffic conditions.     

Optimal Constant-Window Backoff Scheme for IEEE 802.11 DCF in Single-Hop Wireless Networks Under Finite Load Conditions

Existing backoff scheme’s optimization of IEEE 802.11 DCF MAC protocol consider only saturated networks or asymptotic conditions. In real situations, traffic is bursty or streamed at low rates so that stations do not operate usually in saturated regime. In this work, we propose and analyze a backoff enhancement for IEEE 802.11 DCF that requires information only about the network size and that is quasi-optimal under all traffic loads. We first analyze the performance of DCF multiple access scheme under general load conditions in single-hop configuration and we provide an accurate delay statistics model that consider the self-loop probability in every backoff state. We prove then the short-term unfairness of the binary exponential backoff used in IEEE 802.11 by defining channel capture probability as fairness metric. Motivated by the results on fairness, we introduce the constant-window backoff scheme and we compare its performance to IEEE 802.11 DCF with Binary exponential backoff. The quasi-optimality of the proposed scheme is proved analytically and numerical results show that it increases, both the throughput and fairness, of IEEE 802.11 DCF while remaining insensitive to traffic intensity. The analysis is then extended to consider the finite queuing capacity at nodes buffers using results from the delay analysis. NS2 simulations validate the obtained results. Institut Eurecom’s research is partially supported by its industrial members: BMW Group Research & Technology—BMW Group Company, Bouygues Telecom, Cisco Systems, France Telecom , Hitachi Europe, SFR, Sharp, STMicroelectronics, Swisscom, Thales.     

Adaptive Optimization of IEEE 802.11 DCF Based on Bayesian Estimation of the Number of Competing Terminals

The performance of the Distributed Coordination Function (DCF) of the IEEE 802.11 protocol has been shown to heavily depend on the number of terminals accessing the distributed medium. The DCF uses a carrier sense multiple access scheme with collision avoidance (CSMA/CA), where the backoff parameters are fixed and determined by the standard. While those parameters were chosen to provide a good protocol performance, they fail to provide an optimum utilization of the channel in many scenarios. In particular, under heavy load scenarios, the utilization of the medium can drop tenfold. Most of the optimization mechanisms proposed in the literature are based on adapting the DCF backoff parameters to the estimate of the number of competing terminals in the network. However, existing estimation algorithms are either inaccurate or too complex. In this paper, we propose an enhanced version of the IEEE 802.11 DCF that employs an adaptive estimator of the number of competing terminals based on sequential Monte Carlo methods. The algorithm uses a Bayesian approach, optimizing the backoff parameters of the DCF based on the predictive distribution of the number of competing terminals. We show that our algorithm is simple yet highly accurate even at small time scales. We implement our proposed new DCF in the ns-2 simulator and show that it outperforms existing methods. We also show that its accuracy can be used to improve the results of the protocol even when the terminals are not in saturation mode. Moreover, we show that there exists a Nash equilibrium strategy that prevents rogue terminals from changing their parameters for their own benefit, making the algorithm safely applicable in a complete distributed fashion.     

A Multichain Backoff Mechanism for IEEE 802.11 WLANs

The distributed coordination function (DCF) of IEEE 802.11 standard adopts the binary exponential backoff (BEB) for collision avoidance. In DCF, the contention window is reset to an initial value, i.e., CWmin, after each successful transmission. Much research has shown that this dramatic change of window size may degrade the network performance. Therefore, backoff algorithms, such as gentle DCF (GDCF), multiplicative increase–linear decrease (MILD), exponential increase–exponential decrease (EIED), etc., have been proposed that try to keep the memory of congestion level by not resetting the contention window after each successful transmission. This paper proposes a multichain backoff (MCB) algorithm, which allows stations to adapt to different congestion levels by using more than one backoff chain together with collision events caused by stations themselves as well as other stations as indications for choosing the next backoff chain. The performance of MCB is analyzed and compared with those of 802.11 DCF, GDCF, MILD, and EIED backoff algorithms. Simulation results show that, with multiple backoff chains and collision events as reference for chain transition, MCB can offer a higher throughput while still maintaining fair channel access than the existing backoff algorithms.     

An effective medium contention method to improve the performance of IEEE 802.11

In this paper, we propose an effective medium access mechanism to enhance performance of the IEEE 802.11 distributed coordination function (DCF). One of the primary issues of 802.11 is a contention-based medium access control (MAC) mechanism over a limited medium, which is shared by many mobile users. In the original 802.11 DCF, the binary exponential backoff algorithm with specific contention window size is employed to coordinate the competition for shared channel. Instead of binary exponential increase, we adopt linear increase for the contention window that is determined according to the competing number of nodes. We also assume that the access point can broadcast the number of mobile nodes to each station through management frames. An analytical model is developed for the throughput performance of the wireless medium. Using simulation results from the NS2 simulator, we show that our model can accurately predict the system saturation throughput, and can obtain better performance in terms of throughput, fairness, and packet drop.     

EBA: an enhancement of the IEEE 802.11 DCF via distributed reservation

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.     

Enhancing channel utilization by improving media access coordination in wireless local area networks

Distributed coordination function (DCF) is the basis protocol for IEEE 802.11 standard wireless local area networks. It is based on carrier sense multiple access with collision avoidance (CSMA/CA) mechanism. DCF uses backoff process to avoid collisions on the wireless channel. The main drawback with this process is that packets have to spend time in the backoff process which is an additional overhead in their transmission time. The channel is rendered idle when all the stations defer their transmissions due to their backoff process. Therefore, the channel utilization and the total throughput on the channel can be improved by reducing the average time spent by the packets in the backoff process. In this paper, we propose a new media access coordination function called proposed media access protocol (PMAP) that will improve the channel utilization for successful packet transmission and therefore, the total achievable throughput. In addition, we propose an analytical model for PMAP under saturated conditions. We use this model to analyze the performance of PMAP under saturated conditions. To substantiate the effectiveness of our model, we have verified the model by simulating PMAP in NS‐2. Simulation and analytical results show that under saturated conditions, PMAP shows profound improvement in the throughput performance compared to DCF. In addition, the throughput performance of PMAP under unsaturated conditions is presented. We have also presented the delay performance of PMAP and DCF through simulation in both saturated and unsaturated conditions. Simulation results show that the average delay experienced by the packets is less in PMAP compared to DCF. Further, the variance in the packet delay is same for both PMAP and DCF protocols under unsaturated conditions. From the performance results obtained for PMAP under both saturated and unsaturated conditions, it can be concluded that PMAP is superior in performance compared to DCF. Copyright © 2006 John Wiley & Sons, Ltd.     

Robust Detection of Selfish Misbehavior in Wireless Networks

The CSMA/CA protocols are designed under the assumption that all participant nodes would abide to the protocol rules. This is of particular importance in distributed protocols such as the IEEE 802.11 distributed coordinating function (DCF), in which nodes control their own backoff parameters. In this work, we propose a method to detect selfish misbehaving terminals that may deliberately modify its backoff window to gain unfair access to the network resources. We develop nonparametric batch and sequential detectors based on the Kolmogorov-Smirnov (K-S) statistics that do not require any modification on the existing CSMA/CA protocols, and we apply it to detect misbehaviors in an IEEE 802.11 DCF network using the ns-2 simulator. We compare the performance of the proposed detectors with the optimum detectors with perfect information about the misbehavior strategy, for both the batch case (based on the Neyman-Pearson test), and the sequential case (based on Wald's sequential probability ratio test). We show that the proposed nonparametric detectors have a performance comparable to the optimum detectors for the majority of misbehaviors (the more severe) without any knowledge of the misbehavior strategies.     

Adaptive backoff scheme for ad hoc networks based on IEEE 802.11

The performance of backoff scheme plays an important role in designing efficient Medium Access Protocols for ad hoc networks. In this paper, we propose an adaptive backoff scheme and evaluate the performance of the proposed scheme for ad hoc networks. The backoff mechanism devised by us grants a node access to the channel based on its probability of collision for a transmitted frame in comparison to the nodes in the two‐hop contention area. We use both an analytical model and simulation experiments to evaluate the performance of our adaptive backoff mechanism in an ad hoc network. The results show that our protocol exhibits a significant improvement in power saving, end‐to‐end goodput, packet delivery ratio, and hop‐put, compared with the existing IEEE 802.11 DCF. Copyright © 2010 John Wiley & Sons, Ltd.     

A Simple and Comprehensive Saturation Packet Delay Model for Wireless Industrial Networks

With the emerging popularity of the wireless local area network technology, many analytical models for its main medium access control mechanism, Distributed Coordination Function (DCF), have been reported. However, most of them are based on some oversimplifying assumptions, or need very complicated mathematical manipulations. In this paper, a simple and accurate packet delay model has been proposed for the IEEE 802.11 DCF mechanism in saturated traffic and error-prone industrial applications which is based on a modified discrete-time Markov chain model of the DCF mechanism which accounts for the backoff freezing. It estimates various delay parameters including the average, jitter, Cumulative Distribution Function, and the effect of Retry Limit. The simulation results confirm the accuracy of the proposed delay model compared with other similar models in the literature.     

An energy-efficient MAC protocol based on IEEE 802.11 in wireless ad hoc networks

Energy efficiency is a measure of the performance of IEEE 802.11 wireless multihop ad hoc networks. The IEEE 802.11 standard, currently used in wireless multihop ad hoc networks, wastes bandwidth capacity and energy resources because of many collisions. Therefore, controlling the contention window size at a given node will increase not only the operating life of the battery but also the overall system capacity. It is essential to develop effective backoff schemes for saving power in IEEE 802.11 wireless multihop ad hoc networks. In this paper, we propose an energy-efficient backoff scheme and evaluate its performance in an ad hoc network. Our contention window mechanism devised by us grants a node access to a channel on the basis of the node’s percentage of residual energy. We use both an analytical model and simulation experiments to evaluate the effective performance of our scheme in an ad hoc network. Our extensive ns-2-based simulation results have shown that the proposed scheme provides excellent performance in terms of energy goodput, end-to-end goodput, and packet delivery ratio, as well as the end-to-end delay.     

A smart exponential‐threshold‐linear backoff mechanism for IEEE 802.11 WLANs

Based on the standardized IEEE 802.11 Distributed Coordination Function (DCF) protocol, this paper proposes a new backoff mechanism, called Smart Exponential‐Threshold‐Linear (SETL) Backoff Mechanism, to enhance the system performance of contention‐based wireless networks. In the IEEE 802.11 DCF scheme, the smaller contention window (CW) will increase the collision probability, but the larger CW will delay the transmission. Hence, in the proposed SETL scheme, a threshold is set to determine the behavior of CW after each transmission. When the CW is smaller than the threshold, the CW of a competing station is exponentially adjusted to lower collision probability. Conversely, if the CW is larger than the threshold, the CW size is tuned linearly to prevent large transmission delay. Through extensive simulations, the results show that the proposed SETL scheme provides a better system throughput and lower collision rate in both light and heavy network loads than the related backoff algorithm schemes, including Binary Exponential Backoff (BEB), Exponential Increase Exponential Decrease (EIED) and Linear Increase Linear Decrease (LILD). Copyright © 2011 John Wiley & Sons, Ltd.     

A backoff algorithm based on self-adaptive contention window update factor for IEEE 802.11 DCF

The binary exponential backoff (BEB) mechanism is applied to the packet retransmission in lots of wireless network protocols including IEEE 802.11 and 802.15.4. In distributed dynamic network environments, the fixed contention window (CW) updating factor of BEB mechanism can’t adapt to the variety of network size properly, resulting in serious collisions. To solve this problem, this paper proposes a backoff algorithm based on self-adaptive contention window update factor for IEEE 802.11 DCF. In WLANs, this proposed backoff algorithm can greatly enhance the throughput by setting the optimal CW updating factor according to the theoretical analysis. When the number of active nodes varies, an intelligent scheme can adaptively adjust the CW updating factor to achieve the maximal throughput during run time. As a result, it effectively reduces the number of collisions, improves the channel utilization and retains the advantages of the binary exponential back-off algorithm, such as simplicity and zero cost. In IEEE 802.11 distributed coordination function (DCF) protocol, the numerical analysis of physical layer parameters show that the new backoff algorithm performance is much better than BEB, MIMD and MMS algorithm.     

Saturation throughput analysis of multi‐rate IEEE 802.11 wireless networks

IEEE 802.11 protocol supports adaptive rate mechanism, which selects the transmission rate according to the condition of the wireless channel, to enhance the system performance. Thus, research of multi‐rate IEEE 802.11 medium access control (MAC) performance has become one of the hot research topics. In this paper, we study the performance of multi‐rate IEEE 802.11 MAC over a Gaussian channel. An accurate analytical model is presented to compute the system saturation throughput. We validate our model in both single‐rate and multi‐rate networks through various simulations. The results show that our model is accurate and channel error has a significant impact on system performance. In addition, our numerical results show that the performance of single‐rate IEEE 802.11 DCF with basic access method is better than that with RTS/CTS mechanism in a high‐rate and high‐load network and vice versa. In a multi‐rate network, the performance of IEEE 802.11 DCF with RTS/CTS mechanism is better than that with basic access method in a congested and error‐prone wireless environment. Copyright © 2008 John Wiley & Sons, Ltd.     

IEEE 802．11网络分析模型

IEEE 802.11在MAC层采用DCF作为主要的信道接入方式。本文分析了现有的几种802.11网络分析模型,其中B ianch i模型很好的描述了饱和状态下802.11 DCF的性能;X iao模型针对802.11e进行了多优先级的扩展,实现了EDCF的性能分析。最后介绍了一种新的分析模型,新模型同时考虑了业务优先级和内部调度算法,够较准确地描述网络性能。     

Quality-of-service provisioning system for multimedia transmission in IEEE 802.11 wireless LANs

IEEE 802.11, the standard of wireless local area networks (WLANs), allows the coexistence of asynchronous and time-bounded traffic using the distributed coordination function (DCF) and point coordination function (PCF) modes of operations, respectively. In spite of its increasing popularity in real-world applications, the protocol suffers from the lack of any priority and access control policy to cope with various types of multimedia traffic, as well as user mobility. To expand support for applications with quality-of-service (QoS) requirements, the 802.11E task group was formed to enhance the original IEEE 802.11 medium access control (MAC) protocol. However, the problem of choosing the right set of MAC parameters and QoS mechanism to provide predictable QoS in IEEE 802.11 networks remains unsolved. In this paper, we propose a polling with nonpreemptive priority-based access control scheme for the IEEE 802.11 protocol. Under such a scheme, modifying the DCF access method in the contention period supports multiple levels of priorities such that user handoff calls can be supported in wireless LANs. The proposed transmit-permission policy and adaptive bandwidth allocation scheme derive sufficient conditions such that all the time-bounded traffic sources satisfy their time constraints to provide various QoS guarantees in the contention free period, while maintaining efficient bandwidth utilization at the same time. In addition, our proposed scheme is provably optimal for voice traffic in that it gives minimum average waiting time for voice packets. In addition to theoretical analysis, simulations are conducted to evaluate the performance of the proposed scheme. As it turns out, our design indeed provides a good performance in the IEEE 802.11 WLAN's environment, and can be easily incorporated into the hybrid coordination function (HCF) access scheme in the IEEE 802.11e standard.