• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1291-1297
• /
• 2004

In this paper, the new scheduling algorithm that supports the maximization of system throughput and the proportional fairness among non-real time traffic users is proposed in OFDMA wireless mobile communication systems. The concept of the proposed algorithm is based on the proportional fairness algorithm, which is deployed in 3GPP2, and sorting method. The proportional fairness algorithm is adapted to allocate the number of subcarrier per user. A sorting method is contributed to the maximization of system throughput in the practical allocation of subcarrier per user. Simulation results show that new algorithm had better performance than the max rate rule in case of fairness, higher throughput than the scheduling algorithm without sorting method. Even though the system throughput of the proposed algorithm is almost same with the iteration scheme using subcarrier swapping method between users, the computational time of the former is reduced up to 3 times than the latter.

• The Journal of the Korea Contents Association
• /
• v.21 no.6
• /
• pp.12-18
• /
• 2021

A proportional share scheduler allocates CPU time to tasks and determines which task will be dispatched according to their priorities. In this paper, we investigate the correlation between the characteristics of applications and task priorities in the Linux Completely Fair Scheduler(CFS), which is one of the representative proportional share schedulers. We also propose a method of controlling the granularity of priority assignments according to the characteristics of applications. We implemented the proposed technique in a Linux system and confirmed the meaningful experimental results.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.27-33
• /
• 2015

In this paper, we consider a joint frequency-domain scheduling and user-pairing problem for virtual MIMO in the single carrier frequency division multiple access (SC-FDMA) system, e.g., the uplink transmission for third generation partnership project-long term evolution (3GPP-LTE) standard. Due to the subcarrier adjacency constraint inherent to SC-FDMA, its complexity becomes unmanageable. We propose a greedy heuristic algorithm for PF scheduling so as to deal with the complexity issue in this joint problem. It has been shown that its performance can reach up to 90% of its upper bound.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.613-619
• /
• 2012

The Long Term Evolution (LTE) system is already able to provide a background of variety services for mobile users with multimedia services such as audio, video, and data. In fact, the High Speed Packet Access plus (HSPA+) solution can greatly enhance bit rates on down-link. However, the supporting for multimedia applications with different QoS (Quality of Service) requirements is not devised yet. Hence, in this paper we propose an effective packet scheduling algorithm based on Proportional Fairness (PF) scheduling algorithms for the LTE. In this proposed packet scheduling scheme, we optimized instantaneous user data rates and the traffic class weight which prioritize user's packets. Finally, we evaluated and showed the performance of the proposed scheduling algorithm through simulations of multimedia traffics being transmitted to users over LTE links in a multi-cell environment.

• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.371-376
• /
• 2001

Since continuous media such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms cold be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm based on the stride scheduler is a scheduling algorithm considered the time constraint of the continuous media. The stride schedulers, which are designed to general tasks, guarantee the fairness of resource allocation and predictability. The key concept of RRPSSA is a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness which is a strong point of the stride schedulers, and does not show graceful degradation of performance under overloaded situation. This paper proposes a new modified algorithm, namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and it reduces the scheduling violations up to 70% by maintaining the fair resource allocation. The number of context switching is 8% less than RRPSSA and the overall performance is increased.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.3
• /
• pp.151-161
• /
• 2014

3GPP LTE-Advanced (Release 10) system specifies carrier aggregation (CA) to enable high data rate on using multiple frequency bands, including the variout CA-specific deployment scenarios. Considering one of those scenarios in which the different directional sector antenna is employed by each frequency band, we propose a per-carrier cell selection scheme that can improve the average throughput of the cell-edge users by allowing each user equipment (UE) to select the frequency band of the adjacent cell. Furthermore, a distributed algorithm for inter-cell copperative scheduling in this scheme is proposed to support proportional fairness among the cells. It has been shown that the proposed scheduling algorithm for the per-carrier cell selection scheme improves the cell-edge user throughput roughly by 50% over that of the conventional scheme.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.1
• /
• pp.3-8
• /
• 2016

Wireless networks have evolved to the appearance of heterogeneous wireless networks(HetNet), where various networks provide data services with various data rates and coverage. One of technical issues for HetNet is efficient utilization of radio resources for system performance enhancement. For the next generation wireless networks, energy saving has become one of key performance indices, so energy-efficient resource management schemes for HetNet need to be developed. This paper addresses an energy-efficient scheduling for HetNet in order to improve the energy efficiency while maintaining similar system throughput as existing scheme, for which an energy-efficient scheduling that energy efficiency factor is included. Simulation results show that the proposed scheme achieves the reduction of energy consumption while admitting limited ragne of throughput degradation in comparison with the conventional proportional fair scheduling.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1639-1644
• /
• 2016

In this paper, we consider the performance improvement that can be obtained with interference alignment (IA) technique applied to 802.11ac based multi-BSS WiFi service. To this end, we developed a system simulator consisting of a link-level PHY simulator, based on 802.11ac specification, and multi-BSS proportional-fair scheduler. Specifically, assuming perfect channel side information and synchronization of signals from multiple APs, we used a SLNR based interference alignment algorithm proposed in [13] and compared its performance with that of multiuser beamforming based time-sharing system. The performance was evaluated in terms of average throughput per BSS and 5% worst user throughput. The results show that 70 to 100% throughput gain can be obtained in this ideal scenario.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.11a
• /
• pp.91-94
• /
• 2008

본 논문에서는 준 정적(quasi-static) 레일레이 페이딩(Rayleigh fading) 채널에서 상향링크 다중 사용자 MIMO-OFDM 시스템을 위한 최소평균제곱오차-순차간섭제거(MMSE-SIC: Minimum mean square error-successive interference cancellation) 수신기에 대해 연구한다. 송신 안테나가 하나인 사용자와 수신 안테나가 다수인 기지국에서 MMSE-SIC 수신기를 기반으로 신호를 검출하는 시스템에서는 하나의 부대역 내에서 동시에 전송 가능한 사용자의 수가 기지국에서의 수신안테나 수보다 작아야 하는 제한 조건을 가지고 있다. 따라서 사용자간 공정성을 보장하고 시스템의 효율성을 높이기 위해 낮은 복잡도를 가지는 비례 공정(Proportional fair) 스케줄링 알고리즘을 제안한다. 제안된 비례 공정 스케줄링 알고리즘에서는 부대역 내에서 다중 사용자 채널 행렬을 기반으로 동시에 전송하는 사용자들의 집합을 찾는다. 평균 채널 이득이 사용자마다 다른 환경에서의 모의실험을 통해 제안된 비례 공정 스케줄링 기법의 성능을 알아본다. 제안된 비례 공정 스케줄링 기법은 기존의 공정성을 기반으로 하는 스케줄링 알고리즘보다 더 큰 일반 비례 공정(General proportional fair) 기준과 더 높은 셀 수율(Cell throughput)을 가지는 것을 보이고 있다.