Binary Slotted Exponential Backoff Research Articles

The Relation between the Probability of Collision-Free Broadcast Transmission in a Wireless Network and the Stirling Number of the Second Kind

The broadcast performance of the 802.11 wireless protocol depends on several factors. One of the important factor is the number of nodes simultaneously contending for the shared channel. The Medium Access Control (MAC) technique of 802.11 is called the Distributed Coordination Function (DCF). DCF is a Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) scheme with binary slotted exponential backoff. A collision is the result of two or more stations transmitting simultaneously. Given the simplicity of the DCF scheme, it was adapted for Dedicated Short Range Communication (DSRC) based vehicular communication. A broadcast mechanism is used to disseminate emergency and safety related messages in a vehicular network. Emergency and safety related messages have a strict end-to-end latency of 100 ms and a Packet Delivery Ratio (PDR) of 90% and above. The PDR can be evaluated through the packet loss probability. The packet loss probability PL is given by, PL = 1 − (1−Pe)(1−PC), where Pe is the probability of channel error and PC is the probability of collision. Pe depends on several environmental and operating factors and thus cannot be improved. The only way to reduce PL is by reducing PC. Currently, expensive radio hardware are used to measure PL. Several adaptive algorithms are available to reduce PC. In this paper, we establish a closed relation between PC and the Stirling number of the second kind. Simulation results are presented and compared with the analytical model for accuracy. Our simulation results show an accuracy of 99.9% compared with the analytical model. Even on a smaller sample size, our simulation results show an accuracy of 95% and above. Based on our analytical model, vehicles can precisely estimate these real-time requirements with the least expensive hardware available. Also, once the distribution of PC and PL are known, one can precisely determine the distribution of Pe.

Performance evaluation of collision avoidance schemes in ad hoc networks

AbstractIEEE 802.11 distributed coordination function (DCF) is a popular protocol used for the physical and medium access control layers in most ad hoc networks. DCF employs carrier sense multiple access with collision avoidance and a binary slotted exponential back off. It has been observed that the hidden and exposed terminal problems among stations degrade DCF's performance in terms of throughput and fairness. Hence, the effectiveness of the IEEE 802.11 DCF mechanism in ad hoc networks has attracted many research studies. Many collision avoidance schemes were proposed to address the IEEE 802.11 DCF weaknesses as the performance of the medium access control layer directly impacts the performance of higher‐layer protocols and hence the entire network. An evaluation of representative schemes under the same conditions will be helpful in understanding the limitations and strengths of these schemes. This paper surveys various collision avoidance schemes, classify them on the basis of their mechanism, and then provide a comparative study of representative schemes based on their performance. They are evaluated on a chain topology, a pair topology, and a random topology with static environment to measure their throughput, fairness, collision probabilities, and delay. On the basis of the evaluation, we conclude that gentle DCF is the best scheme that has lesser collisions with improved throughput and fairness. A comparison with the legacy carrier sense multiple access with collision avoidance suggests that these proposed schemes do tend to be promising and would inspire future researchers who are interested to find solutions to the age‐old collision and fairness issues in ad hoc networks. Copyright © 2014 John Wiley & Sons, Ltd.

A Markov Model for the IEEE 802.11 DCF under Limit Load

Wireless Local Area Networks (WLANs) have been attracted significant research during the last few years. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slotted exponential backoff. This paper proposes a new Markov model to analyze the CSMA/CA protocol and average packet delay. This model covers the finite load condition and saturation condition. The close agreement between the theoretical results and simulation results using NS-2 under reaffirms the accuracy of the analytical model.

Improving Throughput in Wireless Local Area Networks

The medium access control (MAC) technique of standard WLANs, called the distributed coordination function (DCF), is carrier sense multiple access based on collision avoidance (CSMA/CA) scheme with binary slotted exponential backoff. It has a two way handshaking technique for packet transmission and also defines an additional four way handshaking technique called RTS/CTS mechanism, which is used to reduce the hidden terminal problem. The RTS/CTS frames carry the information of the packet length to be transmitted which can be read by any listening stations, to update a network allocation vector (NAV) about the information of the period of time in which the channel is busy. In this paper a method is proposed called the table driven technique (which has two parts called table driven DCF and table driven RTS/CTS) which is similar to the standard DCF (IEEE802.11) and RTS/CTS (IEEE802.11) system without having the exponential backoff. In this technique users use the optimum transmission probability by estimating the number of stations from the traffic conditions in a sliding window fashion one period at a time, thereby increasing the throughput compared to the standard DCF (IEEE802.11) and RTS/CTS (IEEE802.11) mechanism while maintaining the same fairness and the delay performance.

Performance Analysis of IEEE 802.11 DCF under Nonsaturation Condition

Carrier sense multiple access with collision avoidance (CSMA/CA) methods are considered to be attractive MAC protocols for wireless LANs. IEEE 802.11 distributed coordination function (DCF) is a random channel access scheme based on CSMA/CA method and the binary slotted exponential backoff procedure to reduce the packet collision. In this paper, we propose a new analytical model for a nonsaturated IEEE 802.11 DCF network and evaluate its performance. We verify our model using simulations and show that our results agree with the simulations.

Performance Improvement for IEEE 802.11 Distributed Coordination Function (DCF)

The medium access control (MAC) protocol is the main determiner of the system throughput in Wireless Local Area Networks (WLANs). The MAC technique of the IEEE 802.11 protocol is called Distributed Coordination Function (DCF). DCF is based on a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slotted exponential backoff. Each station generates a random backoff interval before transmitting a packet to minimize the probability of collision with packets being transmitted by other stations. However, when the number of stations increases, the system throughput decreases. This paper proposes a new backoff algorithm that uses finish tags. The proposed algorithm uses the finish tag of each station to control the backoff intervals so as to improve system throughput. The finish tag is updated when a packet reaches the front of its flow, and it is attached to the packet just prior to transmission. When a station receives packets with older finish tags, its backoff time interval is increased. For this reason, the more the stations there are, the larger the backoff time becomes. Simulations confirm that the proposal improves system throughput of a IEEE 802.11 network under saturation conditions.

IEEE 802.11 Distributed Coordination Function: Enhancement and analysis

IEEE 802.11 Medium Access Control (MAC) is proposed to support asynchronous and time bounded delivery of radio packets. Distributed Coordination Function (DCF), which uses Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) and binary slotted exponential backoff, is the basis of the 802.11 MAC. This paper proposes a throughput enhancement for DCF by adjusting the Contention Window (CW) setting scheme. Moreover, an analytical model based on Markov chain is introduced to compute the enhanced throughput. The accuracy of the model and the enhancement of the proposed scheme are verified by elaborate simulations.

The IEEE 802.11 Distributed Coordination Function in Small-Scale Ad-Hoc Wireless LANs

The IEEE 802.11 standards for wireless local area networks define how the stations of an ad-hoc wireless network coordinate in order to share the medium efficiently. This work investigates the performance of such a network by considering the two different access mechanisms proposed in these standards. The IEEE 802.11 access mechanisms are based on the carrier sense multiple access with collision avoidance (CSMA/CA) protocol using a binary slotted exponential backoff mechanism. The basic CSMA/CA mechanism uses an acknowledgment message at the end of each transmitted packet, whereas the request to send/clear to send (RTS/CTS) CSMA/CA mechanism also uses a RTS/CTS message exchange before transmitting a packet. In this work, we analyze these two access mechanisms in terms of throughput and delay. Extensive numerical results are presented to highlight the characteristics of each access mechanism and to define the dependence of each mechanism on the backoff procedure parameters.

Performance analysis of the IEEE 802.11 distributed coordination function

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.