Binary Exponential Backoff Algorithm Research Articles

Effective Backoff Scheme to ease the Network Congestion on IEEE 802.11 DCF

Since all transmitting stations in the range share the wireless channel, the IEEE 802.11 MAC uses the Binary Exponential Backoff (BEB) algorithm to minimize collision. The BEB technique resets the Contention Window values after each successful frame transmission regardless of the network state, and a sudden CW decrease incurs performance degradation as the number of competing stations increases. To resolve this problem, we propose a new algorithm that adjusts CW values using (m,k)-firm scheduling technique. The proposed algorithm changes CW using the violating distance instead of resetting the CW to minimum value after every successful transmission. The performance results are shown to identify the improvement of our scheme in terms of waiting time comparing to the BEB.

The Application of Binary Exponential Backoff Algorithm for WIA Wireless Network

The WIA industrial wireless network which based on IEEE802.15.4 standard. The network will produce some network conflicts and data loss phenomenon with the expansion of network scope and the increasing of amount of data in the network. In view of this kind of phenomenon. This paper introduces a abinary exponential backoff algorithm. We establish experimental model to simulation analysis. We obtained simulation model under the condition of stable network. It can reduce the probability of collision between nodes when the node sends data packets to the other node.

E-BEB: Enhanced Binary Exponential Backoff Algorithm for Multi-hop Wireless Ad-hoc Networks

Binary exponential backoff algorithm is the de-facto medium access control protocol for wireless local area networks, and it has been employed as the standard contention resolution algorithm in multi-hop wireless ad-hoc networks. However, this algorithm does not function well in multi-hop wireless environments due to its several performance issues and technical limitations. In this paper, we propose a simple, efficient, priority provision, and well performed contention resolution algorithm called enhanced binary exponential backoff (E-BEB) algorithm for impartial channel access in multi-hop wireless ad-hoc networks. We also provide a simple and accurate analytical model to study the system saturation throughput of the proposed scheme. Simulations are conducted to evaluate the performance of E-BEB algorithm. The results show that the E-BEB algorithm can alleviate the fairness problem and support multimedia transmission in multi-hop wireless environments.

Modified Binary Exponential Backoff Algorithm to Minimize Mobiles Communication Time

the field of Wireless Local Area Networks (LANs) is expanding rapidly as a result of advances in digital communications, portable computers, and semiconductor technology. The early adopters of this technology have primarily been vertical application that places a premium on the mobility offered by such systems. Binary Exponential Backoff (BEB) refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is used in Ethernet (IEEE 802.3) wired LANs. In Ethernet networks, this algorithm is commonly used to schedule retransmissions after collisions. The paper's goal is to minimize the time transmission cycle of the information between mobiles moving in a Wi-Fi by changing the BEB algorithm. The Protocol CSMA / CA manage access to the radio channel by performing an arbitration based on time. This causes many problems in relation to time transmission between mobiles moving in a cell 802.11. what we have done show that the protocol using CSMA / CA access time believed rapidly when the number of stations and / or the network load increases or other circumstances affects the network.

A Dynamic Back-Off Algorithm in Ad Hoc Networks

Much work has been done to solve the unfairness problems caused by hidden terminals and exposed terminals in Ad Hoc networks. The back-off mechanism is one of the widely used methods to ensure the fair allocation of channel resources associated with other mechanisms. In this paper, a modified back-off algorithm DEIED (Dynamic Exponential Increase and Exponential Decrease) is proposed based on the previous back-off scheme EIED (Exponential Increase and Exponential Decrease), and a comparison of BEB (Binary Exponential Back-off), EIED, DEIED, is presented. Both qualitative analysis and simulation results show that the proposed back-off algorithm scheme outperforms EIED and BEB algorithms in term of the opportunities given to each node to transmit.

Research on Stability Control Algorithm of Slotted ALOHA

Because of its simplification, slotted ALOHA is comprehensive used in the satellite and wireless communication. While slotted ALOHA is essentially unstable. Therefore various kinds of control algorithms are applied in order to keep stable throughput of the communication system. In this paper, p- Persistent Control Algorithm (pPCA) of slotted ALOHA is analyzed using binomial distribution model, design of algorithm is finished and throughput is simulated. Markov Model of Binary Exponential Backoff (BEB) Algorithm is established on the basis of which Binary Exponential Backoff Algorithm is designed whose performance is tested through numerical analysis and simulation. Finally, Operating principle of Pseudo- Bayesian Control Algorithm (PBCA) is analyzed utilizing Poisson distribution model of input stream, corresponding algorithm is designed and throughput is done simulation test. Then comparisons are done on the properties of throughput, adjustment process and complexity of computation among Binary Exponential Backoff Algorithm, Pseudo-Bayesian Control Algorithm and p-Persistent Control Algorithm whose results show that overall performance of Pseudo-Bayesian Control Algorithm is better than that of the other two. Index Terms—Slotted ALOHA; throughput; stability; complexity of computation; Markov Model; adjustment process

