• Proceedings of the KAIS Fall Conference
• /
• 2008.11a
• /
• pp.304-306
• /
• 2008

CSMA/CA를 기반으로 하는 IEEE 802.11 무선랜의 MAC에서는 데이터 전송을 제어하기 위한 방법으로 DCF와 PCF를 사용한다. CSMA/CA는 스테이션간의 충돌을 줄이기 위해서 임의의 백오프 시간을 각 스테이션의 경쟁윈도우(Contention Window) 범위에서 결정한다. 스테이션은 패킷 전송 후 충돌이 발생하면, 윈도우 크기를 두 배로 증가시키며, 패킷을 성공적으로 전송하면 윈도우 크기를 최소 경쟁 윈도우(Minimum Contention Window)로 감소한다. DCF는 경쟁 스테이션이 적은 상황에서는 비교적 우수한 성능을 보이나 경쟁 스테이션의 수가 많은 경우 처리율, 패킷지연 관점에서 성능이 저하되는 문제점이 있다. 본 논문에서는 IEEE 802.11 MAC 계층 DCF 방식에서 최소 경쟁 윈도우의 값이 포화수율 및 패킷지연에 미치는 영향을 시뮬레이션에 의해 분석한다.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.34-38
• /
• 2006

In the wireless network, TCP performs poorly because it was originally designed for wired networks and does not take into consideration wireless characteristics such as mobility, high-loss probability, and hidden-terminal problems. In particular, in the wireless multi-hop networks, a large congestion window increases the probability of contention and packet losses, and TCP performance is degraded severely as a result. So, it is necessary to limit the TCP congestion window size in order keep the probability of contention loss in the system to a minimum. In this paper, we propose a new scheme for determining the maximum congestion window size based on the measured bandwidth and Round-Trip-Time (RTT). Using ns-2 simulation, we show that the proposed scheme reduces the probability of packet contention and improves TCP performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9A
• /
• pp.1075-1082
• /
• 2004

Wireless LAN is a rather mature communication technology connecting mobile terminals. IEEE 802.11 is a representative protocol among Wireless LAN technologies. The basic medium access control (MAC) mechanism of IEEE 802.11 is called distnbuted coordination function (DCF). DCF shows poor throughput and high drop rate as the number of stations and offered traffic load increase. In this paper we propose an effective mechanism using dynamic mimmum contention window(CWmin) in wireless LAN~ and show that performance improves via simulations. Proposed dynamic CWmin scheme exhibits superior performance as the number of stations and offered load grow. As, our proposed scheme is expected to be more effective in highly densed wireless LAN environment.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.28-39
• /
• 2010

The study aims at offering a solution to the problems of transmission delay and data throughput decrease as the number of contending On-Board Units (OBU) increases by applying CSMA medium access control protocol based upon IEEE 802.11p. In a competition-based medium, contention probability becomes high as OBU increases. In order to improve the performance of this medium access layer, the author proposes EDCA which a adaptive adjustment of the Contention Windows (CW) considering traffic density and data type. EDCA applies fixed values of Minimum Contention Window (CWmin) and Maximum Contention Window (CWmax) for each of four kinds of Access Categories (AC) for channel-specific service differentiation. EDCA does not guarantee the channel-specific features and network state whereas it guarantees inter-AC differentiation by classifying into traffic features. Thus it is not possible to actively respond to a contention caused by network congestion occurring in a short moment in channel. As a solution, CWminAS(CWmin Adaptation Scheme) and ACATICT(Adaptive Contention window Adjustment Technique based on Individual Class Traffic) are proposed as active CW control techniques. In previous researches, the contention probabilities for each value of AC were not examined or a single channel based AC value was considered. And the channel-specific demands of IEEE 802.11p and the corresponding contention probabilities were not reflected in the studies. The study considers the collision number of a previous service section and the current network congestion proposes a dynamic control technique ACCW(Adaptive Control of Contention windows in considering the WAVE situation) for CW of the next channel.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.191-195
• /
• 2008

