• Journal of Astronomy and Space Sciences
• /
• v.20 no.3
• /
• pp.227-238
• /
• 2003

Spacecraft mission planning functions including event prediction, mission scheduling, command planning, and ground track display have been developed for the KOMPSAT-2 mission operations. Integrated event prediction functions including satellite orbital events, user requested imaging events, and satellite operational events have been implemented. Mission scheduling functions have been realized to detect the mission conflicts considering the user specified constraints and resources, A conflict free mission scheduling result is mapped into the spacecraft command sequences in the command planning functions. The command sequences are directly linked to the spacecraft operations using eXtensible Markup Language(XML) for command transmission. Ground track display shows the satellite ground trace and mission activities on a digitized world map with zoom capability.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1074-1077
• /
• 2002

This paper proposes an adaptive pricing system with scheduling to balance the demand for contents and to realize an effective use of resources in contents delivery networks. In the proposed adaptive pricing system, the table of the service levels and prices (tariff) is shown to each user at the start of service and each user chooses one of the service classes. These prices are decided adaptively reflecting the congestion state of the networks. Then, by the proposed scheduling algorithm, these requests are scheduled so as to keep the service level agreements completely.

• Journal of the Optical Society of Korea
• /
• v.20 no.1
• /
• pp.36-41
• /
• 2016

Visible Light Communication (VLC) using Light Emitting Diodes (LEDs) within the existing lighting infrastructure can reduce the implementation cost and may gain higher throughput than radio frequency (RF) or Infrared (IR) based wireless systems. Current indoor VLC systems may suffer from poor downlink resource allocation problems and small system throughput. To address these two issues, we propose an algorithm called a conflict graph scheduling (CGS) algorithm, including a conflict graph and a scheme that is based on the conflict graph. The conflict graph can ensure that users are able to transmit data without interference. The scheme considers the user fairness and system throughput, so that they both can get optimum values. Simulation results show that the proposed algorithm can guarantee significant improvement of system throughput under the premise of fairness.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.119-131
• /
• 2014

In recent literature on traffic scheduling, the combination of the two-dimensional discrete-time Markov chain (DTMC) and the Markov modulated Poisson process (MMPP) is used to analyze the capacity of VoIP traffic in the cognitive radio system. The performance of the cognitive radio system solely depends on the accuracy of spectrum sensing techniques, the minimization of false alarms, and the scheduling of traffic channels. In this paper, we only emphasize the scheduling of traffic channels (i.e., traffic handling techniques for the primary user [PU] and the secondary user [SU]). We consider the following three different traffic models: the cross-layer analytical model, M/G/1(m) traffic, and the IEEE 802.16e/m scheduling approach to evaluate the performance of the VoIP services of the cognitive radio system from the context of blocking probability and throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1100-1122
• /
• 2023

Scheduling user-submitted cloud tasks to the appropriate virtual machine (VM) in cloud computing is critical for cloud providers. However, as the demand for cloud resources from user tasks continues to grow, current evolutionary algorithms (EAs) cannot satisfy the optimal solution of large-scale cloud task scheduling problems. In this paper, we first construct a large- scale multi-objective cloud task problem considering the time and cost functions. Second, a multi-objective optimization algorithm based on multi-factor optimization (MFO) is proposed to solve the established problem. This algorithm solves by decomposing the large-scale optimization problem into multiple optimization subproblems. This reduces the computational burden of the algorithm. Later, the introduction of the MFO strategy provides the algorithm with a parallel evolutionary paradigm for multiple subpopulations of implicit knowledge transfer. Finally, simulation experiments and comparisons are performed on a large-scale task scheduling test set on the CloudSim platform. Experimental results show that our algorithm can obtain the best scheduling solution while maintaining good results of the objective function compared with other optimization algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.537-542
• /
• 2017

In this paper, we propose a new scheduling scheme to reduce the complexity and overhead in TDD uplink cellular networks. In a TDD network, users can estimate the interference causing to neighboring BSs by measuring the signals transmitted from them. In the existing max SGIR scheduling scheme, each user calculates SGIR and feeds back to BS. Then, the BS selects a user having the largest SGIR value to transmit data. This scheme has a problem that as the number of BSs increases, the number of interference channels to be measured by the users increases, and thus the hardware and algorithm complexity of the user increases. We propose a max SmGIR (Signal-to-max generating interference ratio) scheduling scheme that can reduce the user complexity by predicting the SGIR value based on only the largest interference information. According to computer simulations, the proposed scheme has similar performance to the existing max SGIR scheme despite this low complexity.

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

• Journal of Satellite, Information and Communications
• /
• v.12 no.3
• /
• pp.8-14
• /
• 2017

In 4G mobile communication, data services of mobile communication began to be provided in earnest. As a result, services such as the internet and multimedia including the video have become the main contents in the recent wireless traffic. Accordingly, research on 5G mobile communication with higher transmission rate has been actively carried out. 5G mobile communication is expected to be based on 4G for compatibility with existing terminals. Therefore, the simulation of this paper is based on 4G and we propose a new user scheduling scheme based on the Max throughput scheduling algorithm to improve system performance. This paper derives the frequency efficiency and fairness to compare the existing user scheduling algorithm with the proposed user scheduling algorithm. The proposed scheme shows better frequency efficiency and fairness than Max throughput in all situations. This paper contributes to the research for improving the system performance of 5G mobile communication technology, and I hope that it will help some of the ongoing standardization work.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.37-39
• /
• 2015

In this paper, we propose a distributed user scheduling with interference-aware power control (IAPC) to maximize signal to generating interference plus noise ratio (SGINR) in multi-cell uplink network. Assuming that the channel reciprocity time-division duplexing (TDD) system is used, the interference channel from users to other cell BSs is obtained at each user. In the proposed scheduling, each user reduces the transmit power if its generating interference to other BSs is larger than a predetermined threshold. Each BS selects the user with the largest SGINR among users. Simulation results show that the proposed technique significantly outperform the existing user scheduling algorithms.

• Korean Management Science Review
• /
• v.24 no.1
• /
• pp.113-126
• /
• 2007

This paper deals with a mathematical approach for finding the time-fractions for the time-fraction based scheduling method in multimedia wireless networks. By introducing a constraint that regulates the performance fairness amongst users, we present a systematic method for harmonizing both the system and user performance. Numerical results show that the time-fraction based scheduling method reinforced with our scheme is very effective especially in multimedia environments.