Modeling IEEE 802.11 DCF with Finite Retry Limits

The IEEE 802.11 is the dominating standard for wireless local area networks (WLANs). IEEE 802.11 uses Distributed Coordination Function (DCF) protocol with Binary exponential backoff (BEB) algorithm for packet transmission. In WLANs, the performance metrics such as throughput and end-to-end delay greatly depend on packet transmission procedure. The packet transmission procedure can be represented with a Markov chain model. Till now, several Markov chain models have been developed for evaluating the performance of IEEE 802.11 wireless networks. Yet, these models cannot truthfully calculate the performance of the network. Moreover, the existing models suffer with high packet collisions resulting in degradation of throughput particularly under congested environments. In order to overcome this, a new packet transmission procedure for DCF protocol is introduced in this paper considering both packet retry limits and transmission errors. A mathematical analysis is carried out for transmission probability and the throughput of the network is analyzed. Simulation results show significant improvement in throughput of DCF protocol under basic access and request-to-send/clear-to-send (RTS/CTS) access mechanisms using the proposed model when compared with the existing models Keywords: DCF, IEEE 802.11, Markov chain model, Throughput. .

Minimizing Mobiles Communication Time Using Modified Binary Exponential Backoff Algorithm

The domain of wireless Local Area Networks (WLANs) is growing speedily as a consequence of developments in digital communications technology. The early adopters of this technology have mainly been vertical application that places a premium on the mobility offered by such systems. Examples of these types of applications consist of stocking control in depot environments, point of sale terminals, and rental car check-in. Furthermore to the mobility that becomes possible with wireless LANs; these systems have also been used in environments where cable installation is expensive or impractical. Such environments include manufacturing floors, trading floors on stock exchanges, conventions and trade shows, and historic buildings. With the increasing propagation of wireless LANs comes the need for standardization so as to allow interoperability for an increasingly mobile workforce. Despite all the advantages and facilities that Wi-FI offers, there is still the delay problem that is due to many reasons that are introduced in details in our case study which also presents the solutions and simulation that can reduce this delay for better performance of the wireless networks. Binary Exponential Backoff (BEB) refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is used in Ethernet (IEEE 802.3) wired LANs. In Ethernet networks, this algorithm is commonly used to schedule retransmissions after collisions. The paper’s goal is to minimize the time transmission cycle of the information between mobiles moving in a Wi-Fi by changing the BEB algorithm. The Protocol CSMA / CA manage access to the radio channel by performing an arbitration based on time. This causes many problems in relation to time transmission between mobiles moving in a cell 802.11. what we have done show that the protocol using CSMA / CA access time believed rapidly when the number of stations and / or the network load increases or other circumstances affects the network.

Binary exponential backoff algorithm for slotted ALOHA

Slot-ALOHA is widely used in wireless communications due to its simplicity.However,because slot-ALOHA is not stable in essence,many algorithms have been used to provide steady throughput.After founding the Markov model for Binary Exponent Backoff(BEB) algorithm,this paper analyzed the adjusting progress.The numerical computation and simulation results demonstrate that BEB algorithm can guarantee the system steady and the theoretic throughput can be derived when the number of modes is within certain range.By comparing throughput of BEB to that of Pseudo-Bayesian Control Algorithm(PBCA),it can derive that the throughput of BEB is less than PBCA when the number of users is either too big or small because of being influenced by the backoff window size.

A Beacon-Based Collision-Free Channel Access Scheme for IEEE 802.11 WLANs

In IEEE 802.11 based WLAN standard, distributed coordination function is the fundamental medium access control (MAC) technique. It employs a CSMA/CA with random binary exponential backoff algorithm and provides contention-based distributed channel access for stations to share the wireless medium. However, performance of this mechanism drops dramatically due to random structure of the backoff process, high collision probability and frame errors. That is why development of an efficient MAC protocol, providing both high throughput for data traffic and quality of service (QoS) support for real-time applications, has become a major focus in WLAN research. In this paper, we propose an adaptive beacon-based collision-free MAC adaptation. The proposed scheme makes use of beacon frames sent periodically by access point, lets stations enter the collision-free state and reduces the number of idle slots regardless of the number of stations and their traffic load (saturated or unsaturated) on the medium. Simulation results indicate that the proposed scheme dramatically enhances the overall throughput and supports QoS by reducing the delay, delay variation and dropping probability of frames.

