• Journal of Information Processing Systems
• /
• v.11 no.2
• /
• pp.295-309
• /
• 2015

Beacon scheduling is considered to be one of the most significant challenges for energy-efficient Low-Rate Wireless Personal Area Network (LR-WPAN) multi-hop networks. The emerging new standard, IEEE802.15.4e, contains a distributed beacon scheduling functionality that utilizes a specific bitmap and multi-superframe structure. However, this new standard does not provide a critical recipe for superframe duration (SD) allocation in beacon scheduling. Therefore, in this paper, we first introduce three different SD allocation approaches, LSB first, MSB first, and random. Via experiments we show that IEEE802.15.4e DSME beacon scheduling performs differently for different SD allocation schemes. Based on our experimental results we propose an adaptive SD allocation (ASDA) algorithm. It utilizes a single indicator, a distributed neighboring slot incrementer (DNSI). The experimental results demonstrate that the ASDA has a superior performance over other methods from the viewpoint of resource efficiency.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1481-1494
• /
• 1997

In hard real-time systems, a timing fault may yield catastrophic results. Dynamic scheduling provides the flexibility to compensate for unexpected events at runtime; however, scheduling overhead at runtime is relatively large, constraining both the accuracy of the timing and the complexity of the scheduling analysis. In contrast, static scheduling need not have any runtime overhead. Thus, it has the potential to guarantee the precise time at which each instruction implementing a control action will execute. This paper presents a new approach to the problem of analyzing high-level language code, augmented by arbitrary before and after timing constraints, to provide a valid static schedule. Our technique is based on instruction-level complier code scheduling and timing analysis, and can ensure the timing of control operations to within a single instruction clock cycle. Because the search space for a valid static schedule is very large, a novel adaptive genetic search algorithm was developed.

• ETRI Journal
• /
• v.33 no.6
• /
• pp.857-863
• /
• 2011

Due to uncertainties in target motion and randomness of deployed sensor nodes, the problem of imbalance of energy consumption arises from sensor scheduling. This paper presents an energy-efficient adaptive sensor scheduling for a target monitoring algorithm in a local monitoring region of wireless sensor networks. Owing to excessive scheduling of an individual node, one node with a high value generated by a decision function is preferentially selected as a tasking node to balance the local energy consumption of a dynamic clustering, and the node with the highest value is chosen as the cluster head. Others with lower ones are in reserve. In addition, an optimization problem is derived to satisfy the problem of sensor scheduling subject to the joint detection probability for tasking sensors. Particles of the target in particle filter algorithm are resampled for a higher tracking accuracy. Simulation results show this algorithm can improve the required tracking accuracy, and nodes are efficiently scheduled. Hence, there is a 41.67% savings in energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2824-2837
• /
• 2019

Container technologies are widely used in infrastructures to deploy and manage applications in cloud computing environment. As containers are light-weight software, the cluster of cloud applications can easily scale up or down to provide Internet-based services. Container-based applications can well deal with fluctuate workloads by dynamically adjusting physical resources. Current works of scheduling applications often construct applications' performance models with collected historical training data, but these works with static models cannot self-adjust physical resources to meet the dynamic requirements of cloud computing. Thus, we propose a self-adaptive automatic container scheduling framework AutoScale for cloud applications, which uses a feedback-based approach to adjust physical resources by extending, contracting and migrating containers. First, a queue-based performance model for cloud applications is proposed to correlate performance and workloads. Second, a fuzzy Kalman filter is used to adjust the performance model's parameters to accurately predict applications' response time. Third, extension, contraction and migration strategies based on predicted response time are designed to schedule containers at runtime. Furthermore, we have implemented a framework AutoScale with container scheduling strategies. By comparing with current approaches in an experiment environment deployed with typical applications, we observe that AutoScale has advantages in predicting response time, and scheduling containers to guarantee that response time keeps stable in fluctuant workloads.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.95-96
• /
• 1986

