• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.212-218
• /
• 2010

In wireless sensor networks (WSNs), both efficient energy management and Quality of Service (QoS) are important issues for some applications. For creating robust networks, real-time services are usually employed to satisfy the QoS requirements. In this paper, we proposed a hierarchical real-time MAC (medium access control) protocol for (m,k)-firm constraint in wireless sensor networks shortly called HRTS-MAC. The proposed HRTS-MAC protocol is based on a dynamic priority assignment by (m,k)-firm constraint. In a tree structure topology, the scheduling algorithm assigns uniform transmitting opportunities to each node. The paper also provides experimental results and comparison of the proposed protocol with E_DBP scheduling algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.337-343
• /
• 2006

The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.

• ETRI Journal
• /
• v.35 no.1
• /
• pp.18-26
• /
• 2013

This paper proposes an efficient bandwidth utilization (EBU) algorithm that utilizes the unused bandwidth in dynamic bandwidth allocation (DBA) of a 10-gigabit-capable passive optical network (XGPON). In EBU, an available byte counter of a queue can be negative and the unused remainder of an available byte counter can be utilized by the other queues. In addition, EBU uses a novel polling scheme to collect the requests of queues as soon as possible. We show through analysis and simulations that EBU improves performance compared to that achieved with existing methods. In addition, we describe the hardware implementation of EBU. Finally we show the test results of the hardware implementation of EBU.

• Industrial Engineering and Management Systems
• /
• v.10 no.1
• /
• pp.1-6
• /
• 2011

This paper describes the issue of batch scheduling.In food production, the lead-time from produc-tion to sale should be decreased becausefreshness of the product is important. Products are shipped at diverse times depending on a demand of sellers, because the types of sellers has become diversified such as super-markets, convenience stores and etc. production of quantity demanded must be completed by time to ship it then. The authors consider a problem with due-dates constraints and construct the algorithm to find the opti-mal schedule that satisfy the due-dates constraint, batch size constraint, inventory time constraint and mini-mize total flow time.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.102-105
• /
• 1993

The objective of this study is to solve the operation scheduling problem of plural battery energy storage systems (BESS), and to find useful intonation from its result. Unlike conventional energy storage system, BESS has on hardware characteristics such as high efficiency, fast-acting response and operational loss. Considering rate constraints of thermal unit power as well as hardware characteristics of BESS, the operation scheduling has an intricated problem. In order to solve this optimization problem, we use successive approximations dynamic programming. In two types of operation, the proposed algorithm is applied to test system. one is daily optimal operation, the other weekly optimal operation.

• Journal of the Korea Society for Simulation
• /
• v.8 no.3
• /
• pp.67-76
• /
• 1999

The study of the optimization of operating policy of AGV system, which is used in many factory automation environments has been proceeded by many researchers. The major operating policy of AGV system consists of routing and scheduling policy. AGV routing is composed with collision avoidance and minimal cost path find algorithm. To allocate jobs to the AGV system, AGV scheduling has to include AGV selection rules, parking rules, and recharging rules. Also in these rules, the key time parameters such as processing time of the device, loading/unloading time and charging time should be considered. In this research, we compare and analyze several operating policies of multiple loop-multiple AGV system by making a computer model and simulating it to present an appropriate operating policy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.263-271
• /
• 2004

In this paper, we proposed a new buffer management algorithm using perVC-Queuing discipline. Proposed algorithm uses service rate estimation and assigns dynamic perVC threshold to each VCs. Service rate estimation and dynamic perVC threshold combined with global threshold provide nearly optimal throughput and improve fairness performance of network resource among GFR VCs as well as guarantee MCR of all VCs. From simulation results, we demonstrate the proposed scheme fulfills the requirement of GFR service as well as improves the TCP throughput.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.3
• /
• pp.153-161
• /
• 2002

In this paper, we propose a Probabilistic Tabu Search(PTS) method for hydro-thermal scheduling. Hydro scheduling has many constraints and very difficult to solve the optical schedule because it has many local minima. To solve the problem effectively, the proposed method uses two procedures, one is Tabu search procedure that plays a role in local search, and the other is Restarting procedure that enables to diversify its search region. To adjust Parameters such as a reducing rate and initial searching region, search strategy is selected according to its probability after restarting procedure. Dynamic decoding method was also used to restrict a search region and to handle water balance constraints. In order to show the usefulness of the proposed method, the PTS is applied on two cases which have independent or dependent hydro plants and compared to those of other method. The simulation results show it is very efficient and useful algorithm to solve the hydro-thermal scheduling problem.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.3
• /
• pp.234-240
• /
• 1999

This paper presents a new approach for large-scale generator maintenance scheduling optimizations. The generator preventive maintenance scheduling problems are typical discrete dynamic n-dimensional vector optimization ones with several inequality constraints. The considered objective function to be minimized a subset of{{{{ { R}^{n } }}}} space is the variance (i.g., second-order momentum) of operating reserve margin to levelize risk or reliability during a year. By its nature of the objective function, the optimal solution can only be obtained by enumerating all combinatorial states of each variable, a task which leads to computational explosion in real-world maintenance scheduling problems. This paper proposes a new priority search mechanism based on each generator's discrete sensitivity value which was analytically developed in this study. Unlike the conventional capacity-based priority search, it can prevent the local optimal trap to some extents since it changes dynamically the search tree in each iteration. The proposed method have been applied to two test systems (i.g., one is a sample system with 10 generators and the other is a real-world lage scale power system with 280 generators), and the results anre compared with those of the conventional capacith-based search method and combinatorial optimization method to show the efficiency and effectiveness of the algorithm.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.641-650
• /
• 2008

As portable devices are used widely, power management algorithm is essential to extend battery use time on small-sized battery power. Although many methods have been proposed, they assumed the voltage transition overhead was negligible or was considered partially. However, the voltage transition overhead might not guarantee to schedule real-time tasks in portable multimedia systems. This paper proposes the adaptive power-aware algorithm to minimize the power consumption by considering the voltage transition overhead. It selects only a few discrete frequencies from the whole frequencies of a system and adjusts the interval between two consecutive frequencies based on the system utilization to reduce the number of frequency change. This algorithm saves the power consumption about 10 to 25 percent compared to a CC RT-DVS method and a frequency-smoothing method.