• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.493-495
• /
• 2003

IEEE 802.11 DCF에서는 CSMA/CA(Carrier Sense Multiple Access/Collision Avoidance)를 통해 패킷들간의 충돌 확률을 줄여주고 있다. 하지만, 채널을 공유하는 station들이 증가할수록 충돌이 심해져 이를 해결하기 위해 많은 연구가 수행되고 있다. 그 대표적인 접근 방법으로 802.11 표준의 backoff 방식을 개선하거나, DCF+[3]처럼 Data­ACK (혹은 RTS­CTS­Data­ACK)의 기존의 프레임 교환 방식을 수정하여 한 번 전송에 성공한 station이 채널을 오랫동안 소유하여 채널의 활용도를 높이는 방법을 제안하고 있다. 본 논문에서는 기존의 방법들과는 다르게 성공하였을 때가 아니라 충돌이 발생하였을 때의 상황을 역으로 이용하여 무선망에서 공명성(fairness)를 높이는 새로운 방법을 제시하고 있다.

• Proceedings of the KAIS Fall Conference
• /
• 2008.05a
• /
• pp.231-233
• /
• 2008

본 논문에서는 IEEE 802.11 WLAN의 MAC인 DCF의 성능을 개선하는 알고리즘을 제안하고 이를 시뮬레이션으로 분석한다. IEEE 802.11 WLAN의 MAC에서는 데이터 전송을 제어하기 위한 방법으로 DCF와 PCF를 사용하며, DCF의 경우 CSMA/CA를 기반으로 한다. CSMA/CA는 스테이션간의 충돌을 줄이기 위해서 임의의 Backoff time을 각 스테이션의 CW(Contention Window) 범위에서 결정한다. 스테이션은 패킷 전송 후 충돌이 발생하면, 윈도우 크기를 두 배로 증가시키며, 패킷을 성공적으로 전송하면 윈도우 크기를 최소 CW로 감소한다. DCF는 경쟁 스테이션이 적은 상황에서는 비교적 우수한 성능을 보이나 경쟁 스테이션의 수가 많은 경우 처리율, 지연 관점에서 성능이 저하되는 문제점이 있다. 본 논문에서는 패킷 전송 후 충돌이 발생하면 윈도우 값을 최대 CW로 증가시키고 패킷의 정상적인 전송 후에는 윈도우 값을 서서히 감소함으로써 현재 WLAN의 망 상태정보를 계속 활용함으로써 패킷 충돌 확률을 낮추는 알고리즘을 제안한다. 제안하는 알고리즘의 효율성을 입증하기 위해 시뮬레이션을 수행하여 그 타당성을 제시하였다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2159-2166
• /
• 2016

In the IEEE 802.11 DCF (Distributed Coordination Function) protocol, the binary exponential backoff algorithm is used to avoid data collisions. However, as the number of stations increases of, the collision probability tends to grow and the overall network performance is reduced. To solve this problem, this paper proposes a data transmission scheme based on the channel reservation method. In the proposed scheme, channel time is divided into reservation period and contention period. During the reservation period, stations succeeded in channel reservation transmit their own data packets in sequence without contention. During the contention period, each station sends its data packets through contentions as in DCF. During both the reservation period and the contention period, each station sends a request for channel reservation for the next reservation period to an AP (Access Point). After receiving such a channel reservation request from each station, the AP decides whether the reservation is succeeded and sends the result via a beacon frame to each station. Performance of the proposed scheme is analyzed through simulations. The simulation results show that the proposed scheme tends to reduce the collision probability of DCF and to improve the overall network performance.

• 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 information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.343-347
• /
• 2008

Wakeup schemes that turn off sensors' radio when communication is not necessary have great potential in energy saving. At the start of each beacon interval in the IEEE 802.11 power saving mode specified for DCF, each node periodically wakes up for duration called the ATIM Window. However, in the power saving mechanism specified in IEEE 802.11, all nodes use the same ATIM window size. Since the ATIM window size critically affects throughput and energy consumption, a fixed ATIM window does not perform well in all situations. This paper proposes an adaptive mechanism to dynamically choose an ATIM window size according to network condition. Simulation results show that the proposed scheme outperforms the IEEE 802.11 power saving mechanism in terms of the amount of power consumed and the packet delivery ratio.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.2
• /
• pp.119-127
• /
• 2011

