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

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.289-292
• /
• 2009

IEEE 802.11 WLAN(Wireless LAN)은 효율성과 편리함으로 시장에 급격히 보급되었다. 이 IEEE 802.11 WLAN은 CSMA/CA를 기반으로 하는 DCF방식을 주로 사용하고 있으며, Contention Window, Backoff Size를 이용한 각 단말기들간의 자유 경쟁에 의한 전송 방식을 택하고 있다. 그 주된 방법으로 단말기는 CW를 설정하고 CW범위안에서 랜덤한 값을 정해 Backoff Counter를 줄여 채널을 점유하는 방식이다. DCF방식은 채널을 두고 여러 대의 단말기가 서로 경쟁을 함으로써 채널을 할당 받아 사용하게 된다. 본 논문에서는 이러한 채널 할당시 CW값을 조절하여 다른 단말기보다 채널을 빨리 할당받고 높은 처리량을 나타내는 탐욕적(Greedy) 노드문제에 대해서 분석하는 방법에 대해서 설명하려고 한다.

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

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1108-1130
• /
• 2013

Wireless Body Area Networks (WBANs) are becoming increasingly important to solve the issue of health care. IEEE 802.15.6 is a wireless communication standard for WBANs, aiming to provide a real-time and continuous monitoring. In this paper, we present our development of a modified Markov Chain model and a backoff model, in which most features such as user priorities, contention windows, modulation and coding schemes (MCSs), and frozen states are taken into account. Then we calculate the normalized throughput and average access delay of IEEE 802.15.6 networks under saturation and ideal channel conditions. We make an evaluation of network performances by comparing with IEEE 802.15.4 and the results validate that IEEE 802.15.6 networks can provide high quality of service (QoS) for nodes with high priorities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4A
• /
• pp.412-420
• /
• 2006

With the appearance of various types of traffic services in communication networks, a study on QoS(Quality of Service) packet scheduling mechanisms which can support differentiated service to each traffic service becomes very important. To meet this requirement, IEEE 802.11 Working Group established the IEEE 802.11e MAC protocol which categorizes every traffic services into 4 access categories(AC) and provides the differentiated service to each AC. In addition, the physical layer of IEEE 802.11a/g standards provide up to 54 Mbps transmission rate per one wireless LAN terminal. However, since the radio resource is hardly limited in wireless channel, it is necessary to find an efficient packet scheduling scheme to maximize the transmission efficiency. Therefore, in this paper, we proposed a new packet scheduling scheme that can enhance the total throughput by setting different contention windows(CW) of CSMA-CA channel access scheme to each wireless LAN terminal according its current channel states. Numerical results derived from using NS-2 network simulator have shown that our proposed packet scheduling scheme can enhance the performance of IEEE 802.11e more and more.

• Journal of information and communication convergence engineering
• /
• v.4 no.2
• /
• pp.71-74
• /
• 2006

A basic access method about IEEE 802.11 MAC layer protocol using IEEE 802.11 wireless LANs is the DCF thatis based on the CSMA/CA. But, cause of IEEE 802.11 MAC layer uses original backoff algorithm (exponential backoff method), when collision occurred, the size of contention windows increases the double size Also, a time of packet transmission delay increases and efficienty is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs a proposed enhanced backoff algorithm. It is considered the transmission time of transmission control protocol (TCP) packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (A WGN) and Rician fading channel. From the results, a proposed enhanced backoff algorithm produces a better performance improvement than an original backoff in wireless LAN environment. Also, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between packet size and the transmission time, allowing for an inference of the optimal packet size in the TCP layer.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.530-533
• /
• 2006

Recently, a basic access method about IEEE 802.11 MAC layer protocol using IEEE 802.11 wireless LANs is the DCF thatis based on the CSMA/CA. But, cause of IEEE 802.11 MAC layer uses original backoff algorithm (exponential backoff method), when collision occurred, the size of contention windows increases the double size. Also, a time of packet transmission delay increases and efficiency is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs a proposed enhanced backoff algorithm. It is considered the transmission time of transmission control protocol (TCP) packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (AWGN) and Rician fading channel. From the results, a proposed enhanced backoff algorithm produces a better performance improvement than an original backoff in wireless LAN environment. Also, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between packet size and the transmission time, allowing for an inference of the optimal packet size in the TCP layer.

• Journal of Advanced Navigation Technology
• /
• v.8 no.1
• /
• pp.65-72
• /
• 2004

A basic access method using for IEEE 802.11a wireless LANs is the DCF method that is based on the CSMA/CA. But, Since IEEE 802.11 MAC layer uses original backoff algorithm (Exponential backoff method), when collision occurs, the size of contention windows increases the double size. Hence, packet transmission delay time increases and efficiency is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs using a proposed enhanced backoff algorithm. From the results, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between TCP packet size and total message transmission time, allowing for an inference of the optimal packet size in the TCP layer.