• Title/Summary/Keyword: Distributed coordination function (DCF)

Search Result 81, Processing Time 0.03 seconds

Interclass Collision Protection (ICP) Model for IEEE 802.11e Wireless LANs (WLANs)

  • Lee, Chae-Y.;Cho, Woon-Sun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.307-311
    • /
    • 2006
  • Distributed Coordination Function (DCF) in IEEE 802.11 and Enhanced Distributed Channel Access (EDCA) in IEEE 802.11e are contention-based access mechanism in Wireless LAN. Both DCF and EDCA reduce collisions based on inter-frame space (IFS) and backoff mechanisms. However, collisions are unavoidable even with the two mechanisms. Especially, in the EDCA model, the collision can be classified into interclass and intraclass collision. To eliminate interclass collision in Wireless LAN, we propose an interclass collision protection (ICP) scheme by employing contention protection period (CPP) after backoff, Analysis is performed for one dimensional EDCA model and for the proposed ICP based EDCA model.

  • PDF

The Modified Backoff Algorithm to reduce the number of collisions in the IEEE 802.11 Networks

  • Nam, Jae-Hyun
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.228-232
    • /
    • 2008
  • In recent years, wireless ad hoc networks have become increasingly popular in both military and civilian applications due to their capability of building networks without the need for a pre-existing infrastructure. Recently, IEEE 802.11 Task Group e has been working on a new mechanism, the Enhanced Distributed Coordination Function (EDCF), to enhance the performance of 802.11 DCF. However, EDCF only reduces the internal collisions within a station, and external collisions between stations remain high in ad-hoc networks. In this paper, we propose to adopt an adaptive backoff window control technique, based on a dynamic value of the initial value of the range in which the backoff is chosen, so the backoff timer is randomly chosen in the range (InitRng, CW-1). We use ns-2 simulation to evaluate the throughput of our scheme. Results show that the throughput is improved for our scheme compared to the original DCF due to the reduced the number of collisions.

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.

A New Backoff algorithm considering Hop Count for the IEEE 802.11 Distributed Coordination Function

  • Nam, Jae-Hyun
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.3
    • /
    • pp.205-208
    • /
    • 2007
  • The IEEE 802.11 is a MAC protocol which has been standardized by IEEE for Wireless Local Area Networks (WLANs). In the IEEE 802.11 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. However, the BEB scheme suffers from a fairness problem; some nodes can achieve significantly larger throughput than others. This paper proposes a new backoff algorithm for the IEEE 802.11 DCF scheme. This algorithm uses the hop count for considering fairness. It causes flows with high hop count to generate short backoff interval than those with low hop count, thus getting high priority. Therefore, when a collision occurs, the modified IEEE 802.11 DCF assigns higher priority to flow to be close to a destination.

Design of Link Cost Metric for IEEE 802.11-based Mesh Routing (IEEE 802.11 MAC 특성을 고려한 무선 메쉬 네트워크용 링크 품질 인자 개발)

  • Lee, Ok-Hwan;Kim, Seong-Kwan;Choi, Sung-Hyun;Lee, Sung-Ju
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.5
    • /
    • pp.456-469
    • /
    • 2009
  • We develop a new wireless link quality metric, ECOT(Estimated Channel Occupancy Time) that enables a high throughput route setup in wireless mesh networks. The key feature of ECOT is to be applicable to diverse mesh network environments where IEEE 802.11 MAC (Medium Access Control) variants are used. We take into account the exact operational features of 802.11 MAC protocols, such as 802.11 DCF(Distributed Coordination Function), 802.11e EDCA(Enhanced Distributed Channel Access) with BACK (Block Acknowledgement), and 802.11n A-MPDU(Aggregate MAC Protocol Data Unit), and derive the integrated link metric based on which a high throughput end-to-end path is established. Through extensive simulation in random-topology settings, we evaluate the performance of proposed link metric and present that ECOT shows 8.5 to 354.4% throughput gain over existing link metrics.

Efficiency of Transmission Method for RFID Logistics Information by Data Aggregation in IEEE 802.11 Wireless LANs (IEEE 802.11 무선랜 시스템에서 데이터 Aggregation을 통한 RFID 물류정보 전송방법의 효율성 분석)

  • Choi, Woo-Yong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.35 no.1
    • /
    • pp.119-128
    • /
    • 2009
  • In this paper, we analyze the effect of the data aggregation level on the MAC performance when RFID (Radio Frequency Identification) logistics data, which can be aggregated at RFID readers to reduce the transmission overhead, are transmitted in IEEE 802.11 wireless LANs. For various data aggregation levels, the throughputs and latencies of the DCF (Distributed Coordination Function) and PCF (Point Coordination Function) MAC protocols are analyzed by computer simulation. From the simulation analysis, we propose the appropriate input traffic load for real-time RFID logistics data transmitted in IEEE 802.11 wireless LANs.

