• Title/Summary/Keyword: Binary exponential backoff algorithm

Search Result 28, Processing Time 0.023 seconds

Binary Negative-Exponential Backoff Algorithm to Enhance The Performance of IEEE 802.11 WLAN (IEEE 802.11 무선랜의 성능 향상을 위한 Binary Negative-Exponential Backoff 알고리즘)

  • Ki, Hyung-Joo;Choi, Seung-Hyuk;Chung, Min-Young;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12A
    • /
    • pp.1229-1237
    • /
    • 2006
  • IEEE 802.11 has employed distributed coordination function (DCF) adopting carrier sense multiple access with collision avoidance (CSMA/CA). To effectively resolve collisions, DCF uses binary exponential backoff (BEB) algorithm with three parameters, i.e., backoff stage, backoff counter and contention window. If a collision occurs, stations involving in the collision increase their backoff stages by one and double their contention window sizes. However, DCF with BEB wastes wireless resource when there are many contending stations. Therefore, in this paper, to enhance the performance of wireless LAN, we propose binary negative-exponential backoff (BNEB) algorithm which maintains a maximum contention window size during collisions and reduces a contention window size to half after successful transmission of a frame without retransmissions. For IEEE 802.11, 802.11a and 802.11b standards, we also compare the performance of DCF with BEB to that with BNEB.

Adaptive Binary Negative-Exponential Backoff Algorithm Based on Contention Window Optimization in IEEE 802.11 WLAN

  • Choi, Bum-Gon;Lee, Ju-Yong;Chung, Min-Young
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.896-909
    • /
    • 2010
  • IEEE 802.11 medium access control (MAC) employs the distributed coordination function (DCF) as the fundamental medium access function. DCF operates with binary exponential backoff (BEB) in order to avoid frame collisions. However it may waste wireless resources because collisions occur when multiple stations are contending for frame transmissions. In order to solve this problem, a binary negative-exponential backoff (BNEB) algorithm has been proposed that uses the maximum contention window size whenever a collision occurs. However, when the number of contending stations is small, the performance of BNEB is degraded due to the unnecessarily long backoff time. In this paper, we propose the adaptive BNEB (A-BNEB) algorithm to maximize the throughput regardless of the number of contending stations. A-BNEB estimates the number of contending stations and uses this value to adjust the maximum contention window size. Simulation results show that A-BNEB significantly improves the performance of IEEE 802.11 DCF and can maintain a high throughput irrespective of the number of contending stations.

Variable Backoff Stage(VBS) Algorithm to Reduce Collisions in IEEE 802.11 DCF (IEEE 802.11 DCF 에서의 충돌 감소를 위한 가변 백오프 스테이지(VBS) 알고리즘)

  • Kang, Seongho;Choo, Young-yeol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.6
    • /
    • pp.1333-1340
    • /
    • 2015
  • IEEE 802.11 MAC(Media Access Control) defines DCF(Distributed Coordination Function) for data transmission control. BEB(Binary Exponential Backoff) algorithm of DCF has a problem that if the number of stations connected are over a certain threshold, it degrades network performance because of packet collisions caused from the minimum contention window size. To cope with this problem, we proposed a novel algorithm, named as VBS(Variable Backoff Stage) algorithm, which adjusts the rate of backoff stage increment depending on the number of stations associated with an AP(Access Point). Analytic model of proposed algorithm was derived and simulations on the BEB and the VBS algorithms have been conducted on the OFDM (Orthogonal Frequency Division Multiplexing) method. Simulation results showed that when the rate of backoff state increment was 5 and 10, the number of retransmission were reduced to 1/5 and 1/10 comparing to that of BEB, respectively. Our algorithm showed improvement of 19% and 18% in network utilization, respectively. Packet delay was reduced into 1/12.