시스템을 입력과 출력값 만으로 제어하고자 할 경우에는, 플랜트의 파라메타를 추정하면서 제어해 나가야 할 것이다. 이러한 경우에는, 귀환제어나 최적제어 형태로는 여러가지 문제점이 발견되어서, 최근에 적응제어가 많이 연구되고 있다. 이에는 Gain-Scheduling 방법, Self-tuning regulator 방법 및 model reference adaptive control 방법이 있다. Gain-Scheduling 방법은 미지의 파라메타가 plant에 있을지라도, 이를 즉시 예측할 수 있을 경우 보조변수 추정을 통하여 이득을 조절하여 시스템을 안정시키는 것이고, self tuning regulator는 보조변수를 직접 조정하여 시스템을 제어한다. 또 model reference adaptive control 방법은 기준모델을 정하여, 이에 따라 관측기 등을 통하여, 플랜트의 파라메타를 추정 제어해 나가는 것이다. 이때 기준 모델의 출력과 플랜트 출력사이의 오차를 어떻게 할 것인가? 추정되는 파라메타와 오차와의 대수관계 및 차수 등, 그 한계 해석이 최근의 MRAC 설계연구에 큰 과제가 되어 왔다. 이에 본 연구에서는 신호합성 및 해석에 뛰어난 기능이 있는 Walsh 함수를 이용하여, 간단한 Micro computer의 도움으로, 오차 함수를 합성하고, 미지의 파라메타를 추정하여, 시스템의 adaptive filter설계에의 가능성에 대하여 연구하고자 한다. 또 이를 실제 예를 들어 고찰하였다.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1436-1458
• /
• 2017

Quorum-based algorithms are widely used for solving several problems in mobile ad hoc networks (MANET) and wireless sensor networks (WSN). Several quorum-based protocols are proposed for multi-hop ad hoc networks that each one has its pros and cons. Quorum-based protocol (QEC or QPS) is the first study in the asynchronous sleep scheduling protocols. At the time, most of the proposed protocols were non-adaptive ones. But nowadays, adaptive quorum-based protocols have gained increasing attention, because we need protocols which can change their quorum size adaptively with network conditions. In this paper, we first introduce the most popular quorum systems and explain quorum system properties and its performance criteria. Then, we present a comparative and comprehensive survey of the non-adaptive and adaptive quorum-based protocols which are subsequently discussed in depth. We also present the comparison of different quorum systems in terms of the expected quorum overlap size (EQOS) and active ratio. Finally, we summarize the pros and cons of current adaptive and non-adaptive quorum-based protocols.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.33-49
• /
• 2002

CBM (Condition-Based Maintenance) has increasingly drawn attention in industry because of its many benefits. CBM Problem Is characterized as a state-dependent scheduling model that demands simultaneous maintenance actions, each for an attribute that influences on machine condition. This problem is very hard to solve within conventional Markov decision process framework. In this paper, we present an intelligent machine maintenance scheduler, for which a new incremental decision tree learning method as evolutionary system identification model and shortest path problem as schedule generation model are developed. Although our approach does not guarantee an optimal scheduling policy in mathematical viewpoint, we verified through simulation based experiment that the intelligent scheduler is capable of providing good scheduling policy that can be used in practice.

• Industrial Engineering and Management Systems
• /
• v.10 no.4
• /
• pp.247-254
• /
• 2011

In this paper, we study a single-machine scheduling problem with deteriorating processing time of jobs and multiple rate-modifying activities which reset deteriorated processing time to the original processing time. In this situation, the objective function is to minimize total completion time. First, we formulate an integer programming model. Since the model is difficult to solve as the size of real problem being very large, we design an improved genetic algorithm called adaptive genetic algorithm (AGA) with spontaneously adjusting crossover and mutation rate depending upon the status of current population. Finally, we conduct some computational experiments to evaluate the performance of AGA with the conventional GAs with various combinations of crossover and mutation rates.

• Proceedings of the KIPE Conference
• /
• 2014.07a
• /
• pp.556-557
• /
• 2014

This paper presents an artificial intelligence - Deep Belief Network (DBN) gain-scheduling adaptive PI controller scheme for dual active bridge (DAB) converter. The PI gains are allowed to vary within a predetermined range and therefore eliminate the problems faced by the conventional PI controller. The performance of the proposed controller is simulated and compared with the conventional fixed PI controller under various conditions. The experimental prototype of the DAB converter is implemented using a digital signal processor of TMS320F28335 manufactured by Texas Instrument to examine and to evaluate the performance criteria of the proposed controller. Simulation and experimental results show improvements in transient as well as steady state responses of the proposed controller over the conventional fixed PI controller.

• Journal of Ocean Engineering and Technology
• /
• v.29 no.3
• /
• pp.263-269
• /
• 2015

This paper proposes a new approach for solving the weather routing problem by dividing it into two phases with the goal of fuel saving. The problem is to decide two optimal variables: the heading angle and speed of the ship under several constraints. In the first phase, the optimal route is obtained using the Real-Time Adaptive A* algorithm with a fixed ship speed. In other words, only the heading angle is decided. The second phase is the speed scheduling phase. In this phase, the original problem, which is a nonlinear optimization problem, is converted into a geometric programming problem. By solving this geometric programming problem, which is a convex optimization problem, we can obtain an optimal speed scheduling solution very efficiently. A simple case of numerical simulation is conducted in order to validate the proposed method, and the results show that the proposed method can save fuel compared to a constant engine output voyage and constant speed voyage.