• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.586-592
• /
• 2002

In this paper, new channel scheduling algorithms which reduce transmission delay caused by wireless network are proposed in AMC/TDM wireless data communication. The concept of the Proposed algorithms is based on the proportional fairness, M-LWDF, and performance-guaranteeing algorithm proposed by Xin Liu. The proposed algorithm can be applied to QoS guaranteeing services as well as best-effort services. Simulation results show that new algorithm reduced transmission delay upto 11.5% in case of proportional fairness algorithm and also decreased transmission delay unto 9% in case of M-LWBF algorithm.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.1-10
• /
• 2008

In this paper, a packet scheduling algorithm, called the modified PLFS, is proposed for real-time traffic in IEEE 802.22 WRAN systems. The modified PLFS(Packet Loss Fair Scheduling) algorithm utilizes not only the delay of the Head of Line(HOL) packets in buffer of each user but also the amount of expected loss packets in the next-next frame when a service will not be given in the next frame. The performances of the modified PLFS are compared with those of PLFS and M-LWDF in terms of the average packet loss rate and throughput. The simulation results show that the proposed scheduling algorithm performs much better than the PLFS and M-LWDF algorithms.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.508-516
• /
• 2006

The explosive growth of wireless network users and the existence of various wireless services have demanded high rate throughput as well as user's QoS guarantees. Towards this, this paper proposes QoS-oriented subcarrier allocation scheme considering the QoS provisioning of multiple users, which is major requirement for wireless network design point of view. This paper introduces joint RR/K&H combined with M-LWDF(Modified Largest Weighted Delay First) scheme throughout observing statistical channel behavior and real time queuing analysis for appropriate resource allocation tightly connected to multiuser scheduling. Accordingly, the system throughput can be enhanced, and the QoS demanded for delay sensitive services can be satisfied. Furthermore, the proposed scheme is applied for OFDMA(Orthogonal Frequency Division Multiple Access) systems to allocate sub-carriers in optimal way. The simulation results verify plausible performances of proposed resource allocation scheme via showing superior effective capacity under time-varying physical-layer channel behaviors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.13-23
• /
• 2007

In this paper, a packet scheduling scheme that supports real-time traffic having multi-level delay constraints in OFDMA systems is proposed. The proposed scheme pursues to satisfy the delay constraint first, and then manage the residual radio resource in order to enhance the overall throughput. A parameters named tolerable delay time (TDT) is newly defined to deal with the differentiated behaviors of packet scheduling according to the delay constraint level. Assuming that the packets violating the delay constraint are discarded, the proposed scheme is evaluated in terms of the packet loss probability, throughput, channel utilization. It is then compared with existing schemes for real-time traffic support such as the Exponential Scheduling (EXP) scheme, the Modified Largest Weighted Delay First (M-LWDF) scheme, and the Round robin scheme. The numerical results show that the proposed scheduling scheme performs much better than the aforementioned scheduling schemes in terms of the packet loss probability, while slightly better in terms of throughput and channel utilization.

• 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.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.498-508
• /
• 2009

In wireless mobile environments, large bandwidth and high QoS (Quality of Service) are recently required to support the increased demands for multimedia services. LTE (Long Term Evolution) is one of the promising solutions for the next generation broadband wireless access systems. To efficiently use downlink resource and effectively support QoS, packet scheduling algorithm is one of the important features in LTE system. In this paper, we proposed DAPS (Delay-Aware Packet Scheduling) algorithm to consider QoS requirements of delays for various traffic classes as well as channel condition and fairness. To reflect delay experiences at scheduling instance, DAPS observes how queue waiting time of packet is closed to maximum allowable delay. The simulation results show that the DAPS algorithm yields better performance for delay experience by increasing the number of transmitted packets with satisfying the required delay time compared with existing scheduling algorithms.