Medium Access Control Protocol for Ad Hoc Networks Using Dynamic Contention Window (동적 경쟁윈도우를 이용한 Ad Hoc 망에서의 Medium Access Control 프로토콜)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.4
    • /
    • pp.35-42
    • /
    • 2008
  • Since Bianchi's 2-D Markov Chain Model considers collision problem only in ideal channel condition, it does not reflect real channel impaired by fading, interference, and noise. Distributed Coordination Function(DCF) doubles its contention window(CW) when transmission fails regardless of collision or transmission error. Increase of CW caused by transmission error degrade throughput and increase the delay. In this paper, we present quantitative analysis of the impact of the parameters such as contention window size(CW), transmission probability for a given time slot(${\Im}$), transmission failure probability($p_f$), on the system performance and provide a method how to decrease the initial CW to achieve equivalent performance.

  • PDF

Dynamic Allocation of ATIM Window Size using Kalman Filter in IEEE 802.11 DCF (IEEE 802.11 DCF 에서 칼만 필터를 통한 ATIM 창 크기의 동적 할당 기법)

  • Lee, Jangsu;Yoo, Seunghwan;Kim, Seungwook;Kim, Sungchun
    • 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%로 나타났다.

DAPSM algorithm that improve Power Save Mechanism in 802.11 Ad­-Hoc Networks (802.11 Ad­-Hoc 네트웍에서 Power Save Mechanism을 개선한 DAPSM 알고리즘)

  • 박재현;김성천
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.109-111
    • /
    • 2003
  • 최근 무선 네트워킹 장치들이 등장 하면서 제한된 배터리에 의존하는 무선 호스트들의 전력 절감은 중요한 이슈가 되었다. 특히 Ad­Hoc에서 배터리는 제한된 에너지를 제공하기 때문에 무선 호스트에 의해서 소모되어지는 에너지의 양을 감소시키기 위한 기술은 대단히 중요하다. 특히 MAC 과 라우팅 에서 전력 절감을 이루기 위한 논문들이 기존에 발표 되었다. 이 논문에서는 IEEE 802.11 표준의 DCF (Distributed Coordination Function) 에서의 전력 절감 메카니즘을 향상 시킨 논문 이다. DCF를 위한 IEEE 802.11 전력 절감 메카니즘에서는 비콘 간격 이라는 시간으로 나누어지며 또한 이러한 각각의 비콘 간격이 시작될 때 각각의 노드들은 ATIM 창 동안 깨어 있어야 한다. 물론 모든 노드는 같은 시간에 깨어 있기 위해서는 동기화 되는 것이 필요하다. ATIM 창 동안 노드들은 비콘 기간 동안 깨어 있는 상태로 있을 것인지를 결정하기 위해서 control packet을 교환 한다. 이러한 ATIM 창 크기는 각각의 노드들의 전력절감에 상당한 영향을 미친다. 따라서 이 논문은 ATIM 창 크기를 동적으로 증감시켜서 보다 에너지 효율을 발휘 하고자 하는 논문이다.

  • PDF

Performance Analysis of Backoff Algorithm in Wireless LANs with Prioritized Messages (무선랜 환경에서 우선순위를 고려한 백오프 알고리듬 성능분석)

  • Jeong Seok-Yun;Heo Seon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1656-1660
    • /
    • 2006
  • Distributed coordination function(DCF) is the primary random access mechanism of IEEE 802.11, which is the basic protocol of wireless LAN based on the CSMA/CA protocol. It enables fast installation with minimal management and maintenance costs and is a very robust protocol for the best effort service in wireless medium. The current DCF, however, is known to be unsuitable for real-time applications such as voice message transmission. In this paper, we focus on the performance issues of IEEE 802.11 which accommodate the prioritized messages. Existing results use the initial window size and backoff window-increasing factor as tools to handle the priority of the messages. Instead, we introduce a novel scheme which chooses the backoff timer with arbitrary probabilities. By this, one can greatly reduce the backoff delay of the lower priority messages without degrading the performance of higher priority.

  • PDF