• Title/Summary/Keyword: IEEE 802.11 DCF

Search Result 156, Processing Time 0.021 seconds

Adaptive EDCF for IEEE802.11e MAC Protocol (IEEE 802.11e MAC의 성능향상을 위한 적응형 EDCF)

  • Kim Kunsu;Kim Beomjoon;Park Jungshin;Lee Jaiyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1A
    • /
    • pp.62-69
    • /
    • 2005
  • Efforts for standardization of medium access control (MAC) protocol in IEEE802.11e have been made to support quality of service (QoS) in IEEE802.11e MAC protocol. Enhanced disoibuted coordination function (EDCF) of 802.11e MAC protocol is modified to support QoS for packets that have differentiated priority. However, EDCF still has the problem of throughput optimization and priority support. Therefore, we have proposed a scheme called adaptive EDCF for both supporting priority of packets and throughput optimization. We have derived the relation between the number of nodes and contention window size for throughput optimization. Based on the analytic results, we have evaluated the performance of the proposed scheme using OPNET simulations. The simulation results show that using the proposed scheme can improve the overall throughput regardless of the number of nodes and the decrement of the throughput with increasing the number of nodes can be alleviated. Additionally, we have shown that the adaptive EDCF can support priority of packets more effectively than existing EDCF.

Adaptive EDCF for IEEE802.lie MAC Protocol (IEEE 802.11e MAC의 성능향상을 위한 적응형 EDCF)

  • Kim Kun su;Kim Beob jeon;Park Jung shin;Lee Jai yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12A
    • /
    • pp.1367-1374
    • /
    • 2004
  • Efforts for standardization of medium access control (MAC) protocol in IEEE802.11e have been made to support quality of service (QoS) in IEEE802.11 MAC protocol. Enhanced distributed coordination function (EDCF) of 802.11e MAC protocol is modified to support QoS for packets that have differentiated priority. However, EDCF still has e problem of throughput optimization and priority support. Therefore, we have proposed a scheme called adaptive EDCF for both supporting priority of packets and throughput optimization. We have derived the relation between the number of nodes and contention window size for throughput optimization. Based on the analytic results, we have evaluated the performance of the proposed scheme using OPNET simulations. The simulation results show that using the proposed scheme can Improve the overall throughput regardless of the number of nodes and the decrement of the throughput with increasing the number of nodes can be alleviated. Additionally, we have shown that the adaptive EDCF can support priority of packets more effectively than existing EDCF.

Reducing Flooding Latency in Power Save Mode of IEEE 802.11-based Mobile Ad hoc Networks (IEEE 802.11 기반 이동 애드혹 망의 전력 절감 모드에서 플러딩 지연의 개선)

  • 윤현주;서명환;마중수
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.5
    • /
    • pp.532-543
    • /
    • 2004
  • Mobile Ad hoc NETworks (MANET) consist of mobile nodes which are usually powered by battery Approaches for minimizing power consumption have been proposed for all network layers and devices. IEEE 802.11 DCF (Distributed Coordination Function), a well-known medium access control protocol for MANETS, also defines a power save mode operation. The nodes in power save mode periodically repeat the awake state and the doze state in synchronized fashion. When all nodes are in the awake state, the exchange the announcements for the subsequent message transmission with neighbors. The nodes that send or receive the announcements stay awake for data transmission, and others go into the dole state. The previous works for enhancing the power save mode operation have focused on shortening the duration of the awake state. We observed that the longer sleeping period results in seriously long delivery latency and the consequent unnecessary power consumption as well, because the packets can move forward only one hop for a fixed interval. In this paper, we propose an improved protocol for the power save mode of IEEE 802.11 DCF, which allows the flooding packets to be forwarded several hops in a transmission period. Our approach does not reduce the duration of compulsory awake period, but maximizes its utilization. Each node propagates the announcements for next flooding to nodes of several hops away, thus the packets can travel multiple hops during one interval. Simulation results of comparison between our scheme and the standard show a reduction in flooding delay maximum 80%, and the unicasting latency with accompanying flooding flows near 50%, with slight increase of energy consumption.

A Study on CSMA/CA for IEEE 802.11 WLAN Environment

  • Moon Il-Young;Cho Sung-Joon
    • 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.

