• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1770-1776
• /
• 1999

Mobile agent technology has received great attention in the last years as a new paradigm for distributed processing systems. Mobile agents are autonomous objects that can migrate from node to node of a computer network. But, due to hosts or communication nodes failures, mobile agents may be blocked or crashes even if there are other nodes available that could continue processing. To cope with above, this paper proposes an efficient policy by introducing the path reordering and backward recovery to ensure the migration of mobile agents. The proposed migration policy will be provided the migration reliability of mobile agents as autonomously as possible, and it is implemented in the MOS, a mobile object system model developed by the Java language.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.313-320
• /
• 2003

This paper design and implements a synchronized agent mechanism that be able to synchronize SFT (Slow Frequency Transaction) data among e-business processes in distributed environment. This synchronized agent system is adopted to use mobile agent to guarantee the interoperability of the distributed processes and to solve some problems at the client/server architecture and proposes a policy to synchronize data of e-business processes on the any platforms of distributed heterogeneous systems. The proposed synchronization policy is based on the time-stamp transaction with the system priority on the unicasting transportation.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1084-1098
• /
• 2005

In this paper, we propose a migration technique for autonomous mobile agents suitable to dynamic environments. The proposed migration technique dynamically creates the itinerary of agents that considers states of networks and systems. In the migration of the agent, it first sends prefetching message to the next system. The system receives necessary data for migration in advance. Through this, we reduce the amount of the sending data and save the time for creating the instance of the agent. And it improves the execution efficiency by using the checkpoint-based recovery method that does not execute the agent again and recovers the process states even though the errors take place. To show superiority of the proposed technique, we compare the proposed method with the existing methods through various simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.8
• /
• pp.528-537
• /
• 2014

Wireless Sensor Network(WSN) is a network which consists of sensor nodes(SNs) in data collection area. It is hard for the SNs to replace battery. Thus energy and transfer efficiency is important because the energy is limited. In this paper, we propose energy-efficient data collection algorithm for wireless sensor networks by using mobile agent in distance-based cluster structure. For avoid collisions and guarantee low latency, make distance-based topology and build cluster by the topology. For performance comparison of the proposed algorithm, compare with existing mobile agent algorithm. When network constructed by 300 nodes, proposed algorithm has performance increase than existing algorithm(GCF, LCF, TBID) in network lifetime 194, 124.6, 1.46 times each and data merging energy efficiency 87.5%, 85%, 45% each.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2004.11a
• /
• pp.242-248
• /
• 2004

Personalized reminder systems have to identify the user's current needs dynamically and proactively based on the user's current context. However, need identification methodologies and their feasible architectures for personalized reminder systems have so far been rare. Hence, this paper aims to propose a proactive need identification mechanism by applying agent and semantic web technologies and RFID-based context subsystem for a personalized reminder system, which is one of the supporting systems for a robust ubiquitous service support environment. We have created a prototype system, RFID-based NAMA (Need Aware Multi-Agent), to demonstrate the feasibility of the methodology and of the mobile settings framework that we propose in this paper. NAMA considers the context, user profile with preferences, and information about currently available services, to discover the user's current needs and then link the user to a set of services, which are implemented as web services.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.359-368
• /
• 2005

Personalized reminder systems have to identify the user's current needs dynamically and proactively based on the user's current context. However, need identification methodologies and their feasible architectures for personalized reminder systems have been so far rare. Hence, this paper aims to propose a proactive need awaring mechanism by applying agent, semantic web technologies and RFID-based context subsystem for a personalized reminder system, which is one of the supporting systems for a robust ubiquitous service support environment. Rescorla-Wagner model is adopted as an underlying need awaring theory. We have created a prototype system. called NAMA(Need Aware Muiti-Agent)-RFID. to demonstrate the feasibility of the methodology and of the mobile settings framework that we propose in this paper Moreover, to test if the proposed system works in terms of scalability, a simulation was performed and the results are described.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.23-26
• /
• 2005

This paper presents the load balance of Mobile IP in wireless systems. Mobile IP can support wireless users with continuous network connections while changing locations. If a failure occurs in a mobility agent, the wireless users located in the coverage area of the fault mobility agent will lose their network connections. To tolerate the failure of mobility agents, this paper proposes the method of an efficient approach to reduce severe overload.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.545-561
• /
• 2007

Location management and message delivery protocol is fundamental to the further development of mobile agent systems in a multi-region mobile agent computing environment in order to control mobile agents and guarantee message delivery between them. However, previous works have some problems when they are applied to a multi-region mobile agent computing environment. First, the cost of location management and message delivery is increased relatively. Second, a tracking problem arises. finally, cloned mobile agents and parent-child mobile agents do not get dealt with respect to location management and message delivery. In this paper, we present a HB (Home-Blackboard) protocol, which is a new location management and message delivery protocol in a multi-region mobile agent computing environment. The HB protocol places a region server in each region and manages the location of mobile agents by using intra-region migration and inter-region migration. It also places a blackboard in each region server and delivers messages to mobile agents when a region server receives location update form them. The HB protocol can decrease the cost of location update and message passing and solve the tracking problem with low communication cost. Also, this protocol deals with the location management and message passing of cloned mobile agents and parent-child mobile agents, so that it can guarantee message delivery of these mobile agents and pass messages without passing duplicate messages.

• The Journal of Korea Robotics Society
• /
• v.12 no.3
• /
• pp.339-349
• /
• 2017

In this paper, we present a finite-time sliding mode control (FSMC) with an integral finite-time sliding surface for applying the concept of graph theory to a distributed wheeled mobile robot (WMR) system. The kinematic and dynamic property of the WMR system are considered simultaneously to design a finite-time sliding mode controller. Next, consensus and formation control laws for distributed WMR systems are derived by using the graph theory. The kinematic and dynamic controllers are applied simultaneously to compensate the dynamic effect of the WMR system. Compared to the conventional sliding mode control (SMC), fast convergence is assured and the finite-time performance index is derived using extended Lyapunov function with adaptive law to describe the uncertainty. Numerical simulation results of formation control for WMR systems shows the efficacy of the proposed controller.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.538-544
• /
• 2005

The service supporting structure for users in ubiquitous computing environment requires technology that divides efficiently resources shared around users according to users context. So, needs research that analyze service items and resources that is offered according to users context information and divide adaptively necessary service and resources. Therefore, in this paper we proposes an intelligent P2P mobile agent that recognizes users context using portable mobile devices and is available for intelligent service by sharing serviced item according to users' context. The proposed structure removes monopoly for specific resources, and supports effective users context-awareness and service.