This paper proposes a technique for improving IEEE 802.11e EDCA's performance by dynamically adjusting each class's contention window size based on each class's traffic amount. For providing differentiated service differently from 802.11, 802.11e EDCA maintains four classes each of which specifies different static minimum and maximum contention window sizes. Since the initial window sites significantly affect the 802.11e performance, several window adjustment schemes have been proposed. One of the schemes known as CWminAS (CWmin Adaptation Scheme) dynamically and synchronously determines the four windows' site based on the periodically measured collision rate. This method, however, can lower the send probability of high priority classes since it can't differentiate their collisions from those of low priority classes, leading to the channel underutilization. For solving this problem, we propose ACATICT(Adaptive Contention-window Adjustment Technique based on Individual Class Traffic) algorithm which adapts each class window size based on each individual collision rate rather than one average collision rate. Our simulation experiments show that ACATICT achieves better utilization by around 10% at maximum.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.329-336
• /
• 2011

This paper addresses the fairness issue between uplink and downlink traffic in IEEE 802.11 WLANs. Some solutions in existing work try to solve this issue by giving smaller minimum contention window (CWmin) value to an AP compared to stations. In contrast to the existing solutions, a proposed algorithm in this paper aims at finding CWmin values that not only provides fairness between uplink and downlink traffic among stations but also achieves high throughput. For this, in the proposed algorithm, an AP checks the number of stations that have uplink and downlink traffic, respectively. Based on this information, the AP calculates optimal CWmin values and announces it to stations. Our simulation results show that the proposed algorithm outperforms existing algorithms in terms of fairness and throughput.

• Proceedings of the KAIS Fall Conference
• /
• 2008.11a
• /
• pp.301-303
• /
• 2008

CSMA/CA를 기반으로 하는 IEEE 802.11 무선랜의 MAC에서는 데이터 전송을 제어하기 위한 방법으로 DCF와 PCF를 사용한다. IEEE 802.11 무선랜의 기본적인 액세스 방법으로 사용하는 DCF에서는 스테이션간의 충돌을 줄이기 위해서 임의의 백오프 시간을 각 스테이션의 경쟁윈도우(Contention Window) 범위에서 결정한다. 스테이션은 패킷 전송 후 충돌이 발생하면, 윈도우 크기를 두 배로 증가시키며, 패킷을 성공적으로 전송하면 윈도우 크기를 최소 경쟁 윈도우(Minimum Contention Window)로 감소한다. DCF는 경쟁 스테이션이 적은 상황에서는 비교적 우수한 성능을 보이나 경쟁 스테이션의 수가 많은 경우 처리율, 패킷지연 관점에서 성능이 저하되는 문제점이 있다. 본 논문에서는 IEEE 802.11 MAC 계층 DCF 방식에서의 평균폐기시간에 여러 연구결과들을 비교분석한다.

• Proceedings of the KAIS Fall Conference
• /
• 2007.11a
• /
• pp.92-94
• /
• 2007

IEEE 802.11 WLAN(Wireless LAN)은 그 편리함과 효율성으로 인하여 수요의 증가 및 기술의 개발이 계속되고 있다. MAC(Medium Access Control)계층 중 기본적인 매체 접근 방식인 DCF(Distributed Coordination Function)는 CSMA/CA 알고리즘을 이용하여 충돌문제를 해결한다. 본 논문에서는 IEEE 802.11 MAC 계층 DCF 방식에서 스테이션간의 충돌확률을 줄이기 위하여 각 스테이션의 경쟁 윈도우 범위 사이에서 임의의 Backoff Time을 설정하는 것에 착안하여 최소 경쟁 윈도우(Minimum Contention Window)의 값이 성능에 어떠한 영향을 미치는가를 시뮬레이션을 이용하여 분석한다.

• 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 Digital Contents Society
• /
• v.9 no.1
• /
• pp.61-67
• /
• 2008

In this paper, MAC algorithm for the IEEE 802.11 DCF improving the performance is proposed and analyzed by simulation. The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF(Distributed Coordination Function) and PCF(Point Coordination Function). The DCF controls the transmission based on CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance), that decides a random backoff time with the range of CW(Contention Window) for each station. Normally, each station increase the CW to double after collision, and reduces the CW to the minimum after successful transmission. The DCF shows excellent performance relatively in situation that competition station is less but has a problem that performance is fallen from throughput and delay viewpoint in situation that competition station is increased. This paper proposes an enhanced DCF algorithm that increases the CW to maximal CW after collision and decreases the CW smoothly after successful transmission in order to reduce the collision probability by utilizing the current status information of WLAN. To prove efficiency of proposed algorithm, a lots of simulations are conducted and analyzed.