Random Access Method for the IEEE 802.16 Networks (IEEE 802.16 망을 위한 랜덤 액세스 기법)

  • Kim, Myeong-Hwan;Kook, Kwang-Ho;Lee, Kang-Won;Kim, Young-Il
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.11-19
    • /
    • 2008
  • To enhance the performance of the IEEE 802.16 broadband wireless access system, it is necessary to improve the efficiency of the radio link. The efficiency of the uplink can be improved by using more efficient random access method. As new random access methods, we propose a RA_NBRM method which is based on the number of bandwidth request messages and a RA_CRA method which is based on the conflict resolution algorithm. The simulation results show that the performance of the new methods is superior to that of the existing binary exponential backoff method.

  • PDF

Random Access Method of the Wibro System

  • Lee, Kang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1A
    • /
    • pp.49-57
    • /
    • 2011
  • Random access method for Wibro system is proposed using the Bayesian Technique, which can estimate the number of bandwidth request messages in a frame only based on the number of successful slots. The performance measures such as the maximum average throughput, the mean delay time and the collision ratio are investigated to evaluate the performance of the proposed method. The proposed method shows better performance than the binary exponential backoff algorithm used currently.

The IEEE 802.11 MAC Protocol to solve Unfairness Problem in Multihop Wireless Ad Hoc Networks (다중 무선 에드혹 네트워크에서 불공정 문제를 해결하기 위한 802.11 MAC 프로토콜)

  • Nam, Jae-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.229-234
    • /
    • 2007
  • In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time. which is uniformly selected from the Contention Window (CW) This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme suffers from a unfairness problem and low throughput under high traffic load. In this paper, I propose a new backoff algorithm for use with the IEEE 802.11 Distributed Coordination Function.

  • PDF

The IEEE 802.11 MAC Protocol to solve Unfairness Problem in Multihop Wireless Ad Hoc Networks (다중 무선 에드혹 네트워크에서 불공정 문제를 해결하기 위한 802.11 MAC 프로토콜)

  • Nam, Jae-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.91-94
    • /
    • 2007
  • In the IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. The BEB scheme suffers from a fairness problem and low throughput under high traffic load. In this paper, I propose a new backoff algorithm for use with the IEEE 802.11 Distributed Coordination Function.

  • PDF

A New Backoff algorithm considering Hop Count for the IEEE 802.11 Distributed Coordination Function

  • Nam, Jae-Hyun
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.3
    • /
    • pp.205-208
    • /
    • 2007
  • The IEEE 802.11 is a MAC protocol which has been standardized by IEEE for Wireless Local Area Networks (WLANs). In the IEEE 802.11 WLANs, network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. However, the BEB scheme suffers from a fairness problem; some nodes can achieve significantly larger throughput than others. This paper proposes a new backoff algorithm for the IEEE 802.11 DCF scheme. This algorithm uses the hop count for considering fairness. It causes flows with high hop count to generate short backoff interval than those with low hop count, thus getting high priority. Therefore, when a collision occurs, the modified IEEE 802.11 DCF assigns higher priority to flow to be close to a destination.

Performance Evaluation of X-MAC/BEB Protocol for Wireless Sensor Networks

  • Ullah, Ayaz;Ahn, Jong-Suk
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.857-869
    • /
    • 2016
  • This paper proposes an X-MAC/BEB protocol that runs a binary exponential backoff (BEB) algorithm on top of an X-MAC protocol to save more energy by reducing collision, especially in densely populated wireless sensor networks (WSNs). X-MAC, a lightweight asynchronous duty cycle medium access control (MAC) protocol, was introduced for spending less energy than its predecessor, B-MAC. One of X-MAC 's conspicuous technique is a mechanism to allow senders to promptly send their data when their receivers wake up. X-MAC, however, has no mechanism to deal with sudden traffic fluctuations that often occur whenever closely located nodes simultaneously diffuse their sense data. To precisely evaluate the impact of the BEB algorithm on X-MAC, this paper builds an analytical model of X-MAC/BEB that integrates the BEB model with the X-MAC model. The analytical and simulation results confirmed that X-MAC/BEB outperformed X-MAC in terms of throughput, delay, and energy consumption, especially in congested WSNs.