• 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.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.965-968
• /
• 2000

We develop the Multi-Mobile-agents system for realizing effective cooperative task processing in the network environment. In this system, agents are separated / fused by the Place and migrated to another computer. A Place can assign agents to other places by agents migration to be flat the time to execute agents’ action. In this paper, the effectiveness of this system is shown by experimental results applying an agent given simple task.

• Journal of Information Processing Systems
• /
• v.11 no.1
• /
• pp.148-164
• /
• 2015

The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents are used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5S
• /
• pp.1657-1665
• /
• 2000

Mobile agents based e-commerce system has many advantage than traditional e-commerce-information gathering on goods, price settlement and payment, delivery of the goods purchased, and so on. However, due to the security vulnerability that stems from mobile agent's mobility, mobile agents based e-commerce system has additional security problems. Therefore, in order to do e-commerce securely in th system, first of al the security issues on mobile agents must be addressed. It this paper, we propose a mobile agent transfer protocol that provides confidentiality and integrity of mobile agent in transit and mutual authentication for communicating hosts. We further show the security of the protocol against many possible attacks. Also, we suggest the location management mechanism of mobile agents based on the trust center. This mechanism is capable of finding their locations transparently and detecting mobile agent clones.

• Journal of Intelligence and Information Systems
• /
• v.6 no.1
• /
• pp.113-128
• /
• 2000

This paper presents a first year report of an ongoing multi-year project to develop a systolic parallel simulation system for dynamic traffic assignment. The fundamental approach to the simulation is systolic parallel processing based on autonomous agent modeling. Agents continuously act on their own initiatives and access to database to get the status of the simulation world. Various agents are defined in order to populate the simulation world. In particular existing modls and algorithm were incorporated in designing the behavior of relevant agents such as car-following model headway distribution Frank-Wolf algorithm and so on. Simulation is based on predetermined routes between centroids that are computed off-line by a conventional optimal path-finding algorithm. Iterating the cycles of optimization-then-simulation the proposed system will provide a realistic and valuable traffic assignment. Gangnum-Gu district in Seoul is selected for the target are for the modeling. It is expected that realtime traffic assignment services can be provided on the internet within 3 years.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2514-2519
• /
• 2000

As applications of mobile agent become manifold, it is needed that the agent collaboration using group agents. This collaboration needs a lot of communications among agents for informations sharing and work coordination. In this paper we propose CMP for which efficient collaboration work between group agent. CMP is synchronous or asynchronously performs flexible information transfer among agents. Also, It can perform efficiently in group agent model because proposed methods provide not olny one to one but also many to many communication.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1332-1341
• /
• 1999

Rapid expansion of network and increment of computer system access cause computer security to be an important issue. Hence, the researches in intrusion detection system(IDS)are active to reduce the risk from hackers. Considering IDS, we propose a new IDS model(DABIDS : Distributed Agent Based Intelligent intrusion Detection System) based on distributed intrusion detecting agents. The DABIDS dynamically collects intrusion behavior knowledge from each agents when some doubtable behaviors of users are detected and make new agents codes using intrusion scenario data base, and broadcast the detector codes to the distributed intrusion detecting agent of all node. This DABIDS can efficiently solve the problem to reduce the overhead for training detecting agent for intrusion behavior patterns.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3477-3489
• /
• 1999

Our study is focused on a multi-agent system which provides the efficient teleconferencing facility with the help of the intelligent agents who allow the participants to minimize the effort to call meeting. Our system has multi-agent architecture and use the KQML to communicate among agents. Communicating through the KQML allows us to overcome the heterogeneity when we add new agents into the system. In this paper, we propose a multi-agent structure for the teleconferencing system based on the web and describe in detail the now or the KQML messages among agents.

• Korea Information Processing Society Review
• /
• v.7 no.1
• /
• pp.56-62
• /
• 2000

• Journal of Information Processing Systems
• /
• v.3 no.2
• /
• pp.43-53
• /
• 2007

The use of agent paradigm in today's applications is hampered by the security concerns of agents and hosts alike. The agents require the presence of a secure and trusted execution environment; while hosts aim at preventing the execution of potentially malicious code. In general, hosts support the migration of agents through the provision of an agent server and managing the activities of arriving agents on the host. Numerous studies have been conducted to address the security concerns present in the mobile agent paradigm with a strong focus on the theoretical aspect of the problem. Various proposals in Intrusion Detection Systems aim at securing hosts in traditional client-server execution environments. The use of such proposals to address the security of agent hosts is not desirable since migrating agents typically execute on hosts as a separate thread of the agent server process. Agent servers are open to the execution of virtually any migrating agent; thus the intent or tasks of such agents cannot be known a priori. It is also conceivable that migrating agents may wish to hide their intentions from agent servers. In light of these observations, this work attempts to bridge the gap from theory to practice by analyzing the security mechanisms available in Aglet. We lay the foundation for implementation of application specific protocols dotted with access control, secured communication and ability to detect tampering of agent data. As agents exists in a distributed environment, our proposal also introduces a novel security framework to address the security concerns of hosts through collaboration and pattern matching even in the presence of differing views of the system. The introduced framework has been implemented on the Aglet platform and evaluated in terms of accuracy, false positive, and false negative rates along with its performance strain on the system.