• 제목/요약/키워드: contention

Search Result 508, Processing Time 0.021 seconds

Extended PCF(EPCF) Mechanism for Wireless LAN MAC (Wireless LAN MAC을 위한 Extended PCF(EPCF) 방법)

  • Lee, Ho-Seok;Suh, Byung-Suhl
    • Proceedings of the KIEE Conference
    • /
    • 2002.11c
    • /
    • pp.31-34
    • /
    • 2002
  • There are two kinds of network architectures in the IEEE 802.11:[1] distributed (ad-hoc) or centralized (infrastructure) wireless network. Centralized networks have an access point (base station) that can control the wireless medium access of stations in these networks. The 802.11 MAC protocol of an access point is the same as those of other stations in the contention period. This paper propose a novel MAC protocol of an access point to solve these problems. This MAC protocol adds a new contention-free period called EPCF (Extended PCF) to resolve accumulated data in the queue of an access point. Simulation results show that the new protocol performs better throughput than the 802.11 standard MAC with the less queue memory site requirement.

  • PDF

Comparition Analysis on Average Drop Time in IEEE 802.11 DCF (IEEE 802.11 DCF에서 평균폐기시간 비교분석)

  • Lim, Seog-Ku
    • Proceedings of the KAIS Fall Conference
    • /
    • 2008.11a
    • /
    • pp.301-303
    • /
    • 2008
  • CSMA/CA를 기반으로 하는 IEEE 802.11 무선랜의 MAC에서는 데이터 전송을 제어하기 위한 방법으로 DCF와 PCF를 사용한다. IEEE 802.11 무선랜의 기본적인 액세스 방법으로 사용하는 DCF에서는 스테이션간의 충돌을 줄이기 위해서 임의의 백오프 시간을 각 스테이션의 경쟁윈도우(Contention Window) 범위에서 결정한다. 스테이션은 패킷 전송 후 충돌이 발생하면, 윈도우 크기를 두 배로 증가시키며, 패킷을 성공적으로 전송하면 윈도우 크기를 최소 경쟁 윈도우(Minimum Contention Window)로 감소한다. DCF는 경쟁 스테이션이 적은 상황에서는 비교적 우수한 성능을 보이나 경쟁 스테이션의 수가 많은 경우 처리율, 패킷지연 관점에서 성능이 저하되는 문제점이 있다. 본 논문에서는 IEEE 802.11 MAC 계층 DCF 방식에서의 평균폐기시간에 여러 연구결과들을 비교분석한다.

  • PDF

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.

Design and Performance Analysis of a Contention-Based Reservation Protocol for a Local Area Optical Internet

  • Choi, Jin-Seek;Lee, Jang-Won;Kang, Min-Ho
    • ETRI Journal
    • /
    • v.24 no.2
    • /
    • pp.142-152
    • /
    • 2002
  • In this paper, we propose and analyze a new multiple access protocol for a local area optical Internet based on a wavelength division multiplexing technique which uses a passive star coupler. The proposed contention-based reservation protocol can support variable-length as well as fixed-length messages for transporting Internet packets with one reservation of a minislot at the beginning of a packet transmission. The minislot is used to reserve the data channel on the basis of the slotted ALOHA protocol and the control node ensures subsequent message transmission on the same wavelength. Thus, all messages need not be broken down to many fixed-length packets, and consecutive messages are transmitted through the same wavelength. Moreover, the proposed protocol reduces the collision probability of minislots and improves wavelength utilization. We determine the maximum throughput and verify the results with simulation.

  • PDF

Traffic-Adaptive PCF MAC Scheduling Scheme Based on IEEE 802.11b Wireless LAN (IEEE 802.11b 무선랜에서 트래픽 부하에 따른 적응적인 PCF MAC 스케줄링 기법)

  • 신수영;장영민;강신각
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.191-194
    • /
    • 2003
  • In IEEE 802.11b, Medium Access Control Sublayer consists of DCF (Distributed Coordination Function) and PCF (Point Coordination Function). DCF provides contention based services and PCF provides contention free services for QoS satisfaction. DCF uses CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) as an access protocol. And PCF uses Polling Scheme. In this paper, a modified New-PCF, which gives weights to channels with heavier traffic load, was suggested. NS-2 simulations were conducted to compare the service performances with original DCF, PCF and the modified New-PCF respectively. Simulation results has shown the increased overall throughput with the proposed New-PCF compared with other cases.

  • PDF

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.

Configuration System Implementation Algorithm to Manage the I/O Device of the Parallel Processing Programmable Logic Controller (병렬 처리 기법을 이용한 프로그래머블 로직 컨트롤러의 입출력 접점 관리를 위한 컨피규레이션 시스템 구현 알고리즘)

  • Kim, Kwang-Jin;Kwon, Wook-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 1998.07g
    • /
    • pp.2327-2329
    • /
    • 1998
  • In this paper, an algorithm to make a configuration system for managing the I/O device of programmable logic controller(PLC) is proposed. Parallel processing architecture is used to deal with a number of I/O devices. From that architecture, a contention problem between processors can arise. To resolve this problem, the configuration system that contains informations about I/O devices is introduced. This configuration system is used to check the contention between processors in the I/O device and also used in program execution.

  • PDF

An Energy Efficient MAC Protocol Providing Guaranteed Service for Wireless Sensor Network

  • Kim, Dong-Won;Park, Tae-Geon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.1
    • /
    • pp.123-140
    • /
    • 2011
  • In this paper, we propose an Energy Efficient Media Access Control (EE-MAC) protocol for wireless sensor networks. The proposed scheme is designed to save power consumption and guarantee quality-of-service for real-time traffic. EE-MAC uses the superframe structure which is bounded by the transmission of a beacon frame and can have an active and an inactive portion. The active period is divided into the contention free period (CFP) for real-time traffic transmission and the contention access period (CAP) for non-real-time traffic transmission. We propose the exclusively allocated backoff scheme which assigns a unique backoff time value to each real-time node based on bandwidth allocation and admission control. This scheme can avoid collision between real-time nodes by controlling distributed fashion and take effect a statistical time division multiple access. We also propose the algorithm to change the duty cycle adaptively according to channel utilization of media depending on network traffic load. This algorithm can prolong network lifetime by reducing the amount of energy wasted on idle listening.

High speed wide fan-in designs using clock controlled dual keeper domino logic circuits

  • Angeline, A. Anita;Bhaaskaran, V.S. Kanchana
    • ETRI Journal
    • /
    • v.41 no.3
    • /
    • pp.383-395
    • /
    • 2019
  • Clock Controlled Dual keeper Domino logic structures (CCDD_1 and CCDD_2) for achieving a high-speed performance with low power consumption and a good noise margin are proposed in this paper. The keeper control circuit comprises an additional PMOS keeper transistor controlled by the clock and foot node voltage. This control mechanism offers abrupt conditional control of the keeper circuit and reduces the contention current, leading to high-speed performance. The keeper transistor arrangement also reduces the loop gain associated with the feedback circuitry. Hence, the circuits offer less delay variability. The design and simulation of various wide fan-in designs using 180 nm CMOS technology validates the proposed CCDD_1 and CCDD_2 designs, offering an increased speed performance of 7.2% and 8.5%, respectively, over a conventional domino logic structure. The noise gain margin analysis proves good robustness of the CCDD structures when compared with a conventional domino logic circuit configuration. A Monte Carlo simulation for 2,000 runs under statistical process variations demonstrates that the proposed CCDD circuits offer a significantly reduced delay variability factor.