IEEE 802.11 무선 랜의 성능 특성

  • Choe, Seon-Ung
    • Information and Communications Magazine
    • /
    • v.24 no.6
    • /
    • pp.50-57
    • /
    • 2007
  • 오늘날 인프라 무선 랜은 많은 사용자들이 사용하는 중요한 인터넷 접속 기술이다. 따라서, IEEE 802.11 MAC의 성능분석은 지난 몇 년간 무선 랜 연구의 중요한 테마 중의 하나였다. 본고에서는 프로토콜 계층 사이에 존재하는 상호 의존성의 중요성에 주목하며, IEEE 802.11 기반의 무선 랜이 갖는 성능 특성에 관하여 알아본다. 먼저, 무선 노드의 개수가 많아짐에 따라 무선 랜 시스템의 처리율이 감소한다는 IEEE 802.11 MAC DCF 분석 결과를 설명한다. 여기에 MAC 계층과 다른 계층 사이의 상호 작용에 주목하여, 무선 랜의 성능이 어떤 특성을 갖는지 알아본다. 물리 계층에 존재하는 무선 노드들 사이의 불평등성에 대해서 설명하고, 그로 인하여 노드들 간의 혼잡 수준이 떨어지고 경쟁 기반의 DCF 처리율이 혼잡 상태에서도 서서히 감소하게 되는 것을 설명한다. 또한, 전송 계층 프로토콜로서 TCP를 사용하는 경우의 무선 랜 성능에 관하여 알아본다. TCP는 실제로 무선 채널의 경쟁에 참여하는 노드를 $2{\sim}3$개 정도로 제한하는 효과가 있어서, TCP를 사용하는 무선 랜의 성능은 무선 노드의 개수에 상관없이 안정적인 것을 설명한다.

Scheduling Algorithm to support QoS of Real-time Traffics in IEEE 802.11 Wireless LAN Environments (IEEE 802.11 무선랜 환경에서 실시간 트래픽의 QoS지원을 위한 스케줄링 알고리즘 제안)

  • 이상돈;김경준;한기준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.505-507
    • /
    • 2004
  • IEEE 802.11 무선랜 표준에서 MAC(Media Access Control)은 동기와 비동기의 두 가지 타입의 서비스를 지원한다. 동기적 실시간 트래픽은 PCF(Point Coordination Function)에 의해서 폴링 엑세스 기법에 의해 처리된다. 비동기적 비실시간 트래픽은 CSMA/CA 프로토콜 기반의 DCF(Distributed Coordination function)에 의해 처리된다. 그래서 실시간 트래픽은 지연과 패킷손실에 민감하고 비실시간 트래픽은 에러와 처리율에 민감하기 때문에 적당한 트래픽 스케줄링 알고리즘이 설계되어질 필요가 있다. 하지만 IEEE 802.11 무선랜 표준은 실시간 트래픽을 효율적으로 서비스를 해주지 못하고 있다. 그래서 본 논문에서는 PCF 구간내에서 서비스를 받지 못한 실시간 트래픽 스테이션들을 DCF 구간에서 우선적으로 서비스함으로써 QoS를 향상시킬 수 있다.

  • PDF

Performance Analysis for variation of Minimum Contetion Window at IEEE 802.11 WLAN (IEEE 802.11 WLAN에서 최소 경쟁 윈도우 변화에 따른 성능 분석)

  • Chung, Yun-Sick;Pyo, Ji-Hun;Lim, Seog-Ku
    • 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)의 값이 성능에 어떠한 영향을 미치는가를 시뮬레이션을 이용하여 분석한다.

  • PDF

An Adaptive MAC Protocol for Wireless LANs

  • Jamali, Amin;Hemami, Seyed Mostafa Safavi;Berenjkoub, Mehdi;Saidi, Hossein
    • Journal of Communications and Networks
    • /
    • v.16 no.3
    • /
    • pp.311-321
    • /
    • 2014
  • This paper focuses on contention-based medium access control (MAC) protocols used in wireless local area networks. We propose a novel MAC protocol called adaptive backoff tuning MAC (ABTMAC) based on IEEE 802.11 distributed coordination function (DCF). In our proposed MAC protocol, we utilize a fixed transmission attempt rate and each node dynamically adjusts its backoff window size considering the current network status. We determined the appropriate transmission attempt rate for both cases where the request-to-send/clear-to-send mechanism was and was not employed. Robustness against performance degradation caused by the difference between desired and actual values of the attempt rate parameter is considered when setting it. The performance of the protocol is evaluated analytically and through simulations. These results indicate that a wireless network utilizing ABTMAC performs better than one using IEEE 802.11 DCF.

Analysis of Throughput and Delay for variation of Minimum Contention Window in IEEE 802.11 (변화에 따른 수율 및 지연시간 분석)

  • Lim, Seog-Ku
    • 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 방식에서 최소 경쟁 윈도우의 값이 포화수율 및 패킷지연에 미치는 영향을 시뮬레이션에 의해 분석한다.

  • PDF

Adaptive MAC Scheduling Scheme using Partial Queue Length Information in IEEE Wireless LAN (IEEE 무선랜에서 부분적인 큐 정보를 이용한 적응적인 MAC 스케쥴링 기법)

  • Shin Soo-Young;Jang Yeong Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.974-979
    • /
    • 2004
  • In the IEEE 802.1 Ib, DCF provides contention based services and PCF provides contention free services for QoS suppof. DCF uses CSMA/CA (Carrier Sense Multiple Access/collision Avoidance) as an access protocol. In this paper, an enhanced PCF, which gives weights to channels with heavy traffic load, was proposed. The weight is depending on the partial queue length information from STAs. NS-2 simulation results show that the proposed scheme is an promising approach for enhancing the PCF.