• Title/Summary/Keyword: IEEE 802.11 distributed coordination function (DCF)

Search Result 74, Processing Time 0.023 seconds

A Dynamic Minimum Contention Window for Collision Resolution in IEEE 802.11 Distributed Coordination Function) (IEEE 802.11 Distributed Coordination Function에서 충돌방지를 위한 동적인 최소 경쟁윈도우의 적용)

  • Woo, Sung-Je;Lee, Tae-Jin
    • 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.

A Virtual Grouping Scheme for Improving the Performance of IEEE 802.11 Distributed Coordination Function (IEEE 802.11 DCF의 성능 향상을 위한 가상 그룹 방법)

  • 김선명;조영종
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.8
    • /
    • pp.9-18
    • /
    • 2004
  • The IEEE 802.11 Distributed Coordination Function(DCF) protocol provides a contention-based distribution channel access mechanism for stations to share the wireless medium. However, the performance of the DCF drops dramatically in terms of throughput, delay and delay jitter as the number of active stations becomes large. In this paper, we propose a simple and effective scheme, called DCF/VG(Distributed Coordination Function with Virtual Group), for improving the performance of the IEEE 802.11 DCF mechanism. In this scheme, each station independently decides the virtual group cycle using the information provided by the carrier sensing mechanism. The virtual group cycle consists of one or more virtual groups and a virtual group includes an idle period and a busy period. Each station operates in only one out of several virtual groups of the virtual group cycle and does not operate in the others. In other words, each station decreases its backoff counter and tries to transmit a packet only in its virtual group like the IEEE 802.11 DCF. Performance of the proposed scheme is investigated by numerical analysis and simulation. Numerical and simulation results show that the proposed scheme is very effective and has high throughput and low delay and jitter under a wide range of contention level.

Pameter Analysis of IEEE 802.11e EDCF (IEEE 802.11e EDCF의 파라미터 분석)

  • Ko, dong-yub;Park, doo-jin;Lim, seok-ku
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.611-614
    • /
    • 2007
  • The IEEE 802.11 Task Group E has worked to enhance the legacy 802.11 MAC to expand support for applications with QoS requirements. EDCF(Enhanced Distributed Coordination Function) of IEEE 802.11e is enhanced from DCF(Distributed Coordination Function) of 802.11 and It has differential AC(Access Category). In this paper, we change parameters(AIFS, CWmax) and make an analysis of network performance. We use NS-2 to verify change of network performance.

  • PDF

Design and Performance Analysis of an Enhanced MAC Algorithm for the IEEE 802.11 DCF (IEEE 802.11 DCF 성능 개선을 위한 매체접근제어 알고리즘의 설계 및 성능 분석)

  • Hwang, An-Kyu;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.10 s.340
    • /
    • pp.39-50
    • /
    • 2005
  • In this paper, we propose a performance improving MAC algerian for the IEEE 802.11 DCF. WLAN based IEEE 802.11 uses two control methods called 'Distributed Coordination Function(UF)' and 'Point Coordination Function(PCF)'. The nF controls the Urnsmission based on carrier sense multiple access with collision detection(CSMA/CA), that decides a random backoff time with the range of contention window for each terminal. Normally, each terminal the CW double after collision, and reduces the CW to the minimum after successful transmission. This paper proposes an enhanced DCF algorithm that decreases the CW smoothly after successful transmission in order to reduce the collision Probability by utilizing the current status information of WLAN. We also analyze the throughput and delay performance for the unsaturated case mathematically. Simulation results show that our algorithm enhances the saturation throughput of WLAN. They also coincide well with the analytical results.

MAC Performance Improvement by Selective Use of DCF and PCF Protocols for IEEE 802.11 Wireless LANs (무선랜에서 망 상태에 따른 DCF와 PCF 프로토콜의 선택적인 사용을 통한 MAC 성능 향상)

  • Choi, Woo-Yong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.2
    • /
    • pp.89-95
    • /
    • 2011
  • The distributed coordination function (DCF) and point coordination function (PCF) protocols are the basic MAC protocols for legacy IEEE 802.11, IEEE 802.11a, IEEE 802.11b, IEEE 802.11e, IEEE 802.11g and IEEE 802.11n wireless LANs. When the DCF protocol is used for the various versions of IEEE 802.11 wireless LANs, the MAC performance seriously degrades due to the collisions among the stations (STAs) as more and more STAs attempt to transmit their data frames. On the other hand, the PCF MAC performance becomes poor when many STAs exist in IEEE 802.11 wireless LANs, however, only small number of STAs actually attempt to transmit their data frames. In this paper, we propose the algorithm for improving the MAC performance by selectively using the DCF and PCF protocols according to the state of IEEE 802.11 wireless LANs. Numerical examples are presented to show the MAC performance improvement by the selective use of the DCF and PCF protocols according to the network state.

