• Title/Summary/Keyword: Contention Window control

Search Result 49, Processing Time 0.031 seconds

An Adaptive Delay Control based on the Transmission Urgency of the Packets in the Wireless Networks (무선망에서 패킷의 전송 긴급성을 고려한 적응적 지연 제어 방안)

  • Jeong, Dae-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1A
    • /
    • pp.44-53
    • /
    • 2010
  • This paper proposes a traffic management policy for delay control in the wireless networks. The so-called EDD(Earliest Due Date) scheme is adopted as the packet scheduling policy, so that the service provision is performed in the order of the transmission urgency of the backlogged packets. In addition, we derive a formula to determine the contention window, one of the MAC parameters, with the goal of minimizing the non-work conserving characteristics of the traditional MAC scheme. This method eliminates the burden of the class-wise parameter settings which is typically required for the priority control. Simulations are performed to show the validity of the proposed scheme in comparison with the policy that adopts the class-level queue management such as the IEEE 802.11e standard. Smaller delays and higher rates of delay guarantees are observed throughout the experiments.

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.

A Same-Priority Collision-Avoidance Algorithm Using RTS/CTS Frame in IEEE 802.11e EDCA under Network Congested Condition (IEEE 802.11e EDCA 네트워크 혼잡 환경에서 RTS/CTS 프레임을 이용한 동일 우선순위 충돌 회피 알고리즘)

  • Kwon, YongHo;Rhee, Byung Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.5
    • /
    • pp.425-432
    • /
    • 2014
  • The Enhanced Distributed Channel Access (EDCA) function of IEEE 802.11e standard defines contention window (CW) for different Access Category (AC) limits to support Quality-of-Service (QoS). However, it have been remained the problem that the collision probability of transmission is increasing in congested network. Several different solutions have been proposed but the collision occurs among same priority queue within the same station to compete the channel access. This paper presents an APCA (Advanced Priority Collision Avoidance) algorithm for EDCA that increases the throughput in saturated situation. The proposed algorithm use reserved field's bits of FC(Frame Control) using IEEE 802.11e standard's RTS/CTS (Request to Send / Clear to Send) mechanism to avoid data collision. The simulation results show that the proposed algorithm improves the performance of EDCA in packet loss. Using Jain's fairness index formula, we also prove that the proposed APCA algorithm achieves the better fairness than EDCA method under network congested condition.

A Study on New DCF Algorithm in IEEE 802.11 WLAN by Simulation (시뮬레이션에 의한 IEEE 802.11 WLAN에서의 새로운 DCF 알고리즘에 관한 연구)

  • Lim, Seog-Ku
    • Journal of Digital Contents Society
    • /
    • v.9 no.1
    • /
    • pp.61-67
    • /
    • 2008
  • In this paper, MAC algorithm for the IEEE 802.11 DCF 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(Distributed Coordination Function) and PCF(Point Coordination Function). The DCF controls the transmission based on CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance), that decides a random backoff time with the range of CW(Contention Window) for each station. Normally, each station increase the CW to double after collision, and reduces the CW to the minimum after successful transmission. 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.

  • 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

Dynamic Contention Window based Congestion Control and Fair Event Detection in Wireless Sensor Network

  • Mamun-Or-Rashid, Md.;Hong, Choong-Seon
    • Annual Conference of KIPS
    • /
    • 2007.05a
    • /
    • pp.1288-1290
    • /
    • 2007
  • Congestion in WSN increases energy dissipation rates of sensor nodes as well as loss of packets and thereby hinders fair and reliable event detections. We find that one of the key reasons of congestion in WSN is allowing sensing nodes to transfer as many packets as possible. This is due to the use of CSMA/CA that gives opportunistic media access control. In this paper, we propose an energy efficient congestion avoidance protocol that includes source count based hierarchical and load adaptive medium access control. Our proposed mechanism ensures load adaptive media access to the nodes and thus achieves fairness in event detection. The results of simulation show our scheme exhibits more than 90% delivery ratio with retry limit 1, even under bursty traffic condition which is good enough for reliable event perception.

A Packet Collision Avoidance Technique in IEEE1609.4 Based Time Synchronization Multi-channel Environment (IEEE1609.4 기반 시간 동기 멀티채널 환경에서의 패킷 충돌 회피 기법)

  • Jin, Seong-Keun;Lim, Ki-Taeg;Shin, Dae-Kyo;Yoon, Sang-Hun;Jung, Han-Gyun
    • Journal of IKEEE
    • /
    • v.19 no.3
    • /
    • pp.385-391
    • /
    • 2015
  • In this paper, we analyze the communication performance in a time synchronous multi-channel environment and deal with a packet collision avoidance technique to improve it based on IEEE1609.4 for increasing the efficiency of the control channel IEEE802.11p WAVE communication system. In previous works, they tried to solve this problem by message scheduling method on application layer software or changing the value of the random back-off optionally Contention Window. In this paper, we propose a method for adjusting the Channel Guard Interval for packet collision avoidance. The performance was evaluated by the actual vehicle test. The result was confirmed performance over 90% PDR(Packet Delivery Ratio).

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.

An Analysis for the Efficient Dissemination of Beacon Messages in Vehicle-to-Vehicle (V2V) Communications (자동차 간 통신에서 비컨 메시지의 효율적인 방송을 위한 성능 분석)

  • Nguyen, Hoa-Hung;Bhawiyuga, Adhitya;Jeong, Han-You
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6C
    • /
    • pp.483-491
    • /
    • 2012
  • In vehicle-to-vehicle (V2V) communications, each vehicle should periodically disseminate a beacon message including the kinematics information, such as position, speed, steering, etc., so that a neighbor vehicle can better perceive and predict the movement of the vehicle. However, a simple broadcasting of such messages may lead to a low reception probability as well as an excessive delay. In this paper, we attempt to analyze the impact of the following key parameters of the beacon dissemination on the performance of vehicular networks: beacon period, carrier-sensing range, and contention window (CW) size. We first derive a beacon period which is inversely proportional to the vehicle speed. Next, we mathematically formulate the maximum beacon load to demonstrate the necessity of the transmit power control. We finally present an approximate closed-form solution of the optimal CW size that leads to the maximum throughput of beacon messages in vehicular networks.

Study of Optimum Parameters for Improving QoS in Wireless LAN (무선랜 QoS의 성능향상을 위한 최적 파라미터에 관한 연구)

  • Jin, Hyunjoon
    • Journal of IKEEE
    • /
    • v.17 no.2
    • /
    • pp.96-103
    • /
    • 2013
  • Since multimedia data takes large part of realtime transmission in wireless communication environments such as IEEE 802.11, QoS issues became one of the important problems with network performance. 802.11e MAC provides differentiated services based on priority schemes to solve existing 802.11 MAC problems. The TXOP is an important factor with the priority to improve network performance and QoS because it defines the time duration in which multiple frames can be transferred at one time for each station. In this paper, therefore frame sizes, TXOP Limit, and Priority values in accordance with the number of stations are experimented and derived for best network performance and QoS. Using 802.11e standard parameters, simulation results show the best throughput when the number of stations is 5 and TXOP Limit value is 6.016ms. For fairness, the best result is achieved at 3.008ms of TXOP Limit value and 15-31 of CW(Contention Window) that is lower priority than CW 7-15.