• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.476-479
• /
• 2008

Wireless Sensor Network typically incorporates various real time applications that must meet timing constraints under severe resource limitations. Due to the high data rate and burst traffic for that type of applications, occurrence of congestion is very common. Ensuring the end-to-end deadline under congested scenario is quite challenging. In this paper we propose a hop-by-hop rate control algorithm which avoids the congestion as well as ensures that the real time traffic will meet the end-to-end deadline by guaranteeing the meeting of local deadline at intermediate hop. Finally, simulation has demonstrated the effectiveness of our approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5174-5190
• /
• 2016

Recent years have witnessed an explosive growth of mobile devices, mobile cloud computing services offered by these devices and the remote clouds behind them. In this paper, we noticed ultra-low latency service, as a type of mobile cloud computing service, requires extremely short delay constraints. Hence, such delay-sensitive applications should be satisfied with strong QoS guarantee. Existing solutions regarding this problem have poor performance in terms of throughput. In this paper, we propose an end-to-end bandwidth resource reservation via software defined scheduling inspired by the famous SDN framework. The main contribution of this paper is the end-to-end resource reservation and flow scheduling algorithm, which always gives priority to delay sensitive flows. Simulation results confirm the advantage of the proposed solution, which improves the average throughput of ultra-low latency flows.

• Electronics and Telecommunications Trends
• /
• v.38 no.2
• /
• pp.36-45
• /
• 2023

Segment routing (SR) is a source-based routing architecture in which a node steers packets adhering to service and topological requirements. Using programmable segments, SR enables end-to-end service connectivity to satisfy the network constraints of various services. SR can be implemented with both MPLS and IPv6 dataplanes. This survey presents the overview of SR for IPv6 dataplane (SRv6), network programming technologies based on SRv6, and the SR deployment status.

• Journal of the Korean Society of Safety
• /
• v.11 no.2
• /
• pp.116-121
• /
• 1996

On the stability of Timoshenko cantilever beam subjected to a follower force, the influence of the characteristics of elastic constraints at the free end Is studied. The equations of motion and boundary conditions of this nonconservative elastic system are estabilished by using the Hamilton's principle. Upon evaluation of the stability of this system, the effect of shear deformation and rotatory inertia is considered in calculation. Using cowper's formulae Timoshenko's shear coefficient K'are determined. From this imvestigation it is found that the constrain parameter have an appreciable stabilizing effect in this nonconservative system. Moreover, it is obvious that the small values of K'decrease the flutter load of this system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• Proceedings of the KWS Conference
• /
• 2006.10a
• /
• pp.89-91
• /
• 2006

An analysis of a multi-pin remote welding for a DUPIC fuel fabrication was made to establish the optimum welding processes in a hot cell environment. An initial investigation for hands-on fabrication outside the hot cell was performed, and the constraints of a hot cell welding were considered. Preliminary welding performances to improve the RW process were also examined. The RW process was determined to be the best in a hot cell environment for joining the end plate to the end caps. This paper presents an outline of the developed RW machine for a DUPIC fuel fabrication and compares the characteristics of a Zr-4 end plate welding by using electrical resistance and LB methods. The weld nuggets of RW specimens and torque strengths of resistant and LB welded zones were also investigated.

• The Journal of Korea Robotics Society
• /
• v.17 no.1
• /
• pp.32-39
• /
• 2022

Since the mobile platform and the manipulator mounted on it move at the same time in a mobile manipulator, the risk of mutual collision increases. Most of the studies on collision avoidance of mobile manipulators cannot be applied to differential drive type mobile platforms or the end-effector tends to deviate from the desired trajectory for collision avoidance. In this study, a collision avoidance algorithm based on null space projection (CANS) that solves these two problems is proposed. To this end, a modified repulsive force that overcomes the non-holonomic constraints of a mobile platform is generated by adding a virtual repulsive force in the direction of its instantaneous velocity. And by converting this repulsive force into a repulsive velocity and applying it to the null space, the end-effector of the robot avoids a collision while moving along its original trajectory. The proposed CANS algorithm showed excellent performance through self-collision avoidance tests and door opening tests.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.43-48
• /
• 2022

With the recent performance improvement of mobile devices as well as the emergence of various applications, not only interactive tasks but also real-time tasks are rapidly increasing. As real-time tasks have deadline requirements, resource management policies used in the conventional time-sharing systems have limitations in satisfying real-time constraints. In this paper, we examine how to efficiently manage resources while satisfying the constraints of real-time tasks through end-to-end resource management of CPU, memory, and storage when interactive and real-time tasks are executed concurrently on a mobile device. Instead of suggesting complicated resource management policies, we focus on examining the basic concepts necessary for each resource management. Specifically, we first look at basic policies such as assigning dedicated CPU cores for real-time tasks, allocating a certain working set of real-time tasks in memory, and using fast storage without context switch in I/O. We then consider how these basic policies can be adopted efficiently.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.12
• /
• pp.165-172
• /
• 1995

Many algorithms to enhance a speed performance of a robot have been studied, but it's rare to consider disign aspect of a robot arm for time optimal problem. In this paper, section demensions of a robot arm and a velocity profile of an end-effector were optimally designed to minimize the cycle time. Capacity of actuators, deflections of end-effector, and a fundamental natural frequency of the robot arm were constrained in optimal design. For a given path with a trapezoidal velocity profile, torques of each joint were calculated using the inverse kinematics and dynamics. For the SCARA type robot which is mainly used for assembly tasks, the time optimal design of each robot arm id presented with the above constraints.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.486-490
• /
• 1993

In addtion to a basic motion task, redundant manipulators can achieve some additional tasks by optimizing proper performance criteria. Some of performance criteria can be transformed to inequality constraints. So the redundancy resolving problem can be reformulated as a local optimization problem with equality constraints for the end effector and inequality constraints for some performance criteria. In this article, we propose a method for solving the inverse kinematics of a manipulator with redundancy using the Kuhn-Tucker theorem to incorporate inequality constraints. With proper choice of inequality constraints, the proposed method gives a way of optimizing multiple criteria in redundant manipulators.