• Title/Summary/Keyword: TXOP

Search Result 19, Processing Time 0.029 seconds

A TXOP Sharing Scheme for QoS Strategy of IEEE 802.11ac DL MU-MIMO MAC (IEEE 802.11ac DL MU-MIMO MAC의 QoS 정책을 고려한 TXOP 공유 방안)

  • Lee, Ji-Young;Seok, Seung-Joon
    • Journal of Digital Convergence
    • /
    • v.12 no.10
    • /
    • pp.317-327
    • /
    • 2014
  • To improve the efficiency of wireless channel, IEEE 802.11ac uses the DL MU-MIMO MAC scheme through which an AP transmits multiple frames to different mobile nodes simultaneously. IEEE 802.11ac DL MU-MIMO MAC needs a new step, called as TXOP sharing, between legacy IEEE 802.11n DL SU-MIMO's two operations, the obtaining an EDCA TXOP and the transmitting multiple frames for EDCA TXOP. In the TXOP sharing operation, both wireless channel destinations and frames transmitted for its TXOP period should are determined. So this paper deals with the TXOP sharing for improving IEEE 802.11ac MAC performance. However, the EDCA priority based method mentioned by IEEE 802.11ac standard document not fair among the buffers and the frames of buffers, and occurs in high_loss rate and high_delay about specific buffers. In this paper, we propose a new scheme of the TXOP sharing with sequencing p-AC, s-AC in similar properties, and all S-AC. This method provides a differentiated service without damage of EDCA characteristics.

A Dynamic TXOP Allocation Scheme for Providing QoS in IEEE 802.11e based Wireless Ad-hoc Networks (IEEE 802.11e 무선 애드혹 네트워크에서 QoS 지원을 위한 동적 TXOP 할당 기법)

  • Ju, Kwang-Sung;Chung, Kwang-Sue
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06a
    • /
    • pp.373-376
    • /
    • 2011
  • 무선 멀티 홉 네트워크는 채널 상태의 불안정으로 인해 전송 지연, 패킷 손실 등의 발생이 빈번하며 홉 수가 증가할수록 이와 같은 품질 저하는 더욱 심각해진다. 무선 멀티 홉 네트워크에서 QoS를 보장하기 위해 IEEE 802.11e에서는 우선순위가 높은 노드에게 정해진 시간 동안 연속해서 보낼 수 있도록 TXOP(Transmission Opportunity) 파라미터 값을 정해놓고 있다. 하지만 IEEE 802.11e는 단일 홉 네트워크를 가정하여 설계되었기 때문에 멀티 홉 무선 환경에서 홉 수의 증가에 따른 지연 및 손실 증가를 고려하지 않는다. 본 논문에서는 멀티 홉 환경에서의 QoS 지원을 위한 DTA (Dynamic TXOP Allocation) 메커니즘을 제안하였다. DTA 메커니즘은 네트워크 상황을 고려한 동적 TXOP 할당 기법으로, 각 노드의 전송 큐 상태와 종단간 전송 지연 비율을 판별하여 이에 따른 QoS 지원을 위한 동적 TXOP를 할당한다. 이를 통해 불안정한 채널 상태 및 멀티 홉 환경에서 홉 수 증가에 따른 성능 감소를 개선할 수 있었다.

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.

Traffic-Aware TXOP adjusting Algorithm for IEEE 802.11e Network (IEEE 802.11e에서 전송흐름을 고려한 TXOP 조정 알고리듬)

  • Joung, Soo-Kyoung;Kim, Nam-Il
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.1
    • /
    • pp.33-43
    • /
    • 2011
  • This paper proposes a traffic-aware TXOP adjustment algorithm for the IEEE 802.11e networks. In the proposed algorithm the access point (AP) monitors the network traffics periodically and adjusts the TXOP value of the non-QoS traffic in order to improve the network throughput while maintaining the QoS of video and voice applications. The experimental results show that the proposed algorithm outperforms the legacy IEEE 802.11e in terms of the throughput and the fairness.

