• Title/Summary/Keyword: Uplink Scheduler

Search Result 24, Processing Time 0.026 seconds

Uplink Scheduler Architecture of the SS in the IEEE 802.16 (IEEE 802.16 SS에서의 Uplink Scheduler 구조 제안)

  • Lee Seon-Don;Kim Woo-Jae;Suh Young-Joo;Park Yun-Sang
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.391-393
    • /
    • 2005
  • IEEE 802.16은 BWA (Broadband Wireless Access) 시스템의 표준으로 현재 많은 연구와 함께 상용 제품에 대한 연구가 진행중인 분야이다. IEEE 802.16에서는 QoS를 제공하기 위하여 BS (Base Station)와 SS(Subscriber Station)간의 QoS 협상 과정을 정의하고 있으며, BS 및 SS에서의 효율적인 QoS 보장을 위해 4가지의 서비스 클래스를 정의하고 있다. 이러한 서비스 클래스는 UGS, rtPS, nrtPS, 그리고 BE 이다. 하지만 표준에서는 이러한 서비스 클래스를 어떻게 이용할 것인지에 대한 언급이 없으며, 이에 따라 효율적인 packet scheduling에 관한 많은 연구가 진행되어 왔다. 기존의 연구에서는 주로 BS에서의 효율적인 Scheduling에 초점을 맞추어 연구가 진행되었으며, SS에서의 Scheduling에 대한 연구는 거의 되어 있지 않다. 하지만 BS에서 SS에게 대역폭을 할당할 때 GPSS (Grants per subscriber station) mode로 대역폭을 할당한다면 SS에서는 할당 받은 대역폭을 효율적으로 사용하기 위하여 scheduling이 필요하다. 본 논문에서는 SS에서의 scheduling architecture를 제안하고자 한다. 제안하는 scheduling architecture는 기존의 scheduling algorithm과는 달리 각 서비스 클래스에 대해서 효과적인 scheduling이 가능하도록 함으로써 시스템의 성능을 높이는데 기여할 것이다.

  • PDF

A Medium Access Control Protocol for rt- VBR Traffic in Wireless ATM Networks

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.1
    • /
    • pp.29-34
    • /
    • 2007
  • This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

Contention-based Reservation MAC Protocol for Burst Traffic in Wireless Packet Networks

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.2
    • /
    • pp.93-97
    • /
    • 2007
  • In this paper, centralized access control and slot allocation algorithm is proposed for wireless networks. The proposed algorithm is characterized by the contention-based reservation. In order to reduce the collision probability of reservation request, the base station calculates and broadcasts the transmission probability of reservation requests, and the wireless terminal transmits its reservation request with the received transmission probability. The scheduler allocates the uplink data slots based on the successful reservation requests. Simulation results show that the proposed algorithms can provide high channel utilization, and furthermore, maintains constant delay performance in the heavy traffic environment.

A Scheduling Algorithm for Real-Time Traffic in IEEE802.11e HCCA (IEEE 802.11e HCCA 기반의 실시간 트래픽을 위한 스케줄링 알고리즘)

  • Joung, Ji-Noo;Kim, Jong-Jo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.1
    • /
    • pp.1-9
    • /
    • 2010
  • In this paper we propose a scheduling algorithm for supporting Quality of Service(QoS) in IEEE 802.11e HCCA referred to as ASR-DRR and ASD-DRR, which aims at providing improved performance for the support of multimedia traffic. Although We identify the problem of the current IEEE 802.11e HCCA (Hybrid Coordination Function Controlled Channel Access) scheduler and its numerous variations, that the queue information cannot be notified to the Hybrid Coordinator (HC) timely, therefore the uplink delay lengthens unnecessarily. We suggests a simple solution and a couple of implementation practices, namely the Adaptive Scheduler with RTS/CTS (ASR) and Adaptive Scheduler with Data/Ack (ASD). They are both further elaborated to emulate the Deficit Round Robin (DRR) scheduler. They are also compared with existing exemplary schedulers through simulation, and shown to perform well.

Traffic Congestion Control Using PQS in Wireless Multimedia Sensor Networks (무선 멀티미디어 센서 네트워크에서 PQS를 이용한 트래픽 혼잡제어)

  • Lee, Chong-Deuk
    • Journal of Advanced Navigation Technology
    • /
    • v.17 no.2
    • /
    • pp.218-224
    • /
    • 2013
  • Uplink overflow in WMSN (Wireless Multimedia Sensor Networks) aggravates the resource consumption, delay, and traffic congestion. This paper proposes a new traffic congestion control mechanism using popularity. The proposed mechanism controls congestions by dispersing the media traffic, and it control fairly packets according to priority. This paper proposes PQS (Packet Queue Scheduler) to control fairly packets, and the proposed mechanism provides a fair opportunity to all sensor nodes without a specific location. The simulation results show that the proposed mechanism achieves improved performance in throughput, delay ratio, link quality, and buffer queue control ratio compared with those of other existing methods.