A New IEEE 802.11 DCF Utilizing Freezing Experiences in Backoff Interval and Its Saturation Throughput

  • Sakakibara, Katsumi;Taketsugu, Jumpei
    • Journal of Communications and Networks
    • /
    • v.12 no.1
    • /
    • pp.43-51
    • /
    • 2010
  • IEEE 802.11 defines distributed coordination function (DCF), which is characterized by CSMA/CA and binary exponential backoff (BEB) algorithm. Most modifications on DCF so far have focused on updating of the contention window (CW) size depending on the outcome of own frame transmission without considering freezing periods experienced in the backoff interval. We propose two simple but novel schemes which effectively utilize the number of freezing periods sensed during the current backoff interval. The proposed schemes can be applied to DCF and its family, such as double increment double decrement (DIDD). Saturation throughput of the proposed schemes is analyzed by means of Bianchi's Markovian model. Computer simulation validates the accuracy of the analysis. Numerical results based on IEEE 802.11b show that up to about 20% improvement of saturation throughput can be achieved by combining the proposed scheme with conventional schemes when applied to the basic access procedure.

Performance Analysis on DCF Considering the Number of Consecutive Successful Transmission in Wireless LAN (무선랜에서 연속적인 전송성공 횟수를 고려한 DCF 성능분석)

  • Lim, Seog-Ku
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.2
    • /
    • pp.388-394
    • /
    • 2008
  • In this paper, MAC(Medium Access Control) algorithm for the IEEE 802.11 DCF(Distributed Coordination Function) 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 and PCF(Point Coordination function). The DCF controls the transmission based on CSMA/CA(Carrier Sense Multiple Access With Collision Avoidance). 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.

Variable Backoff Stage(VBS) Algorithm to Reduce Collisions in IEEE 802.11 DCF (IEEE 802.11 DCF 에서의 충돌 감소를 위한 가변 백오프 스테이지(VBS) 알고리즘)

  • Kang, Seongho;Choo, Young-yeol
    • 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.

Improvement of Polling Management scheme in IEEE 802.11 Wireless LAN (IEEE 802.11 무선랜의 DCF를 이용한 폴링관리기법 개선)

  • 박진석;김경준;황성호;한기준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04d
    • /
    • pp.343-345
    • /
    • 2003
  • 최근 무선랜의 발전으로 공공의 사용자 밀집 지역에서 무선랜의 이용이 가능해졌다. 이러한 사용자 밀집 지역에서는 엑세스 과밀 현상이 발생하므로 기존의 무선랜 방식보다 차별화된 엑세스 관리 방법이 요구된다. 본 논문에서는 무선랜의 표준인 IEEE 802.11 에서 제안된 DCF(Distributed Coordination Function)와 PCF(Point Coordination Function) 두가지 전송 방식의 데이터 전송과 폴링 방법을 핫스팟 환경에 맞추어 효과적으로 개선하는 방법으로 노드에 의해서 폴링을 관리하는 스킴을 제안한다.

  • PDF

A Generalized Markov Chain Model for IEEE 802.11 Distributed Coordination Function

  • Zhong, Ping;Shi, Jianghong;Zhuang, Yuxiang;Chen, Huihuang;Hong, Xuemin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.2
    • /
    • pp.664-682
    • /
    • 2012
  • To improve the accuracy and enhance the applicability of existing models, this paper proposes a generalized Markov chain model for IEEE 802.11 Distributed Coordination Function (DCF) under the widely adopted assumption of ideal transmission channel. The IEEE 802.11 DCF is modeled by a two dimensional Markov chain, which takes into account unsaturated traffic, backoff freezing, retry limits, the difference between maximum retransmission count and maximum backoff exponent, and limited buffer size based on the M/G/1/K queuing model. We show that existing models can be treated as special cases of the proposed generalized model. Furthermore, simulation results validate the accuracy of the proposed model.