Performance analysis of Extended Non-Overlapping Binary Exponential Backoff algorithm over IEEE 802.15.4

This paper evaluates the effects of the Extended Non-Overlapping Binary Exponential Backoff (ENO-BEB) algorithm over IEEE 802.15.4 by building its performance models based on a 2-dimensional Markov chain. This algorithm differs from the previously proposed Non-Overlapping Binary Exponential Backoff (NO-BEB) algorithm for IEEE 802.11, where the next backoff range is fixed as the second half of the conventional exponentially enlarged range. The ENO-BEB algorithm maps the next backoff range to the last 1/2 j -th subrange of the conventional range where j is an integer standing for the number of consecutive channel capture failures. To measure its impacts of the degree of separation between two backoff ranges at two adjacent backoff stages, we generalize the conventional IEEE 802.15.4 Markov chain model by including the behavior of the ENO-BEB algorithm. The analytical performance model predicts that the ENO-BEB technique achieves better throughput for larger j, for example, up to 113 % and 21 % than the conventional BEB and NO-BEB algorithm, respectively when j and the total number of nodes are 3 and 60. Simulations confirm these numerical results with a 7 % difference.

Enhanced binary exponential backoff algorithm for fair channel access in the ieee 802.11 medium access control protocol

SUMMARYThe medium access control protocol determines system throughput in wireless mobile ad hoc networks following the ieee 802.11 standard. Under this standard, asynchronous data transmissions have a defined distributed coordination function that allows stations to contend for channel usage in a distributed manner via the carrier sensing multiple access with collision avoidance protocol. In distributed coordination function, a slotted binary exponential backoff (BEB) algorithm resolves collisions of packets transmitted simultaneously by different stations. The BEB algorithm prevents packet collisions during simultaneous access by randomizing moments at stations attempting to access the wireless channels. However, this randomization does not eliminate packet collisions entirely, leading to reduced system throughput and increased packet delay and drop. In addition, the BEB algorithm results in unfair channel access among stations. In this paper, we propose an enhanced binary exponential backoff algorithm to improve channel access fairness by adjusting the manner of increasing or decreasing the contention window based on the number of the successfully sent frames. We propose several configurations and use the NS2 simulator to analyze network performance. The enhanced binary exponential backoff algorithm improves channel access fairness, significantly increases network throughput capacity, and reduces packet delay and drop. Copyright © 2013 John Wiley & Sons, Ltd.

Throughput Upper-Bound of Slotted CSMA Systems with Unsaturated Finite Population

In this paper we propose a new Markovian model for p-persistent carrier sense multiple access (CSMA) systems with a finite population of unsaturated single-buffered terminals. Focused on the distribution of the number of backlogged terminals in the steady state, our model allows the optimal persistent probability p from the number of backlogged terminals, which enables us to determine the throughput upper-bound (or mean access delay lower-bound) of slotted CSMA systems. We compare the performance of slotted CSMA systems with binary exponential backoff (BEB) algorithm and with p-persistent protocol against the throughput upper-bound and examine the stability of these systems. We show how closely slotted CSMA systems with BEB algorithm or p-persistent protocol approaches the throughput upper-bound in accordance with the minimum contention window size or the persistent probability p. Further, we propose a generalized Bertsekas' (backoff) algorithm (GBA) based on backlog size estimation, which is a generalization of the existing algorithm proposed by Bertsekas, in order to achieve the throughout upper-bound. Our study shows that in slotted CSMA systems, the access fairness of BEB algorithm is worse than those of p-persistent protocol and GBA algorithm, while the BEB and GBA algorithms show throughput performance close to optimality.

Performance enhancement of IEEE 802.11 DCF using novel backoff algorithm

Abstract In the IEEE 802.11 distributed coordination function (DCF), the binary exponential backoff algorithm selects a random backoff number from a uniform probability distribution to avoid the problem of packet collision. In this article, we present a novel backoff algorithm that uses a binominal distribution rather than a uniform distribution to determine the backoff value. Simulation results show that the proposed algorithm outperforms the original IEEE 802.11 DCF algorithm.

