• Title/Summary/Keyword: downlink-first scheduling

Search Result 15, Processing Time 0.028 seconds

Downlink-First Scheduling of Real-Time Voice Traffic in IEEE 802.11 Wireless LANs (무선랜 시스템에서의 하향 우선 실시간 음성 트래픽 스케줄링)

  • Jeong, Dong W.;Lee, Chae Y.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.29 no.2
    • /
    • pp.150-156
    • /
    • 2003
  • The IEEE 802.11 MAC (Media Access Control) Protocol supports two modes of operation, a random access mode for nonreal-time data applications processed by Distributed Coordinated Function (DCF), and a polling mode for real-time applications served by Point Coordinated Function (PCF). It is known that the standard IEEE 802.11 is insufficient to serve real-time traffic. To provide Quality of Service (QoS) of real-time traffic, we propose the Downlink-first scheduling with Earliest Due Date (EDD) in Contention Free Period (CFP) with suitable admission control. The capacity and deadline violation probability of the proposed system is analyzed and compared to the standard pair system of downlink and uplink. Analytical and simulation results show that the proposed scheme is remarkably efficient in view of the deadline violation probability.

Scheduling with Heterogeneous QoS Provisioning for Indoor Visible-light Communication

  • Dong, Xiaoli;Chi, Xuefen;Sun, Hongliang;Zhu, Yuhong
    • Current Optics and Photonics
    • /
    • v.2 no.1
    • /
    • pp.39-46
    • /
    • 2018
  • Visible-light communication (VLC) combined with advanced illumination can be expected to become an integral part of next-generation communication networks. One of the major concerns in VLC implementation is developing resource-allocation schemes in a multi-user scenario. However, the scheduling for heterogeneous quality of service (QoS) traffic has not been studied so far, for the indoor VLC downlink system. In this paper, we creatively introduce effective-bandwidth and effective-capacity theory into the multi-user scheduling (MUS) problem, to guarantee the user's statistical delay QoS. We also take account of the aggregate interference (AI) in the indoor VLC downlink system, and analyze its impact on the user-centric MUS problem for the first time. Simulations show that the AI has a nonnegligible influence on the scheduling result, and that the proposed scheduling scheme could guarantee the user's QoS requirement under the premise of ensuring sum capacity.

Wireless Packet Scheduling Algorithm for OFDMA System Based on Time-Utility and Channel State

  • Ryu, Seung-Wan;Ryu, Byung-Han;Seo, Hyun-Hwa;Shin, Mu-Yong;Park, Sei-Kwon
    • ETRI Journal
    • /
    • v.27 no.6
    • /
    • pp.777-787
    • /
    • 2005
  • In this paper, we propose an urgency- and efficiency-based wireless packet scheduling (UEPS) algorithm that is able to schedule real-time (RT) and non-real-time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality-of-service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.

  • PDF

Scheduling Algorithms for Downlink Rate Allocation in Heterogeneous CDMA Networks

  • Varsou, Aikaterini C.;Poor, H. Vincent
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.199-208
    • /
    • 2002
  • The downlink rate scheduling problem is considered for CDMA networks with multiple users carrying packets of heterogeneous traffic (voice/audio only, bursty data only or mixed traffic), with each type having its own distinct quality of service requirements. Several rate scheduling algorithms are developed, the common factor of which is that part of the decision on which users to serve is based on a function of the deadline of their head-ofline packets. An approach of Andrews et al., in which the basic Earliest-Deadline-First algorithm is studied for similar systems, is extended to result in better performance by considering a more efficient power usage and by allowing service of more than one user per timeslot if the power resources permit it. Finally, the performance of the proposed schemes is compared through simulations.

Time Utility and Channel State based Wireless Downlink Packet Scheduling Algorithm for OFDMA System (OFDMA 무선 시스템에서의 시간-효용과 채널 상태 기반의 하향 링크 패킷 스케줄링)

  • Ryu, Seung-Wan;Seo, Hyun-Hwa;Chung, Soo-Jung;Lim, Soon-Yong;Park, Sei-Kwon
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.111-121
    • /
    • 2004
  • In this paper, we propose an urgency and efficiency based wireless packet scheduling (UEPS) algorithm that is able to schedule real time (RT) and non-real time (NRT) traffics at the same time. The proposed UEPS algorithm is designed to support wireless downlink packet scheduling in the OFDMA system which is a strong candidate wireless system for the next generation mobile communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average one as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics with satisfying QoS requirements of RT traffics. The simulation study shows that the proposed UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF) while satisfying QoS requirements of RT traffics such as the average delay and the packet loss rate under various traffic loads.

Scheduling of Real-time and Nonreal-time Traffics in IEEE 802.11 Wireless LAN (무선랜에서의 실시간 및 비실시간 트래픽 스케줄링)

  • Lee, Ju-Hee;Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.2
    • /
    • pp.75-89
    • /
    • 2003
  • Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

