• 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.

• Journal of KIISE:Information Networking
• /
• v.31 no.4
• /
• pp.414-428
• /
• 2004

Many portable devices are coming to be commercially successful and provide useful services to mobile users. Mobile devices may request a variety of data types, including text and multimedia data, thanks to the rich content of the Internet. Different types of data and/or different classes of users may need to be treated with different qualities of service. The implementation of service differentiation in wireless networks is very difficult because of device mobility and wireless channel contention when the backoff algorithm is used to resolve contention. Modification of the t)mary exponential backoff algorithm is one possibility to allow the design of several classes of data traffic flows. We present a study of modifications to the backoff algorithm to support three classes of flows: sold, silver, and bronze. For example, the gold c]ass flows are the highest priority and should satisfy their required target bandwidth, whereas the silver class flows should receive reasonably high bandwidth compared to the bronze class flows. The mixture of the two different transport protocols, UDP and TCP, in ad hoc networks raises significant challenges when defining backoff algorithm modifications. Due to the different characteristics of UDP and TCP, different backoff algorithm modifications are applied to each class of packets from the two transport protocols. Nevertheless, we show by means of simulation that our approach of backoff algorithm modification clearly differentiates service between different flows of classes regardless of the type of transport protocol.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.360-368
• /
• 2008

In this paper, in order that the various QoS(Qualify of Service)s that are required by different traffic class are guaranteed in the random access channels in multi-service multi-user OFDMA systems, the backoff-based random access algorithm is proposed and corresponding performance is analyzed in terms of the access success probability, the throughput, the average delay and the blocking probability. Through the numerical analysis, it is shown that the proposed backoff-based random access algorithm can provide the differentiated QoSs to random access attempts according to their service class.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.77-83
• /
• 2009

In this parer, an improved backoff algorithm is proposed by supplementing a multiple of persistence factor for IEEE 802.11 Wireless LAN MAC. This algorithm is proposed to complement the shortcomings of the conventional BEB (Binary Exponential Backoff) algorithm which is used for retransmission to control a new contention window in DCF/EDCF MAC. In channel utilization, collision rate and Goodput viewpoint, we analysis the improved backoff algorithm and compared the result with that of the conventional algorithm In this result, we showed that the performance for PFA backoff algorithm is 10% higher than that for the conventional BEB algorithm when the number of station is 40.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.406-415
• /
• 2005

The standards which use shared medium like IEEE 802.11 wireless LAN have transmission opportunity by contention in contention period. If there are collisions in contention period, medium access control protocol may solve problem by using backoff algorithm. Backoff algorithm is important part in medium access control, but legacy backoff method which is used under IEEE 802.11 standards is not adjusted when load is heavy because of increasing collisions. In this paper, we propose a new load-based dynamic backoff algorithm in contention-based wireless shared medium to improve throughput of medium and to reduce the number of collisions. Proposed backoff algorithm can increase the network utilization about $20\%$ higher than that of binary exponential backoff algorithm.

• Journal of Digital Contents Society
• /
• v.12 no.3
• /
• pp.299-307
• /
• 2011

The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF and PCF. The DCF controls the transmission based on CSMA/CA The BEB backoff algorithm of DCF shows relatively excellent performance in situation that the number of competing station is less, but has a problem that performance of throughput and delay is degraded in situation that the number of competing station is increased. This paper mathematically analyzes an MIMD backoff algorithm considering retry limit that increases the CW to doubled after collision and decreases smoothly the CW to halves after successful transmission in order to reduce the collision probability. To prove efficiency of the MIMD backoff algorithm, lots of simulations are conducted and analyzed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1248-1250
• /
• 2007

IEEE 802.11 WLAN(Wireless LAN)은 그 편리함과 효율성으로 인해 급격히 시장에 보급되었다. 이에 따라 다양한 멀티미디어 서비스를 위해 QoS(Quality of Service)의 지원이 필요하게 되었다. 본 논문에서는 IEEE 802.11 WLAN 에서의 기존의 Backoff 방식을 분석하고, 여기에 기존의 재전송 기법에 ARQ 방식을 도입한 새로운 알고리즘을 제시하여 에너지 효율 (Energy Efficiency)의 향상을 도모한다. 또한, 기존의 Backoff 방식과 제안한 알고리즘의 처리율을 비교하여 기존의 방식 보다 제안된 알고리즘이 에너지 효율(Energy Efficiency)를 향상시키는 것을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12A
• /
• pp.1267-1275
• /
• 2007

An improved backoff algorithm for retransmission randomization for OFDMA/CDMA/slotted ALOHA used in the ranging subchannel of IEEE 802.16 network is proposed. Exploiting the fact that a base station coordinates channel access using UL-/DL-MAP in the IEEE 802.16 networks, we propose a minor modification of the existing IEEE 802.16 in order to increase throughput, decrease delay variation and achieve a graceful performance degradation in case of overload channel condition of the random access protocol. The algorithm basically estimates the number of backlogged users and arrival rate using which, the BS calculates retransmission probability for the subscriber stations involved in a collision. Computer simulation is performed to demonstrate the effectiveness of the proposed algorithm and to compare the performance with existing binary exponential backoff algorithm.

• 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.

• 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.