• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.2
• /
• pp.121-127
• /
• 1999

In this paper, we present robust reliable H$\infty$ controller design methods of continuous and discrete uncertain time delay systems using LMI (linear matrix inequality) technique, respectively. Also the existence conditions of state feedback control are proposed . Using some changes of variables and Schur complements, the obtained sufficient conditions are transformed into an LMI form. The closed loop system by the obtained controller is quadratically stable with H$\infty$ norm bound for all admissible uncertainties, time delay, and all actuator failures occurred within the prespecified set. We show the validity of the proposed method through numerical example.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.877-888
• /
• 2008

This paper deals with some new nonlinear delay and weakly singular integral inequalities of Gronwall-Bellman type. These results generalize the inequalities discussed by Xiang and Kuang [19]. Several other inequalities proved by $Medve{\check{d}}$ [15] and Ou-Iang [17] follow as special cases of this paper. This work can be used in the analysis of various problems in the theory of certain classes of differential equations, integral equations and evolution equations. A modification of the Ou-Iang type inequality with delay is also treated in this paper.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.6
• /
• pp.554-557
• /
• 2008

We analyze the stability property of a class of nonlinear time-delay systems with time-varying delays. We present a time-delay independent sufficient condition for the global asymptotic stability. In order to prove the sufficient condition, we exploit the inherent property of the considered systems instead of applying the Krasovskii or Razumikhin stability theory that may cause the mathematical difficulty of analysis. We prove the sufficient condition by constructing two sequences that represent the lower and upper bound variations of system state in time, and showing the two sequences converge to an identical point, which is the equilibrium point of the system. The simulation results illustrate the validity of the sufficient condition for the global asymptotic stability.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.6
• /
• pp.581-588
• /
• 2007

In this paper, we propose a delayed feedback guaranteed cost controller design method for linear time-delay systems with norm-bounded parameter uncertainties and nonlinear perturbations. A quadratic cost function is considered as the performance measure for the given system. Based on the Lyapunov method, an LMI optimization problem is formulated to design a controller such that the closed-loop cost function value is not more than a specified upper bound for all admissible system uncertainties and nonlinear perturbations. Numerical example show the effectiveness of the proposed method.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1491-1497
• /
• 2007

This paper considers robust and non-fragile guaranteed cost controller design method for descriptor systems with parameter uncertainties and time delay, and static state feedback controller with gain variations. The existence condition of controller, the design method of controller, the upper bound to minimize guaranteed cost function, and the measure of non-fragility in controller are proposed using linear matrix inequality (LMI) technique, which can be solved efficiently by convex optimization. Therefore, the presented robust and non-fragile guaranteed cost controller guarantees the asymptotic stability and non-fragility of the closed loop systems in spite of parameter uncertainties, time delay, and controller fragility.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.960-967
• /
• 2008

This paper shows that design of a robustly stable repetitive control system is equivalent to that of a feedback control system for an uncertain linear time-invariant system satisfying the well-known robust performance condition. Once a feedback controller is designed to satisfy the robust performance condition, the feedback controller and the repetitive controller using the performance weighting function robustly stabilizes the repetitive control system. It is also shown that we can obtain a steady-state tracking error described in a simple form without time-delay element if the robust stability condition is satisfied for the repetitive control system. Moreover, using this result, a sufficient condition is provided, which ensures that the least upper bound of the steady-state tracking error generated by the repetitive control system is less than or equal to the least upper bound of the steady-state tracking error only by the feedback system.

• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.33-41
• /
• 2007

With the development of the multicast technology, the realtime strategy among the group applications using the multicast routing is getting more important. An essential factor of these real-time application is to optimize the Delay- and delay Variation-Bounded Multicast Tree(DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as NP-complete problem. The representative algorithms for the problem are DVMA, DDVCA, and so on. In this paper, we show that the proposed algorithm outperforms any other algorithm. The efficiency of our algorithm is verified through the prerformance evaluation and the enhancement is up to about 9% to 29% in terms of the multicast delay variation. The time complexity of our algorithm is $O(mn^2)$M.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2509-2528
• /
• 2012

Time division multiple access (TDMA) is a widely used media access control (MAC) technique that can provide collision-free and reliable communications, save energy and bound the delay of packets. In TDMA, energy saving is usually achieved by switching the nodes' radio off when such nodes are not engaged. However, the frequent switching of the radio's state not only wastes energy, but also increases end-to-end delay. To achieve high energy efficiency and low delay, as well as to further minimize the number of time slots, a multi-objective TDMA scheduling problem for industrial wireless mesh networks is presented. A hybrid algorithm that combines genetic algorithm (GA) and simulated annealing (SA) algorithm is then proposed to solve the TDMA scheduling problem effectively. A number of critical techniques are also adopted to reduce energy consumption and to shorten end-to-end delay further. Simulation results with different kinds of networks demonstrate that the proposed algorithm outperforms traditional scheduling algorithms in terms of addressing the problems of energy consumption and end-to-end delay, thus satisfying the demands of industrial wireless mesh networks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.135-139
• /
• 2014

Opportunistic routing was originally introduced in various multihop network environments to reduce the number of hops in such a way that, among the relays that decode the transmitted packet for the current hop, the one that is closest to the destination becomes the transmitter for the next hop. Unlike the conventional opportunistic routing case where there is a single active S-D pair, for an ad hoc network in the presence of fading, we investigate the performance of parallel opportunistic multihop routing that is simultaneously performed by many source-destination (S-D) pairs to maximize the opportunistic gain, thereby enabling us to obtain a logarithmic gain. We first analyze a cut-set upper bound on the throughput scaling law of the network. Second, computer simulations are performed to verify the performance of the existing opportunistic routing for finite network conditions and to show trends consistent with the analytical predictions in the scaling law. More specifically, we evaluate both power and delay with respect to the number of active S-D pairs and then, numerically show a net improvement in terms of the power-delay trade-off over the conventional multihop routing that does not consider the randomness of fading.