Efficient Delivery of Multimedia Traffic Using Muti-rate Transmission of 802.11e HCCA MAC Protocol (IEEE 802.11e HCCA MAC의 다중 전송률을 이용한 멀티미디어 트래픽의 효율적 전송)

  • Kim, Young-Hwan;Suk, Jung-Bong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4B
    • /
    • pp.192-198
    • /
    • 2008
  • In this paper, we propose a scheme that improves the transmission performance of realtime multimedia data in wireless Local Area Network (LAN) environment, through the dynamical control of Transmission Opportunity (TXOP) period of the IEEE 802.11e HCCA Medium Access Control (MAC). The existing schedulers which determine the frame transmission time and its duration could not appropriately cope with the change of physical transmission rate, since the TXOP period has remained unchanged with the change of transmission rate of the wireless station. Our scheme is devised to keep the transmission performance of real-time multimedia data effectively unchanged by making TXOP period be extended when the transmission rate gets reduced. The proposed scheme is experimented along with IEEE 802.11e reference model using NCTUns simulator, which shows that the multimedia data is effectively delivered with the change of transmission rate as the distance between the wireless station and its access point increases.

Priority Polling and Dual Token Bucket based HCCA Algorithm for IEEE 802.11e WLAN (IEEE 802.11e WLAN을 위한 우선순위 폴링 및 이중 토큰 버킷 기반의 HCCA 알고리즘)

  • Lee, Dong-Yul;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.31-41
    • /
    • 2009
  • IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.

Improved MSI Based Scheduling and Admission Control Algorithm for IEEE 802.l1e Wireless LAN (IEEE 802.l1e 무선랜에서 MSI를 이용한 개선된 스케줄링 및 수락제어 알고리즘)

  • Yang, Geun-Hyuk;Ok, Chi-Young;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.99-109
    • /
    • 2007
  • IEEE 802.lie is being proposed to improve QoS by IEEE 802.11 working group. HCCA (HCF Controlled Channel Access) a centralized polling based mechanism of IEEE 802.11e, needs a scheduling algorithm that decides on how the available radio resources are allocated to the polled STAs. In IEEE 802.l1e standard Reference Scheduler is presented. Reference Scheduler Polls all STAs in a polling list by the same interval that causes ineffectively frequent polling. It increases not only the overhead but it decreases the TXOP (Transmission Opportunity) utilization. In this paper, we propose the scheduling and admission control algorithm that poll stations depending on the MSI (Maximum Service Interval)o( stations to solve these shortcomings. In our proposed algorithm a station is polled by an interval close to its MSI, so polling overhead decrease and TXOP utilization increases than Reference Scheduler. Simulation results show that our algorithm outperforms Reference Scheduler. Our algorithm maintains higher aggregate throughput and services mere stations than Reference Scheduler.

Dynamic Allocation of TXOP Duration in IEEE 802.11e HCCA by Modulation Speed Changing (모듈레이션 속도 변화에 따른 IEEE 802.11e HCCA에서의 TXOP Duration의 동적 할당)

  • Kim Young-Hwan;Suk Jung-Bong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06d
    • /
    • pp.340-342
    • /
    • 2006
  • 본 논문의 연구에서는 IEEE 802.11e HCCA에서 멀티미디어와 같은 트래픽에 대해 보다 안정적인 전송을 위하여 일정 시간 동안 채널을 사용할 수 있도록 HC (Hyper Coordinator)가 허가함에 있어서 IEEE 802.11 PHY (physical layer)의 모듈레이션 변화에 따른 동적인 대응이 필요함을 논하고, 문제 해결을 위한 방안을 제시하였다. IEEE 802.11e의 HC는 멀티미디어와 같은 트래픽의 전송을 위하여 BSS (Basic Service Set) 안에 있는 무선 단말기와 TSPEC (Traffic Specification)을 이용하여 CAP (Controlled Access Phase) 채널을 설정하고 관리한다. 그러나 HC가 TSPEC을 설정할 당시와는 달리 무선 단말기들은 이동하거나 물리적으로 채널 환경의 변화로 IEEE 802.11 PHY의 모듈레이터 변경으로 설정된 TXOP 듀레이션 (duration)이 적절하지 않게 된다. 이와 같은 문제점을 밝히고 해결 방안을 아래와 같이 제안한다. 실험을 위해서는 NS-2와 유사하지만 보다 세련된 시뮬레이터를 활용하였다.

  • PDF

Dual Token Bucket based HCCA Scheduler for IEEE 802.11e (IEEE 802.11e WLAN 위한 이중 리키 버킷 기반 HCCA 스케줄러)

  • Lee, Dong-Yul;Lee, Chae-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1178-1190
    • /
    • 2009
  • IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To efficiently assign resource for VBR traffic, in this paper, we propose TXOP algorithm based on dual leaky bucket using average resource allocation and peak resource allocation. The minimum TXOP of each station is obtained by using statistical approach to maximize number of stations of which performance satisfy QoS target. Simulation results show that the proposed algorithm has much higher performance compared with reference scheduler in terms of throughput and delay.