• Journal of Advanced Navigation Technology
• /
• v.15 no.4
• /
• pp.517-522
• /
• 2011

Global Navagation Satellite System(GNSS) is divided into Local Area Differential GNSS and Wide Area Differential GNSS. Wide Area DGNSS has more complicated structure and massage type. And transfer rate is limited, so efficient message scheduling algorithm is needed to guarantee user's accuracy and integrity. There are about 30 message types in Wide Area DGNSS. Each message type has different update interval. In this paper, the performances of message scheduling algorithm for Wide Area Differential GNSS are investigated. For all message types, results show that max update time interval requirement is satisfied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2A
• /
• pp.134-141
• /
• 2010

In this paper, we propose a scheduling algorithm to improve the performance of IEEE 802.16 based wireless mesh networks using directional antenna. The performance is presented in terms of throughput of system and delay between each node by varying number of users. The result show that proposed scheduling algorithm improving the performance by reducing the delay of mesh network system. Our work may be useful as a guideline to control the fairness between SSs for multi-hop systems such as multi-hop relay and mesh networks.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.05a
• /
• pp.429-434
• /
• 2002

For companies assembling end products from sub assemblies or components, MRP (Material Requirement Planning) logic is frequently used to synchronize and pace the production activities for the required parts. However, in MRP, the planning of operational-level activities is left to short term scheduling. So, we need a good scheduling algorithm to generate feasible schedules taking into account shop floor characteristics and multi-level job structures used in MRP. In this paper, we present a GA (Genetic Algorithm) solution for this complex scheduling problem based on a new gene to reflect the machine assignment, operation sequences and the levels of the operations relative to final operation. The relative operation level is the control parameter that paces the completion timing of the components belonging to the same branch in the multi-level job hierarchy. In order to revise the fixed relative level which solutions are confined to, we apply large step transition in the first step and GA in the second step. We compare the genetic algorithm and 2-phase optimization with several dispatching rules in terms of tardiness for about forty modified standard job-shop problem instances.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.5
• /
• pp.433-439
• /
• 2010

This paper proposes a beacon color code scheduling algorithm for the localization of multiple robots in a multi-block workspace. With the developments of intelligent robotics and ubiquitous technology, service robots are applicable for the wide area such as airports and train stations where multiple indoor GPS systems are required for the localization of the mobile robots. Indoor localization schemes using ultrasonic sensors have been widely studied due to its cheap price and high accuracy. However, ultrasonic sensors have some shortages of short transmission range and interferences with other ultrasonic signals. In order to use multiple robots in wide workspace concurrently, it is necessary to resolve the interference problem among the multiple robots in the localization process. This paper proposes an indoor localization system for concurrent multiple robots localization in a wide service area which is divided into multi-block for the reliable sensor operation. The beacon color code scheduling algorithm is developed to avoid the signal interferences and to achieve efficient localization with high accuracy and short sampling time. The performance of the proposed localization system is verified through the simulations and the real experiments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.3
• /
• pp.123-133
• /
• 2011

The advanced planning and scheduling(APS) is an well known enterprise information system that provides optimal production schedules and supports to complete production on time by solving the complex scheduling problems including capacity and due dates. In this paper, we focused on the improvement of the APS that is already established on a real company. The existing APS had several drawbacks, thus utilization and satisfaction were very low. We performed the focused group interviews and the process analysis and could find that the end users and developers have various objectives and the frequently used functions are different. We applied the analytical hierarchy process(AHP) to converge opinions of them on quantitative data. The results show that it is necessary to enhance visibility, to improve user interfaces and response speed, and to reconcile the real business process and the APS's process.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.9
• /
• pp.542-549
• /
• 2003

In this paper, a novel approach to generator maintenance scheduling strategy in competitive electricity markets based on non-cooperative dynamic game theory is presented. The main contribution of this study can be considered to develop a game-theoretic framework for analyzing strategic behaviors of generating companies (Gencos) from the standpoints of the generator maintenance-scheduling problem (GMP) game. To obtain the equilibrium solution for the GMP game, the GMP problem is formulated as a dynamic non-cooperative game with complete information. In the proposed game, the players correspond to the profit-maximizing individual Gencos, and the payoff of each player is defined as the profits from the energy market. The optimal maintenance schedule is defined by subgame perfect equilibrium of the game. Numerical results for two-Genco system by both proposed method and conventional one are used to demonstrate that 1) the proposed framework can be successfully applied in analyzing the strategic behaviors of each Genco in changed markets and 2) both methods show considerably different results in terms of market stability or system reliability. The result indicates that generator maintenance scheduling strategy is one of the crucial strategic decision-makings whereby Gencos can maximize their profits in a competitive market environment.

• The Journal of Information Technology
• /
• v.7 no.1
• /
• pp.57-67
• /
• 2004

Data broadcast has attracted a lot of attention as an efficient way of disseminating data to very large client populations. The main motivation of data broadcast systems is that the number of clients that they serve can grow arbitrarily large without any effect on their performance. The performance of broadcast system depends mainly on client caching strategies and on data broadcast scheduling mechanisms. This paper addresses the latter issue and proposes a new broadcast scheduling scheme, named RxW$^{\alpha}$, that is suitable to data broadcast systems. This paper also evaluates the performance of RxW$^{\alpha}$ on the basis of a simulation model. The performance results indicate that RxW$^{\alpha}$ is capable of improving the performance in the variance of response time significantly, showing a reasonable performance in the response time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.2
• /
• pp.89-97
• /
• 2009

Embedded systems widely used in ubiquitous environments usually employ an event-driven programming model instead of thread-based programming model in order to create a more robust system that uses less memory. However, as the software for embedded systems becomes more complex, it becomes hard to program as a single event handler using the event-driven programming model. This paper discusses the implementation of non-preemptive real-time scheduling theory for the design of embedded systems. To this end, we present an efficient schedulability test method for a given non-preemptive task set using a sufficient condition. This paper also shows that the notion of sub-tasks in embedded systems can overcome the problem of low utilization that is a main drawback of non-preemptive scheduling.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.575-580
• /
• 2006

It is important matter that inflect well allocated frequency resource in cellular network and is still more serious element in environment that provide multimedia services. This paper describes model and algorithm that increase two elements that is frequency allocation and job scheduling that consider multimedia service traffic special quality by emphasis that do mapping present in CDMA cellular system. We proposed the model composed three parts (channel allocation algorithm, mapping algorithm and scheduling algorithm) and simulation results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2736-2750
• /
• 2022

As demands for the maritime communications increase, a variety of functions and information are required to exchange via elements of maritime systems, which leads communication traffic increases in maritime frequency bands, especially in VHF (Very High Frequency) band. Thus, effective resource management is crucial to the future maritime communication systems not only to the typical terrestrial communication systems. VHF data exchange system (VDES) enables to utilize more flexible configuration according to the communication condition. This paper focuses on the VDES communication system among VDES terminals such as shore stations, ship stations and aids to navigation (AtoN) to address efficient resource allocation. We propose a resource management method considering a MIMO (Multiple Input Multiple Output) technique in VDES, which has been widely used for modern terrestrial wireless networks but not for marine environments by scheduling the essential communication resources. We introduce the general channel model in marine environment and give two metrics, spectral and the energy efficiencies to examine our resource scheduling algorithm. Based on the simulation results and analysis, the proposed method provides a possibility to enhance spectral and energy efficiencies. Additionally, we present a trade-off relationship between spectral and energy efficiencies. Furthermore, we examine the resource efficiencies related to the imperfect channel estimation.