Efficient Channel State Feedback Scheme for Opportunistic Scheduling in OFDMA Systems by Scheduling Probability Prediction

  • Ko, Soomin;Lee, Jungsu;Lee, Byeong Gi;Park, Daeyoung
    • Journal of Communications and Networks
    • /
    • v.15 no.6
    • /
    • pp.589-600
    • /
    • 2013
  • In this paper, we propose a new feedback scheme called mode selection-based feedback by scheduling probability prediction (SPP-MF) for channel state feedback in OFDMA downlink system. We design the scheme such that it determines the more desirable feedback mode among selective feedback by scheduling probability prediction (SPP-SF) mode and bitmap feedback by scheduling probability prediction (SPP-BF) mode, by calculating and comparing the throughputs of the two modes. In both feedback modes, each user first calculates the scheduling probability of each subchannel (i.e., the probability that a user wins the scheduling competition for a subchannel) and then forms a feedback message based on the scheduling probability. Specifically, in the SPP-SF mode, each user reports the modulation and coding scheme (MCS) levels and indices of its best S subchannels in terms of the scheduling probability. In the SPP-BF mode, each user determines its scheduling probability threshold. Then, it forms a bitmap for the subchannels according to the scheduling probability threshold and sends the bitmap along with the threshold. Numerical results reveal that the proposed SPP-MF scheme achieves significant performance gain over the existing feedback schemes.

Effect of Cooperative and Selection Relaying Schemes on Multiuser Diversity in Downlink Cellular Systems with Relays

  • Kang, Min-Suk;Jung, Bang-Chul;Sung, Dan-Keun
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.175-185
    • /
    • 2008
  • In this paper, we investigate the effect of cooperative and selection relaying schemes on multiuser diversity in downlink cellular systems with fixed relay stations (RSs). Each mobile station (MS) is either directly connected to a base station (BS) and/or connected to a relay station. We first derive closed-form solutions or upper-bound of the ergodic and outage capacities of four different downlink data relaying schemes: A direct scheme, a relay scheme, a selection scheme, and a cooperative scheme. The selection scheme selects the best access link between the BS and an MS. For all schemes, the capacity of the BS-RS link is assumed to be always larger than that of RS-MS link. Half-duplex channel use and repetition based relaying schemes are assumed for relaying operations. We also analyze the system capacity in a multiuser diversity environment in which a maximum signal-to-noise ratio (SNR) scheduler is used at a base station. The result shows that the selection scheme outperforms the other three schemes in terms of link ergodic capacity, link outage capacity, and system ergodic capacity. Furthermore, our results show that cooperative and selection diversity techniques limit the performance gain that could have been achieved by the multiuser diversity technique.

A Wireless Downlink Packet Scheduling Algorithm for Multimedia Traffic (멀티미디어 트래픽에 대한 무선 환경에서의 순방향 패킷 스케줄링 알고리즘)

  • 김동회;류병한
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.12
    • /
    • pp.539-546
    • /
    • 2002
  • In this paper, we consider a wireless multimedia environment to service both real-time video traffic and non-real-time WWW-application traffic In our suggested new packet scheduling algorithm, we consider both the accumulation counter and SIR to reduce delay in real-time traffic. In addition, our packet scheduling algorithm gives priority first to real-time video traffic service and then to non-real-time internet Packet service when real-time traffic service is absent. From the simulation results, we find that the AC (Accumulation Counter) scheme has much smaller delay than the conversional M-LWDF scheme for real-time video data users, which has a special quality sensitive to its own delay. We also consider the transmission structure of using both the frame period in the time-axis and the OVSF codes in the code-axis at the same time, which is similar to the structure of HSDPA system.

Scheduling Methods for Multi-User Optical Wireless Asymmetrically-Clipped OFDM

  • Wilson, Sarah Kate;Holliday, Joanne
    • Journal of Communications and Networks
    • /
    • v.13 no.6
    • /
    • pp.655-663
    • /
    • 2011
  • Diffuse optical wireless (DOW) systems have the advantage that they do not require point-to-point siting so one transmitter can communicate with several receivers. In this paper, we investigate multiple access scheduling methods for downlink orthogonal frequency division multiplexing (OFDM) in diffuse optical wireless networks. Unlike the radio frequency (RF) channel, the DOW channel has low-pass filter characteristics and so requires different scheduling methods than those developed for the RF channel. Multi-user diversity orthogonal frequency division multiple access (OFDMA) systems nominate a cluster of subcarriers with the largest signal-to-noise-ratio for transmission. However, in a DOW channel, most users would choose the lowest frequency clusters of subcarriers. To remedy this problem, we make two proposals. The first is to use a variable cluster size across the subcarriers; the lower frequency clusters will have fewer subcarriers while the higher frequency clusters will have more subcarriers. This will equalize the capacity of the clusters. The second proposal is to randomize a user's cluster selection from a group of clusters satisfying a minimum threshold. Through simulation it is shown that combining these strategies can increase the throughput while ensuring a fair distribution of the available spectrum.