• Journal of Information Technology Applications and Management
• /
• v.23 no.2
• /
• pp.61-80
• /
• 2016

The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.795-800
• /
• 2000

In a parallel manipulator, there are three constraints that determine workspace: link length constraint, passive joint angle constraint, and interference among links. Generally, the link length constraint is the most dominant. The interference among links is, however, also an important parameter in designing a desired parallel manipulator. In this study, the interference among links is mathematically modeled by considering the links as a line and a cylinder of radius of twice the link radius, and a new algorithm is suggested to check if arbitrary two links interfere each other or not. The workspace of a cubic parallel manipulator is illustrated in a 2D space satisfying the three constraints.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.815-818
• /
• 2006

In the global Internet, a constraint-based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint-based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link-usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.7
• /
• pp.27-33
• /
• 2001

• Journal of the Korean Society for Precision Engineering
• /
• v.29 no.1
• /
• pp.64-71
• /
• 2012

In this paper, a parallel manipulator is comprised of two sliders and four links. Sliders execute a linear reciprocating motion depending on parallel guides and make the connected links rotate. A couple of links connected by sliders do coupling motion. The end-effector called a link tip has orientation angle. Through the kinematics analysis of this manipulator, we found displacement, velocity and acceleration using direct and inverse kinematics. We used equations that derived from this analysis and determined five constraint conditions. These conditions had much to do with rotation states of links, the relative relation of link length and coupling motion state. To verify those, we suggest a new algorithm regarding constraint conditions of a manipulator. With the result which performed the algorithm, we found out that operation range of coupled links was limited by relative relation of link length and that manipulator was not able to carry out a series of link motion, in case of being the link vertical between two parallel guides.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.7
• /
• pp.1270-1276
• /
• 2016

This paper proposes the controller design for regulation control of two-link robot arm using sum of squares (SOS) control method that takes into account the input constraint. The existing studies of two link robotic arm system used a linear model of all the non-linearity of the system is linearized. For a linear controller, since the model of the system is simplified, it is possible to design a controller in consideration of constraints on the disturbance. However, there is a limit to the performance using a linearized model for a system with a complex nonlinear properties. To compensate for this in the case of using a fuzzy LMI method, it is necessary to have a large number of linear models and thus there is a disadvantage that the system becomes complicated. To solve these problems, we represents a two-link robot arm system with a polynomial model using a Taylor series expansion and design the controller considering the case where the magnitude of the control input is limited using SOS method. We demonstrate by simulations the feasibility of the proposed algorithm.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.4
• /
• pp.289-295
• /
• 2002

In this paper, a linear matrix inequality(LMI)-based robust control method, which combines model predictive control(MPC) with the feedback linearization(FL), is presented for constrained nonlinear systems with parameter uncertainty. The design procedures consist of the following 3 steps: Polytopic description of nonlinear system with a parameter uncertainty via FL, Mapping of actual input constraint by FL into constraint on new input of linearized system, Optimization of the constrained MPC problem based on LMI. To verify the performance and usefulness of the control method proposed in this paper, some simulations with application to a flexible single link manipulator are performed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.10
• /
• pp.2543-2554
• /
• 1993

In this paper, the kinematic and dynamic analyses of spatial complex kinematic chain are studied. Through the new method both using the set of identification numbers and applying the DenavitHartenberg link representation method to the spatial complex kinematic chain, the kinematic configuration of the chain is represented. Some link in the part of closed chain being fictitiously cutted, the complex kinematic chain is transformed to the branched chain. The kinematic constraint equations are derived from the constraint conditions which the cutted sections of the link have to satisfy. And the joint variables being partitioned in the independent joint variables and the dependent joint variables, the dependent variables are calculated from the independent variables by using the Newton-Raphson iterative method and the pseudoinverse matrix. The equations of motion are derived under the independent joint variables by using the principle of virtual work. Algorithms for dynamic analysis are presented and simulations are done to verify accuracy and efficiency of the algorithms.