Performance Analysis of a Non-Overlapping Binary Exponential Backoff Algorithm over IEEE 802.15.4

Lee, Seung Youn; Shin, Youn-Soon; Ahn, Jong-Suk; Lee, Kang-Woo

doi:10.1109/icut.2009.5405718

Cited by 12 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Basically, NO-BEB proposes two modifications to the original BEB, 1) Reduce the level of contention by choosing CW from the interval [CW i-1 , CW i ] rather than [0, CW i ] (CW i is "the contention window of the ith backoff stage" [3]), and 2) Decrement the backoff counter by one instead of resetting CW to its minimum. The first modification guarantees that nodes with different number of failures to access the medium are more likely to be allocated to the non-overlapping regions [4]. This can effectively reduce the possibility of collisions.…”

Section: Related Workmentioning

confidence: 99%

“…The second modification guarantees that the node remains at the backoff stage which is optimal for the traffic of that period of time. In [4], the authors provide a Markov-based model for NO-BEB and study its performance in terms of throughput, probability of collision and average access delay. The provided data show that NO-BEB outperforms BEB in terms of these parameters.…”

Section: Related Workmentioning

confidence: 99%

“…In [3], the Non-Overlapping BEB (NO-BEB) algorithm is introduced for 802.11 networks, and in [4] its performance is evaluated over 802.15.4 networks. Basically, NO-BEB proposes two modifications to the original BEB, 1) Reduce the level of contention by choosing CW from the interval [CW i-1 , CW i ] rather than [0, CW i ] (CW i is "the contention window of the ith backoff stage" [3]), and 2) Decrement the backoff counter by one instead of resetting CW to its minimum.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

An Efficient Adaptive Backoff Algorithm for Wireless Sensor Networks

Khanafer

Guennoun

Mouftah

2011

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

View full text Add to dashboard Cite

The IEEE 802.15.4 standard utilizes the Binary Exponential Backoff (BEB) algorithm to control nodes' access to the shared wireless medium. The main drawback of BEB is that it updates the size of the contention window (CW) without taking into consideration the number of competing nodes and the conditions in the communications medium. Therefore, BEB has been shown to be inefficient in terms of channel utilization and fairness among the contending nodes. In this paper, we propose Adaptive Backoff Algorithm (ABA), a new backoff algorithm that adaptively determines the appropriate size of CW based on the collisions experienced by the nodes. That is, while BEB updates CW in a deterministic fashion, we introduce a probabilistic methodology to achieve that update. Our simulations compare the performance of ABA with that of BEB as well as three other algorithms proposed in the literature, namely, NO-BEB, KEB, and IBEB. The performance is studied in terms of power consumption, reliability, and channel utilization. Our results show that ABA outperforms the aforementioned algorithms while granting each node a fair access to the wireless medium.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient Adaptive Backoff Algorithm for Wireless Sensor Networks

Khanafer

Guennoun

Mouftah

2011

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

View full text Add to dashboard Cite

show abstract

“…Simulation results revealed that IBEB outperforms the BEB scheme when tested on different network load and scale. [7], proposed a backoff technique named Non-Overlapping Binary Exponential Backoff (NO-BEB) that aimed at decreasing collision level in large scale PANs. NO-BEB calculates data delivery failure in order to distinguish the range of the current backoff periods from passed ones and uses this information to fairly distribute the random backoff delay and hence, decreasing the possibility of nodes choosing the same backoff periods according to failure counts.…”

Section: Related Workmentioning

confidence: 99%

Fibonacci Backoff Algorithm for IEEE 802.15.4/ZigBee

Yassien¹,

Salayma²,

Mardini³

et al. 2012

NPA

View full text Add to dashboard Cite

The IEEE 802.15.4 is a standard for Wireless Personal Area Network (PAN) that supports low data rate, low cost, low complexity and low power consumption applications. The CSMA/CA algorithm of the IEEE 802.15.4 MAC layer employs the Binary Exponential Backoff (BEB) function to compute the backoff delay for each node. Using BEB function, it is possible that two or more nodes may collide if they choose the same backoff exponent value. Consequently this will increase collision and network contention level which will degrade the network overall performance. To overcome this problem, this paper proposes a Fibonacci Backoff (FIB) function to compute the backoff interval. In FIB, each node shall wait for an incremental backoff periods as they need to access the channel. The performance of FIB algorithm is compared against the BEB function.

show abstract

“…Hidden node resolution-based solutions consider the existence of hidden nodes and aim to reduce the number of collisions caused by hidden nodes [ 10 , 11 ]. IEEE 802.11-based approaches try to migrate some solutions that have proven efficient in IEEE 802.11 to 802.15.4 WSNs [ 12 ]. However, a lack of considering energy efficiency makes them not suitable for most of WSNs.…”

Section: Introductionmentioning

confidence: 99%

A Network Equivalent-Based Algorithm for Adaptive Parameter Tuning in 802.15.4 WSNs

Wang

Yang

Han

et al. 2018

Sensors

View full text Add to dashboard Cite

Previous studies have shown that in many wireless sensor network applications the IEEE 802.15.4 carrier sense multiple access with collision avoidance (CSMA/CA) mechanism with default parameters cannot guarantee the constraints of reliability, time efficiency, or energy efficiency. Although many adaptive parameter tuning algorithms have been proposed, many of them cannot correctly identify the changes of the network condition and are unable to effectively perform the parameter tuning operation. Considering the randomness that CSMA/CA brings about, for most of the proposed algorithms, it is a challenge to distinguish significant violations that were caused by actual changes of the network from the general fluctuations that were due to CSMA/CA. In this paper, we propose a lightweight algorithm called the network equivalent adaptive parameter tuning (NEAPT) algorithm. It is fully distributed and can work without any predefined information or acknowledgement. NEAPT not only takes reliability as an evaluation of a network condition, but it proposes a synthetic value, called the equivalent node number, and takes it as another reference for a network condition. Simulation results show that by taking both reliability and the equivalent node number into consideration, NEAPT can effectively identify the network changes and provide adequate and steady performances for wireless sensor networks (WSNs) in both stationary and dynamic conditions.

show abstract

Performance Analysis of a Non-Overlapping Binary Exponential Backoff Algorithm over IEEE 802.15.4

Cited by 12 publications

References 6 publications

An Efficient Adaptive Backoff Algorithm for Wireless Sensor Networks

An Efficient Adaptive Backoff Algorithm for Wireless Sensor Networks

Fibonacci Backoff Algorithm for IEEE 802.15.4/ZigBee

A Network Equivalent-Based Algorithm for Adaptive Parameter Tuning in 802.15.4 WSNs

Contact Info

Product

Resources

About