• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.114-117
• /
• 2003

Recently, the aging society is a serious problem; we paid attention to the welfare and a disaster prevention cyber city. In this research, we propose the validity of Safe Human Cooperation Mobility System in Collaboration with Cyber City, and show Vehicle Warehousing Support System as an example.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.

• Journal of Labour Economics
• /
• v.29 no.2
• /
• pp.145-169
• /
• 2006

This study analyze the effect on wage, labor mobility by using Craft II Class certification out of National skill certification. In this article, we used the parametric and nonparametric method. In the former we used IV that the fraction of certification by occupation by firm scale to solve the selection problem. In the latter, it's used matching method and kernel regression. The paper shows that certification effect on wage has about 5.1~9.9%. The result of analysis between certification and labor mobility indicates better certification effects on long term tenure to the same firm than certification effects on wage from labor mobility. Also, we knew that the employee which have no certification relative is difficult to be established in the same workplace.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.29-41
• /
• 2008

Currently, IETF MANEMO(Mobile Adhoc for NEMO) working group is working on standardization supporting internal routing in nested NEMO networks. Nested NEMO has a independent topology feature that Mobile IP and basic NEMO protocol did not caused. This is the reason that causes exceptional mobility pattern. Such mobility patterns also trigger each other reconfiguration requirements. This paper classified and analyzed probable new mobility patterns in nested NEMO network. In concludion, we derived configuration problem from the new mobility patterns and suggested differential reconfiguration requirements through analytical approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2B
• /
• pp.82-89
• /
• 2008

Mobile IP is the basic solution to provide host mobility, whereas network mobility refers to the concept of collective mobility of a set of nodes. In a network mobility scenario, mobile networks can be nested in a hierarchical form. That situation is referred to a nested mobile network Nested mobile networks exhibit the pinball routing problem, which becomes worse in proportion to the number of nested levels in the hierarchy. In this paper, we propose a routing optimization scheme having backward compatibility to the basic network mobility protocol and concerning heterogeneity of nested mobile network, also we perform comparison and analysis of proposed schemes.

• Journal of Internet Computing and Services
• /
• v.24 no.2
• /
• pp.1-10
• /
• 2023

The Multi-access Edge Computing (MEC) paradigm equips network edge telecommunication infrastructure with cloud computing resources. It seeks to transform the edge into an IT services platform for hosting resource-intensive and delay-stringent services for mobile users, thereby significantly enhancing perceived service quality of experience. However, erratic user mobility impedes seamless service continuity as well as satisfying delay-stringent service requirements, especially as users roam farther away from the serving MEC resource, which deteriorates quality of experience. This work proposes a deep reinforcement learning based service mobility management approach for ensuring seamless migration of service instances along user mobility. The proposed approach focuses on the problem of selecting the optimal MEC resource to host services for high mobility users, thereby reducing service migration rejection rate and enhancing service availability. Efficacy of the proposed approach is confirmed through simulation experiments, where results show that on average, the proposed scheme reduces service delay by 8%, task computing time by 36%, and migration rejection rate by more than 90%, when comparing to a baseline scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.12
• /
• pp.1679-1686
• /
• 2019

The main purpose of this research is to propose an approach for solving the packet loss problem by quickly adapting to topology change when nodes move in RPL-based IoT environment. In order to enhance mobility, every node is aware of the mobility of its neighbor nodes and quantifies the mobility level based on the number of control messages and all received packets. According to the mobility level, the DIO timer is changed. The proposed approach allows nodes to change their DIO timers according to their mobility levels to adapt topology changes and update paths to the sink. The performance of the proposed approach is evaluated using a Contiki-based Cooja simulator in various moving speeds. The simulation results show that the proposed approach copes with mobility scenarios better than the standard RPL by ascertaining that the packet delivery ratio is improved by 31.03%.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.7 no.1
• /
• pp.9-21
• /
• 1998

This paper a new solution approach to moving obstacle avoidance problem of a mobile robot. A new concept avoidability measure (AVM) is defined to describe the state of a pair of a robot and an obstacle regarding the collision between them. As an AVM, virtual distance function (VDF), is derived as a function of the distance from the obstacle to the robot and outward speed of the obstacle relative to the robot. By keeping the virtual distance above some positive limit value, the robot avoids the obstacle. In terms of the VDF ,an artificial potential field is constructed to repel the robot away from the obstacle and to attract the robot toward a goal location. At every sampling time, the artificial potential field is updated and the force driving the robot is derived from the gradient of the artificial potential field. The suggested algorithm drives the robot to avoid moving obstacles in real time. Since the algorithm considers the mobility of the obstacle as well as the distance, it is effective for moving obstacle avoidance. Some simulation studies show the effectiveness of the proposed approach.

• ETRI Journal
• /
• v.40 no.4
• /
• pp.446-457
• /
• 2018

Robot navigation allows robot mobility. Therefore, mobility is an area of robotics that has been actively investigated since robots were first developed. In recent years, interest in personal service robots for homes and public facilities has increased. As a result, robot navigation within the home environment, which is an indoor environment, is being actively investigated. However, the problem with conventional navigation algorithms is that they require a large computation time for their building mapping and path planning processes. This problem makes it difficult to cope with an environment that changes in real-time. Therefore, we propose a humanoid robot navigation algorithm consisting of an image processing and optimization algorithm. This algorithm realizes navigation with less computation time than conventional navigation algorithms using map building and path planning processes, and can cope with an environment that changes in real-time.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.20 no.2
• /
• pp.311-322
• /
• 1996

To accomodate workers with efficient mobility, coveralls were redesigned, construted and evaluated. In this study, especially, image processing techniques were applied to the evaluation stage, to quantify thE ease of body movement. For the initial observation stage, car-center workers were interviewed and their movements were videotaped. By analyzing the videotape, the area of stress and strains on the work clothes were marked on the figure chert and considered for the pattern making. 4DM cut pattern were applied to the upper part of the work clothes and other alternations were made throughout the problem area. Honey comb slashes were made on the problem area of the original and newly designed coveralls. Open areas of honey comb slashes due to body movement between the original and newly designed coveralls were analyzed by image processing techniques. Other objective and subjective evaluation of newly designed coveralls was compared with the original one. Overall evaluation of functionally designed coveralls was appered to be positive and the image processing techiques were useful methology to quantify the amount of stress in this study.