• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.88-94
• /
• 2006

In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.57.2-57
• /
• 2001

Timed token protocols inadequately provide periodic communication service, although this is crucial for hard real time systems. We propose an approach to guaranteeing periodic communication service on a timed token protocol network. In this approach, we allocate bandwidth to each node so that the summation of bandwidth allocations is Target Token Rotation Time (TTRT). If a node cannot consume the allocated time, the residual time can be used by other nodes for non-periodic service using a timer which contains the unused time value and is appended to the token. This approach can always guarantee transmission of real-time messages before their deadlines when the network utilization is less than 50%.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.12
• /
• pp.2480-2483
• /
• 2009

This paper presents an LMI-based method to design a integral sliding mode controller for a class of uncertain time-delay systems. Using LMIs we derive an existence condition of a sliding surface guaranteeing the asymptotic stability of the sliding mode dynamics. And we give a switching feedback control law. Our method is a generalization of the previous integral sliding mode control design methods. Since our method is based on LMIs, it gives design flexibility for combining various useful design criteria that can be captured in the LMI-based formulation. We also give LMI existence conditions of sliding surfaces guaranteeing a-stability or LQ performance constraint. Finally, we give a numerical design example to show the effectiveness of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1C
• /
• pp.157-165
• /
• 2004

Real-time(RT) object-oriented(OO) distributed computing is a form of RT distributed computing realized with a distributed computer system structured in the form of an object network. Several approached proposed in recent years for extending the conventional object structuring scheme to suit RT applications, are briefly reviewed. Then the approach named the TMO(Time-triggered Message-triggered Object)structuring scheme was formulated with the goal of instigating a quantum productivity jump in the design of distributed time triggered simulation. The TMO scheme is intended to facilitate the pursuit of a new paradigm in designing distributed time triggered simulation which is to realize real-time computing with a common and general design style that does not alienate the main-stream computing industry and yet to allow system engineers to confidently produce certifiable distributed time triggered simulation for safety-critical applications. The TMO structuring scheme is a syntactically simple but semantically powerful extension of the conventional object structuring approached and as such, its support tools can be based on various well-established OO programming languages such as C++ and on ubiquitous commercial RT operating system kernels. The Scheme enables a great reduction of the designers efforts in guaranteeing timely service capabilities of application systems. Start after striking space key 2 times.

• Journal of information and communication convergence engineering
• /
• v.1 no.1
• /
• pp.12-22
• /
• 2003

Real-time(RT) object-oriented(OO) distributed computing is a form of RT distributed computing realized with a distributed computer system structured in the form of an object network. Several approached proposed in recent years for extending the conventional object structuring scheme to suit RT applications, are briefly reviewed. Then the approach named the TMO (Time-triggered Message-triggered Object) structuring scheme was formulated with the goal of instigating a quantum productivity jump in the design of distributed time triggered simulation. The TMO scheme is intended to facilitate the pursuit of a new paradigm in designing distributed time triggered simulation which is to realize real-time computing with a common and general design style that does not alienate the main-stream computing industry and yet to allow system engineers to confidently produce certifiable distributed time triggered simulation for safety-critical applications. The TMO structuring scheme is a syntactically simple but semantically powerful extension of the conventional object structuring approached and as such, its support tools can be based on various well-established OO programming languages such as C++ and on ubiquitous commercial RT operating system kernels. The Scheme enables a great reduction of the designers efforts in guaranteeing timely service capabilities of application systems

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.6
• /
• pp.863-872
• /
• 2002

Real-time(RT) object-oriented(00) distributed computing is a form of RT distributed computing realized with a distributed computer system structured in the form of an object network. Several approached proposed in recent years for extending the conventional object structuring scheme to suit RT applications, are briefly reviewed. Then the approach named the TMO(Time-triggered Message-triggered Object) structuring scheme was formulated with the goal of instigating a quantum productivity jump in the design of distributed time triggered simulation. The TMO scheme is intended to facilitate the pursuit of a new paradigm in designing distributed time triggered simulation which is to realize real-time computing with a common and general design style that does not alienate the main-stream computing industry and yet to allow system engineers to confidently produce certifiable distributed time triggered simulation for safety-critical applications. The TMO structuring scheme is a syntactically simple but semantically powerful extension of the conventional object structuring approached and as such, its support tools can be based on various well-established 00 programming languages such as C++ and on ubiquitous commercial RT operating system kernels. The Scheme enables a great reduction of the designers efforts in guaranteeing timely service capabilities of application systems.

• ETRI Journal
• /
• v.29 no.2
• /
• pp.201-211
• /
• 2007

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.678-681
• /
• 1991

In this paper, we propose a robust linear time-invariant feedback compensator design methodology for multivariable system which have both matched and mismatched uncertainties. In order to attack the problem of designing robust compensators guaranteeing uniform ultimate boundedness of every closed-loop system response within an arbitrarily small ball centered at the zero state based solely on the knowledge of the upper norm-bounds of uncertainties, we use an approach based upon the comparison theorem which is an effective approach in studying augmented feedback control systems with both mismatched and matched uncertainties. Through the approach, we draw some sufficient conditions for robust stability, and we give a simple example.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.12
• /
• pp.1208-1211
• /
• 2010

We propose a variable structure control design method for a class of multivariable uncertain state-delayed systems which can be represented by polytopic models. In terms of LMIs, we derive a sufficient condition for the existence of a linear sliding surface guaranteeing the asymptotic stability of the sliding mode dynamics. We parameterize the sliding surface by using the solution of the LMI existence condition. We also give a switching feedback control strategy guaranteeing stable sliding mode. By using a numerical example, we show that our method supplements the existing results and it can be better than the existing results.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.2
• /
• pp.115-121
• /
• 2022

This paper proposes a distributed model predictive formation control algorithm for a group of unmanned ground vehicles (UGVs) with guaranteeing collision avoidance between UGVs. Generally, the model predictive control based formation control has a disadvantage in that it takes a long time to compute control inputs when considering collision avoidance between UGVs. In this paper, in order to overcome this problem, the formation control algorithm is implemented in a distributed manner so that it could be individually controlled. Also, a collision-avoidance method considering real-time is proposed. The proposed formation control algorithm is implemented based on robot operating system (ROS), open source-based middleware. Through the various simulation tests, it is confirmed that the formation control of five UGVs is successfully performed while avoiding collisions between UGVs.