A Comparative Study of the Traditional Model of IEEE 802.15.4 and Non-Overlapping Binary Exponential Backoff IEEE 802.15.4

This paper introduces a performance model of a recently proposed backoff technique named Nonoverlapping binary exponential backoff algorithm over IEEE 802.15.4, which is designed for LRWPAN. To reduce the collision rate in highly populated wireless networks, non-overlapping binary exponential backoff tries to evenly distribute the random backoff delay by distinguishing the new range of backoff delays. For the performance measurement of non-overlapping binary exponential backoff algorithm, obtained results are compared with the traditional model of IEEE 802.15.4 . Our numerical analyses show that non-overlapping binary exponential backoff improves the throughput and transmission delay comparing to the traditional BEB.

Change in Non-Overlapping Binary Exponential Backoff calculations

This paper introduces the changes of performance on wired technique to the wireless technique via nonoverlapping binary exponential backoff (NO-BEB) algorithm over IEEE 802.15.4. Everyone needs change because it is essential part of the development. The changes depend on the situation. In this manuscript it is explained in context to NO-BEB. It has been obtained that the probability throughput increases with the increase in window size while it decreases with the increase in number of nodes.

An Effective Wireless MAC Protocol Based on Improved Binary Exponential Backoff Algorithm

An Effective Wireless MAC Protocol Based on Improved Binary Exponential Backoff Algorithm

Intelligent Paging Backoff Algorithm for IEEE 802.11 MAC Protocol

Backoff algorithms have been introduced to improve network performance by reducing collisions over networks, especially in large ones. The Binary Exponential Backoff used in the standard IEEE 802.11 Medium Access Control makes exponential increments to contention window sizes. The large contention window gaps produced can significantly reduce the network performance. Therefore, a new increment behavior is introduced in this paper in order to avoid failure transmissions. The Results show that shifting the contention window to the right place based on previous transmissions outperforms each of the Binary Exponential Backoff Algorithm, the Smart Adaptive Backoff Algorithm and Pessimistic Linear Exponential Backoff Algorithm, up to 7.1%, 16.5% and 19% respectively in term of data delivery ratio.

A Stochastic Game Analysis of the Binary Exponential Backoff Algorithm with Multi-Power Diversity and Transmission Cost

In this paper, we present a game analysis of the Binary Exponential Backoff (BEB), a popular bandwidth allocation mechanism used by a large number of distributed wireless technologies. A Markov chain analysis is used to obtain equilibrium retransmission probabilities and throughput. Numerical results show that when the arrival probability increases, the behavior of mobile stations MSs become more and more aggressive resulting in a global deterioration of the system throughput. We then consider a non-cooperative game framework to study the operation and evaluate the performance of the BEB algorithm when a group of MSs competing with each other to gain access to the wireless channel. We focus our attention to the case when an MS acts selfishly by attempting to gain access to the channel using a higher retransmission probability as a means to increase its own throughput. As a means to improve the system performance, we further explore the use of two transmission mechanisms and policies. First, we introduce the use of multiple power levels (MPLs) for the data transmission. The use of multiple power levels results on a capture effect allowing the receiver to properly decode the message even in the presence of a collision. Under the proposed scheme, named MPL-BEB, the effect of the aggressive behavior, higher transmission probabilities, is diminished since the power level is chosen randomly and independently by each and every station. Second, we introduce a disutility policy for power consumption. The resulting mechanism, named MPL-BEB with costs, is of prime interest in wireless networks composed of battery-powered nodes. Under this scheme aggressive behavior is discouraged since each retransmission translates into the depletion of the energy stored in the battery. Via price of anarchy, our results identify a behavior similar to the well-know prisoner’s dilemma. A non-efficiency of Nash equilibrium is observed for all schemes (BEB, MPL-BEB, MPL-BEB with costs) under heavy traffic with a notable outperformance of MPL-BEB with costs over both MPL-BEB and BEB.

Adaptive Backoff Algorithm for Wireless Internet

The standard IEEE 802.11 MAC protocol uses the Binary Exponential Backoff algorithm. The Binary Exponential Backoff makes exponential increments to contention window sizes. This work has studied the effect of choosing a combination between linear, exponential and logarithmic increments to contention windows. Results have shown that choosing the right increment based on network status enhances the data delivery ratio up to 37% compared to the Binary Exponential Backoff, and up to 39 % compared to the Pessimistic Linear Exponential Backoff algorithms for wireless Internet.