A Novel Efficient Up-Link Scheduler for IEEE 802.16m (IEEE802.16m을 위한 효율적인 상향링크 스케줄러 연구)

  • Cho, Da-Young;Oh, Hyuk-Jun;Hong, Sung-Woong;Oh, Il-Hyuk;Ko, Kyung-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.11
    • /
    • pp.979-985
    • /
    • 2012
  • The design of an efficient scheduler is a key design factor in IEEE 802.16m systems, in order to support services with various QoS smoothly. Although conventional studies of schedules have been suggested, those had problems that are not able to satisfy the delay condition and make the through-put declined, because they only focused on a specific action scenario rather than reflecting practical action scenarios which have real-time and non-real-time traffics variously. In this paper, an efficient uplink scheduling algorithm is proposed for IEEE 802.16m system by introducing the concepts of Virtual Time(VT) and Virtual Finish Time(VFT) based priority determination, and separate buffers for each QoS class in the mobile terminal. Simulation results showed that the proposed scheme had satisfied the delay requirement of real-time services even with improved throughput performance compared to conventional methods.

A Design of Handoff-aware DiffServ Scheduler in TDD/CDMA Networks (TDD/CDMA망에서 핸드오프를 지원하는 DiffServ 스케줄러 설계)

  • Zang, Seog-Ku;Kim, Young-Han
    • The KIPS Transactions:PartC
    • /
    • v.14C no.6
    • /
    • pp.493-502
    • /
    • 2007
  • In this paper, we propose a handoff-aware DiffServ scheduler which intends to guarantee various QoS requirements of multimedia services for mobile nodes in TDD/CDMA based wireless networks. TDD is widely used duplexing mechanism in wireless communications. Unlike FDD, TDD allows a node to symmetrically communicate with a base station by using a single frequency band, resulting in high utilization of wireless resources. DiffServ is regarded as a relatively simple QoS support mechanism and thus it is easy to be extended. This is because DiffServ is not a per-flow based mechanisms and it does not require any signaling protocol. However, previously proposed DiffServ schedulers for wired networks can not be deployed directly into wireless networks since they do not consider properties of wireless networks. As a solution to the problem, DSS(DiffServ Supporting Scheduler) was proposed. DSS uses uplink channel, which is originally used for a node to require a base station to transmit packets, to support QoS efficiently. However, QoS does not consider handoff so that it can not support QoS for moving nodes from one cell to the other cell. Therefor. the proposed handoff support QoS mechanism is necessary for TCC/CDMA networks. The proposed scheme allows a mobile node to achieve seamless service without QoS degradation even for the handoff duration.

Radio resource allocation of TD-HSDPA based on position location of mobile terminals (TD-HSDPA에서 단말의 위치에 따른 무선자원 할당)

  • Yeo, Woon-Young;Kim, Seong-Keun
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.271-272
    • /
    • 2008
  • TD-SCDMA combines TDMA and CDMA components to provide more efficient use of radio resources, and includes a new feature called HSDPA (high-speed downlink packet access) in the R5 stage. The TD-HSDPA supports high-speed traffic with a shared channel, but its uplink mechanism causes feedback problem for scheduling. Since the base station of TD-SCDMA can estimate the location of mobile terminals precisely, it can also estimate the possible path loss. In this paper, the base station utilizes the estimated path loss for scheduling, which is related with CQI (channel quality indicator) values. The proposed mechanism can provide the TD-HSDPA scheduler with an intial CQI value for efficient transmission.

  • PDF

End-to-End QoS Enhancement in Mobile WiMAX Systems (모바일 와이맥스 시스템에서의 종단간 서비스 품질 향상)

  • Choo, Sang-Min;Oh, Sung-Min;Cho, Sung-Hyun;Kim, Jae-Hyun
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.5
    • /
    • pp.415-424
    • /
    • 2008
  • In this paper, we compare the QoS performance enhancement schemes according to the network architecture of mobile WiMAX system in order to improve the end-to-end QoS performance and propose QoS parameter mapping method and IP packet scheduling algorithm. To evaluate the end-to-end QoS performance, we implemented an end-to-end simulator of mobile WiMAX system using OPNET. Simulation results show that the proposed QoS parameter mapping scheme reduces the average delay of VoIP packet and improves uplink resource efficiency. And also, when the proposed IP packet scheduling algorithm is applied to the system, the end-to-end packet transmission delay of VoIP service can be reduced by 44-67 percent compared to FIFO and WRR scheduler.

Dynamic slot allocation scheme for rt-VBR services in the wireless ATM networks (무선 ATM망에서 rt-VBR 서비스를 위한 동적 슬롯 할당 기법)

  • Yang, Seong-Ryoung;Lim, In-Taek;Heo, Jeong-Seok
    • The KIPS Transactions:PartC
    • /
    • v.9C no.4
    • /
    • pp.543-550
    • /
    • 2002
  • This paper proposes the dynamic slot allocation method for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed method is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed method guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.