The paper surveys various analytical models for IEEE 802.11 medium access control protocols and critically discusses recent issues developing in wireless mobile ad hoc networks and their MACs. The surveyed MAC protocols include the standard IEEE 802.11 MAC suites such as IEEE 802.11 DCF, IEEE 802.11 PCF, IEEE 802.11e EDCA, and IEEE 802.11 ad hoc mode; and also the newer, de facto MAC protocols. We study the analytic models of the standard MAC suites followed by the newer analytic models that have been published in recent years. Also, the paper tries to include most of current literatures discussing analytic modeling of MAC in conjunction to some critical issues such as contention among ad hoc nodes, hidden terminal problems, and real-time service support.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.249-257
• /
• 2005

A Markov model for the IEEE 802.11 standard which is the most widely deployed wireless LAN protocol, is designed and the channel throughput is evaluated. The DCF of 802.11, which is based on CSMA/CA protocol, coordinates transmissions onto the shared communication channel. In this paper, under a finite load traffic condition and the assumption of packet loss after the final backoff stage. We present an algorithm to find the transmission probability and derive the formula for the channel throughput. The proposed model is validated through simulation and is compared with the case without packet losses.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1613-1621
• /
• 2015

This paper analyzes the rate adaptation scheme and suggests applicable strategy of the MCS(Modulation and Coding Scheme) for improving DCF throughput in the IEEE 802.11ad and 802.11ad wireless LAN. IEEE 802.11ac and 802.11ad wireless LAN provide MCS technique that dynamically adjusts modulation level and code rate to the time-varying channel conditions in order to obtain considerably high data rates. But these standards did not provide rate adaptation algorithm, so this paper surveyes rate adaptation algorithm and suggests MCS scheme applied to IEEE 802.11ac and 802.11ad wireless LAN. Specially A MAC(Medium Access Control) layer throughput is evaluated over error-prone channel in the IEEE 802.11ac-based wireless LAN. In this evaluation, DCF (Distributed Coordination Function) protocol and A-MPDU (MAC Protocol Data Unit Aggregation) scheme are used. Using theoretical analysis method, the MAC saturation throughput is evaluated with the PER (Packet Error Rate) on the condition that the number of station, transmission probability, the number of parallel beams and the number of frames in each A-MPDU are variables.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.11
• /
• pp.1001-1011
• /
• 2012

In this paper, the effects to system performance are evaluated in IEEE 802.11 system when the number of competing terminals are estimated and reflected to the system. The IEEE 802.11 system uses DCF (Distributed Coordination Function) for the multiple access method, and the system throughput performance depends on the accuracy of the estimated number of competing terminals. We propose extended H infinity filter (EHIF) approach which does not require the noise information for estimating the number of competing terminals. Simulation results show that EHIF outperforms the extended Kalman filter in both saturated and non-saturated network conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.80-89
• /
• 2005

In IEEE 802.11 and 802.11e for ad hoc networks, DCF and EDCA use a contention-based protocol called CSMA/CA, which is simple to implement efficient when the system is light loaded. But the performance of CSMA/CA decreases dramatically when the system load is heavy because of increasing collisions. In PCF and HCF modes, stations are controlled by a base station by polling, no collision ever occurs. However, when the system load is light, the performance is poor because few stations have data to transfer. More important, PCF and HCF can not be used in the ad hoc networks. In this paper, we address a priority-based distributed polling mechanism (PDPM) that implements polling scheme into DCF or EDCA modes for ad hoc networks by adding a polling approach before every contention-based procedure. PDPM takes the advantages of polling mechanism that avoids most of collisions in a high load condition. At the same time, it also keeps the contention-based mechanism for a light loaded condition. PDPM provides quality of service (QoS) with fewer collisions and higher throughput compared with IEEE 802.11e.