• 한국정보처리학회논문지
• /
• 제7권2S호
• /
• pp.649-655
• /
• 2000

Real-time application programs have constraints which need to be met between media-data. These constraints represents the delay time ad quality of service between media-data to be presented. In order to efficiently describe the delay time and quality of service, a new synchronization mechanism is needed. Proposed paper is a dynamic synchronization that minimized the effects of adaptive transmission delay time. That is, the method meets the requirements of synchronization between media-dat by handling dynamically the adaptive waiting time resulted from variations of delay time. In addition, the mechanism has interval adjustment using maximum delay jitter time. This paper decreases the data loss resulted from variation of delay time and from loss time of media-data by means of applying delay jitter in order to deal with synchronization interval adjustment. Plus, the mechanism adaptively manages the waiting time of smoothing buffer, which leads to minimize the gap from the variation of delay time. The proposed paper is suitable to the system which requires the guarantee of high quality of service and mechanism improves quality of services such as decrease of loss rate, increase of playout rate.

• 대한수학회지
• /
• 제37권4호
• /
• pp.625-643
• /
• 2000

In this paper we formulate an optimal control problem governed by time-delay Volterra integral equations; the problem includes control constraints as well as terminal equality and inequality constraints on the terminal state variables. First, using a special type of state and control variations, we represent a relatively simple and self-contained method for deriving new necessary conditions in the form of Pontryagin minimum principle. We show that these results immediately yield classical Pontryagin necessary conditions for control processes governed by ordinary differential equations (with or without delay). Next, imposing suitable convexity conditions on the functions involved, we derive Mangasarian-type and Arrow-type sufficient optimality conditions.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.28-37
• /
• 2008

In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink channels. We design a scheduler that selects a user for transmission and determines the transmission rate of the selected user based on the channel and backlog information of users. Since it requires prohibitively high computation complexity to determine an optimal scheduler for multi-user systems, we propose a low-complexity scheduling scheme that can achieve near-optimal performance. In this scheme, we reduce the complexity by decomposing the multiuser problem into multiple individual user problems. We arrange the probability of selecting each user such that it can be determined only by the information of the corresponding user and then optimize the transmission rate of each user independently. We solve the user problem by using a dynamic programming approach and analyze the upper and lower bounds of average transmission power and average delay, respectively. In addition, we investigate the effects of the user selection algorithm on the performance for different channel models. We show that a channel-adaptive user selection algorithm can improve the energy efficiency under uncorrelated channels but the gain is obtainable only for loose delay requirements in the case of correlated channels. Based on this, we propose a user selection algorithm that adapts itself to both the channel condition and the backlog level, which turns out to be energy-efficient over wide range of delay requirement regardless of the channel model.

• 제어로봇시스템학회논문지
• /
• 제3권5호
• /
• pp.542-554
• /
• 1997

In this paper, we present a resource conscious approach to designing distributed real-time systems as an extension of our original approach [8][9] which was limited to single processor systems. Starting from a given task graph and a set of end-to-end constraints, we automatically generate task attributes (e.g., periods and deadlines) such that (i) the task set is schedulable, and (ii) the end-to-end timing constraints are satisfied. The method works by first transforming the end-to-end timing constraints into a set of intermediate constraints on task attributes, and then solving the intermediate constraints. The complexity of constraint solving is tackled by reducing the problem into relatively tractable parts, and then solving each sub-problem using heuristics to enhance schedulability. In this paper, we build on our single processor solution and show how it can be extended for distributed systems. The extension to distributed systems reveals many interesting sub-problems, solutions to which are presented in this paper. The main challenges arise from end-to-end propagation delay constraints, and therefore this paper focuses on our solutions for such constraints. We begin with extending our communication scheme to provide tight delay bounds across a network, while hiding the low-level details of network communication. We also develop an algorithm to decompose end-to-end bounds into local bounds on each processor of making extensive use of relative load on each processor. This results in significant decoupling of constraints on each processor, without losing its capability to find a schedulable solution. Finally, we show, how each of these parts fit into our overall methodology, using our previous results for single processor systems.

• Kyungpook Mathematical Journal
• /
• 제58권2호
• /
• pp.333-346
• /
• 2018

