• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.116-124
• /
• 2003

According to the convenience and efficiency, IEEE 802.11 WLAN(Wireless LAN) has became rapidly wide-spread on the market. However, QoS support is needed for various multimedia service. In this paper, we consider both MAC method of IEEE 802.11 and IEEE 802.11e and Traffic Category differentiated service by QoS support method. In addition, we study currently existing back-off algorithms in view of comparative analysis. As a result we propose a new back-off algorithm called Collision Rate Based-EDCF. The proposed back-off algorithm confirms the performance by computer simulations in terms of Throughput, and QoS support.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3446-3464
• /
• 2017

Backoff mechanism serves as one of the key technologies in the MAC-layer of wireless mobile networks. The traditional Binary Exponential Backoff (BEB) mechanism in IEEE 802.11 Distributed Coordination Function (DCF) and other existing backoff mechanisms poses several performance issues. For instance, the Contention Window (CW) oscillations occur frequently; a low delay QoS guarantee cannot be provided for real-time transmission, and services with different priorities are not differentiated. For these problems, we present a novel Multi-Priority service differentiated and Adaptive Backoff (MPAB) algorithm over IEEE 802.11 DCF for wireless mobile networks in this paper. In this algorithm, the backoff stage is chosen adaptively according to the channel status and traffic priority, and the forwarding and receding transition probability between the adjacent backoff stages for different priority traffic can be controlled and adjusted for demands at any time. We further employ the 2-dimensional Markov chain model to analyze the algorithm, and derive the analytical expressions of the saturation throughput and average medium access delay. Both the accuracy of the expressions and the algorithm performance are verified through simulations. The results show that the performance of the MPAB algorithm can offer a higher throughput and lower delay than the BEB 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.

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

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.6
• /
• pp.1410-1418
• /
• 2007

This paper analyzes the throughput of DCF protocol at the MAC layer in the 802.11a wireless LAN. The throughput of DCF protocol is related on probability of backoff, depends on retransmission of each terminal. This paper applied to nonmarcov discrete model for each terminal BER in the base station versus the packet throughput is progressing with the data rate of 6,12,24,54 Mbps, We find the fact that the less the data rate be the higher the throughput. We also find from the throughput calculation by means of traffic intensity in OFDM wireless LAN.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.393-395
• /
• 2015

IEEE 802.11 무선 랜은 단말들 간의 채널을 공유하기 위해 CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) 기반의 DCF(Distributed Coordination Function) 프로토콜을 제공한다. DCF는 네트워크상의 단말수가 증가할수록 충돌 확률이 증가하여 전체적인 성능 감소를 야기한다. 이는 네트워크에 있는 모든 단말이 동시에 채널 경쟁을 하기 때문이다. 충돌 확률을 줄이고 성능을 향상시키기 위해 단말을 여러 그룹으로 나누고 각 그룹에 속하는 단말들간 채널 경쟁을 수행하는 가상 그룹 방법이 제안되었다. 그러나 가상 그룹 방법은 각 단말이 독립적으로 그룹 수를 결정하고 자신이 어느 그룹에 속해 동작할지 결정한다. 따라서 단말마다 서로 그룹 수가 다를 수 있고 단말이 하나도 포함되지 않은 그룹이 존재할 수 있다. 즉, 가상 그룹 방법은 단말간 공평성 문제가 있고 오동작 가능성이 있다. 이 문제를 해결하기 위해 본 논문에서는 비지톤과 타이머를 이용하여 단말간 동기화를 맞춰 그룹 수 및 자신의 그룹 번호를 독립적으로 결정하는 방법을 제안한다. 그룹 수는 현재 채널 경쟁 수준을 고려하여 결정한다. 단말들의 그룹화를 통해 충돌확률을 줄이고 네트워크 성능을 향상시킨다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.995-998
• /
• 2007

무선 네트워크에서 사용되는 단말기는 이동성이라는 특징상 한정된 에너지를 사용하여 동작하게 된다. 따라서 무선 호스트에 의해 소모되는 에너지의 양을 감소시키기 위한 기술은 대단히 중요하다. 이러한 기술적 지원을 위해 IEEE 802.11 에서는 DCF (Distributed Coordination Function) 전력 절감 메카니즘을 제안하고 있다. 그런데, DCF 를 위한 IEEE 802.11 전력 절감 메카니즘에서는 ATIM 창 동안 노드들은 비콘 기간 동안 깨어 있는 상태로 있을 것인지를 결정하기 위해서 control packet 을 교환 하는데, 이러한 ATIM 창 크기는 각각의 노드들의 전력 절감에 상당한 영향을 미친다. 그래서 ATIM 창 크기를 효율적으로 할당하기 위해 DPSM 과 같은 기법들이 개발되었다. 본 논문은 ATIM 창 크기를 동적으로 증감시켜서 ATIM 창 시간동안 소모되는 에너지를 줄이도록 하였다. ATIM 창 크기를 동적으로 할당하기 위하여 통계적 예측 기법인 칼만 필터를 도입하여 예측시스템을 구축하였으며, 이 예측 시스템을 통해 다음 상태에서 적용할 ATIM 창 크기를 예측하여 동적으로 할당하도록 하였다. 실험 결과 네트워크 생존 시간을 28.6% 증가시켰고, ATIM 창 크기 예측값의 오차는 4.42%로 나타났다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1098-1115
• /
• 2010

An inseparable challenge associated with every random access network is the design of an efficient Collision Resolution Algorithm (CRA), since collisions cannot be completely avoided in such network. To maximize the collision resolution efficiency of a popular CRA, namely Binary Exponential Backoff (BEB), we propose a reactive backoff algorithm. The proposed backoff algorithm is reactive in the sense that it updates the contention window based on the previously selected backoff value in the failed contention stage to avoid a typical type of collision, referred as cross-collision. Cross-collision would occur if the contention slot pointed by the currently selected backoff value appeared to be present in the overlapped portion of the adjacent (the previous and the current) windows. The proposed reactive algorithm contributes to significant performance improvements in the network since it offers a supplementary feature of Cross Collision Exclusion (XCE) and also retains the legacy collision mitigation features. We formulate a Markovian model to emulate the characteristics of the proposed algorithm. Based on the solution of the model, we then estimate the throughput and delay performances of WLAN following the signaling mechanisms of the Distributed Coordination Function (DCF) considering IEEE 802.11b system parameters. We validate the accuracy of the analytical performance estimation framework by comparing the analytically obtained results with the results that we obtain from the simulation experiments performed in ns-2. Through the rigorous analysis, based on the validated model, we show that the proposed reactive cross collision exclusionary backoff algorithm significantly enhances the throughput and reduces the average packet delay in the network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.535-538
• /
• 2005

Wireless LANs based on the IEEE 802.11 standard are widely spread for use nowadays. Traffic which are conveyed over the WLANs change rapidly from normal data such a Email and Web pages, to multimedia data of high resolution video and voice. To meet QoS (Quality of Service) required by these multimedia traffic, the IEEE 802 committee recently has developed a new standard, IEEE 802.11e. IEEe 802.11.e contains two MAC mechanisms for providing QoS: EDCA(Enhanced Distributed Channel Access) and HCCA (HCF Controlled Channel Access). Using these standardized MAC mechanisms as a building platform, various admission control mechanisms can be combined to offer QoS gurantees for multimedia traffic. This paper surveys these research efforts.