An approximation scheme utilizing Bezier curves is considered for solving time-delayed optimal control problems with terminal inequality constraints. First, the problem is transformed, using a $P{\acute{a}}de$ approximation, to one without a time-delayed argument. Terminal inequality constraints, if they exist, are converted to equality constraints. A computational method based on Bezier curves in the time domain is then proposed for solving the obtained non-delay optimal control problem. Numerical examples are introduced to verify the efficiency and accuracy of the proposed technique. The findings demonstrate that the proposed method is accurate and easy to implement.

• Journal of Communications and Networks
• /
• 제11권2호
• /
• pp.148-156
• /
• 2009

The fixed spectrum assignment policy in today's wireless networks leads to inefficient spectrum usage. Cognitive radio network is a new communication paradigm that enables the unlicensed users to opportunistically use the spatio-temporally unoccupied portions of the spectrum, and hence realizing a dynamic spectrum access (DSA) methodology. Interference temperature model proposed by Federal Communications Commission (FCC) permits the unlicensed users to utilize the licensed frequencies simultaneously with the primary users provided that they adhere to the interference temperature constraints. In this paper, we formulate two NP-hard optimal scheduling methods that meet the interference temperature constraints for cognitive radio networks. The first one maximizes the network throughput, whereas the second one minimizes the scheduling delay. Furthermore, we also propose suboptimal schedulers with linear complexity, referred to as maximum frequency selection (MFS) and probabilistic frequency selection (PFS). We simulate the throughput and delay performance of the optimal as well as the suboptimal schedulers for varying number of cognitive nodes, number of primary neighbors for each cognitive node, and interference temperature limits for the frequencies. We also evaluate the performance of our proposed schedulers under both additive white gaussian noise (AWGN) channels and Gilbert-Elliot fading channels.

• 산업경영시스템학회지
• /
• 제34권1호
• /
• pp.33-41
• /
• 2011

This paper considers a topological optimization of a network design with mean packet delay and node connectivity constraints. The objective is to find the topological layout of links, at minimal cost. This Problem is known to be NP-hard. To efficiently solve the problem, a scatter search algorithm is proposed. An illustrative example is used to explain and test the proposal approach. Experimental results show evidence that the proposal approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic approach.

• IEIE Transactions on Smart Processing and Computing
• /
• 제4권6호
• /
• pp.391-402
• /
• 2015

In this paper, we present implementation of backward movement control of truck-trailer vehicles using a fuzzy mode-based control scheme considering practical constraints and computational overhead. We propose a fuzzy feedback controller where output is predicted with the delay of a unit sampling period. Analysis and design of the proposed controller is very easy, because it is synchronized with sampling time. Stability analysis is also possible when quantization exists in the implementation of fuzzy control architectures, and we show that if the trivial solution of the fuzzy control system without quantization is asymptotically stable, then the solutions of the fuzzy control system with quantization are uniformly ultimately bounded. Experimental results using a toy truck show that the proposed control system outperforms a conventional system.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 2006년도 하계종합학술발표회 논문 초록집
• /
• pp.286-286
• /
• 2006

• Journal of Advanced Marine Engineering and Technology
• /
• 제37권1호
• /
• pp.85-90
• /
• 2013

시간지연을 갖는 불안정한 시스템의 PID 제어는 적용하기가 쉽지 않은데 이는 복소평면의 우반부에 존재하는 극점으로 인한 불안정성과 시간지연의 영향 때문이다. 본 연구에서는 설계자가 제어환경에 따라 오버슈트나 상승시간 등을 미리 정의한 경우의 PID 제어기 설계 기법에 대해 고려한다. 이와 같이 제약성을 갖는 최적화 문제를 해결하기 위해 본 연구에서는 벌점전략이 결합된 RCGA를 사용한다. 이는 제약조건을 위배하면 그 정도에 따라 벌점을 부가하도록 벌점함수를 정의하고, 평가함수에 합하여 비제약성 최적화 문제로 변환하는 방법이다. 제안하는 방법은 불안정 FOPTD 시스템에 적용하고 시뮬레이션을 실시하여 그 유효성을 검토한다.