Mobile Agent Code Research Articles

Communication Network with Secure, Reputable Mobile Agent Structure

Abstract: The proposed multiphase security model for mobile agents appears to address a critical issue in their mainstream deployment. The use of symmetric key cryptography is a sensible choice for securing mobile agent code and data, as it is more efficient than asymmetric key cryptography. The focus on defending against a meet-in-the-middle attack is also appropriate, as this is a common type of attack that mobile agents are vulnerable to. However, it would be helpful to provide more details about the specific authenticated encryption mechanism that will be used. This will help to evaluate the effectiveness of the proposed model and ensure that it is robust enough to defend against various types of attacks. It is also important to consider the energy consumption of the proposed security model, as mobile devices typically have limited battery life. Therefore, the model should be designed in a way that minimizes energy consumption while maintaining the required level of security. Overall, the proposed multiphase security model appears to be a step in the right direction for addressing the security issues associated with mobile agents. However, it is important to ensure that it is properly implemented and thoroughly tested to ensure its effectiveness and efficiency

A DTM Research based on the strategic process

This paper analyzes the reasons for the formation of security problems in mobile agent systems, and analyzes and compares the security mechanisms and security technologies of existing mobile agent systems from the perspective of blocking attacks. The host guiding mobile agent shielding technology is sorted out, a technique to intensify the reliability shield of mobile representative (named as IEOP procedure) is proposed. The method first encrypts the mobile agent code using the encryption function, and then encapsulates the encrypted mobile agent with the improved EOP protocol IEOP, and then traces the suspicious execution result. Experiments show that using this method can block most malicious attacks on mobile agents, and can protect the integrity and confidentiality of mobile agents, but the increment of mobile agent tour time is not large.

Research on mobile Internet mobile agent system dynamic trust model for cloud computing

This paper analyzes the reasons for the formation of security problems in mobile agent systems, and analyzes and compares the security mechanisms and security technologies of existing mobile agent systems from the perspective of blocking attacks. On this basis, the host protection mobile agent protection technology is selected, and a method to enhance the security protection of mobile agents (referred to as IEOP method) is proposed. The method first encrypts the mobile agent code using the encryption function, and then encapsulates the encrypted mobile agent with the improved EOP protocol IEOP, and then traces the suspicious execution result. Experiments show that using this method can block most malicious attacks on mobile agents, and can protect the integrity and confidentiality of mobile agents, but the increment of mobile agent tour time is not large.

Research on mobile Internet mobile agent system dynamic trust model for cloud computing

This paper analyzes the reasons for the formation of security problems in mobile agent systems, and analyzes and compares the security mechanisms and security technologies of existing mobile agent systems from the perspective of blocking attacks. On this basis, the host protection mobile agent protection technology is selected, and a method to enhance the security protection of mobile agents (referred to as IEOP method) is proposed. The method first encrypts the mobile agent code using the encryption function, and then encapsulates the encrypted mobile agent with the improved EOP protocol IEOP, and then traces the suspicious execution result. Experiments show that using this method can block most malicious attacks on mobile agents, and can protect the integrity and confidentiality of mobile agents, but the increment of mobile agent tour time is not large.

Multi Parameter Based Robust and Efficient Rogue AP Detection Approach

Wireless LANs are an integral part of todays globalized economy. WLANs are growing and so are their threats. The main security threat in a wireless network is a malicious or rogue access point (RAP). It is also observed that out of total available access points (AP) on the network, almost 20% APs are unauthorized. Existing research methods use diverse parameters such as clock skew, wireless traffic monitoring, encryption, authorization, timing based approach, RSS analysis, bottleneck bandwidth analysis, and sequential hypothesis test. The limitations of the existing methods include; weak clock skew solution assumption; variable inter packet arrival time; mobile agent code cannot be installed on all nodes; MAC and SSID address can be spoofed; variable received signal strength; the system will not work properly if central server is down. These limitations have motivated us to develop a multi parameter based technique to improve the detection of RAP in WLAN. From the results it is observed that the developed multi-parameter based method shows improvement in terms of time required for detecting RAP. Detection time is improved by 37.33%, in comparison to the different methods.

SECURE COMMUNICATION PROTOCOL FOR PROTECTING COMPUTATION RESULT OF FREE ROAMING MOBILE AGENT

Mobile agent plays an important role in developing applications of open, distributed and mixed environments, such as the internet. Mobile agent or mobile software agent is piece of software that can operate autonomously to accomplish user assigned task. To explain more, mobile agent is the process which can migrate to hosts autonomously. As an agent travels to do execution in different environment in different host or servers, the agents are in need of protecting themselves and their data from various types of attacks. So providing security to the mobile agent (static code) and its data (dynamic code) is an emerging need in Mobile Agent Technology. The change in Mobile Agent (MA) code can be identified due its static nature where as finding change in mobile agent data is the biggest challenge especially in malicious host’s attacks. This study presents Clone Return Process (CRP) method to protect the data of free roaming mobile agent against colluded truncation attack. By using CRP, malicious host are identified and recovery of mobile agent is easily done. So free roaming mobile agent communicates with other servers and protects its computation results (data) in an efficient way.

Mobile Agent Protection with Self-Modifying Code

Mobile agent is widely used in area such as parallel distributed computing for higher performance. But security issues threaten both the algorithm and data running on mobile agent system. The sensitive information within mobile agent code is inclined to be reverse engineered on a host platform. Obfuscation provides effective protection in this case with little execution time and storage size overhead. In this paper, we propose an obfuscation algorithm based on self-modifying code to prevent mobile agent code from attack at function level. We implement the algorithm and prove the efficacy of the algorithm.

Flexible Vision

This article presented a mobile agent-based distributed vision fusion architecture that provides a flexible vision fusion solution to increase power efficiency by reducing excessive communication and enhance sensor fusion capabilities with migratory in situ on demand algorithms for vision data processing and analysis. The IEEE FIPA standard-compliant mobile agent system, Mobile-C, implemented as a C library, is used as the foundation for the mobile agent-based distributed vision fusion architecture. Mobile agents dynamically migrate from one sensor node to another to fully combine all necessary sensor data in a desired manner specific to the system requesting the data. Dispatching mobile agents to target vision systems on the network is done on demand, reducing network congestion and the required communication bandwidth. The use of mobile agents in a distributed vision system allows for the encapsulation of specific fusion techniques. The differences between monolithic and mobile agent-based approaches along with future considerations were discussed. The validity of the architecture was proven through two separate case studies. The first case study involves the localization of a part in a real experimental setup with a retrofitted robotic workcell composed of a Puma 560, IBM 7575, conveyor system, and vision system. The second case study vertically and horizontally integrates multiple systems as a tier-scalable planetary reconnaissance experimental system involving two vision systems: a Puma 560 manipulator and a K-Team Khepera III mobile robot. All source code including Mobile-C, the mobile agents, and the mobile agent code presented in the article are available at the project Web site.

Mobile agent‐based computational steering for distributed applications

AbstractThe mobile agent‐based computational steering (MACS) for distributed applications is presented in this article. In the MACS, a mobile agent platform, Mobile‐C, is embedded in a program through the Mobile‐C library to support C/C++ mobile agent code. Runtime replaceable algorithms of a program are represented as agent services in C/C++ source code and can be replaced with new ones through mobile agents. In the MACS, a mobile agent created and deployed by a user from the steering host migrates to computing hosts successively to replace algorithms of running programs that constitute a distributed application without the need of stopping the execution and recompiling the programs. The methodology of dynamic algorithm alteration in the MACS is described in detail with an example of matrix operation. The Mobile‐C library enables the integration of Mobile‐C into any C/C++ programs to carry out computational steering through mobile agents. The source code level execution of mobile agent code facilitates handling issues such as portability and secure execution of mobile agent code. In the MACS, the network load between the steering and computing hosts can be reduced, and the successive operations of a mobile agent on multiple computing hosts are not affected whether the steering host stays online or not. The employment of the middle‐level language C/C++ enables the MACS to accommodate the diversity of scientific and engineering fields to allow for runtime interaction and steering of distributed applications to match the dynamic requirements imposed by the user or the execution environment. An experiment is used to validate the feasibility of the MACS in real‐world mobile robot applications. The experiment replaces a mobile robot's behavioral algorithm with a mobile agent at runtime. Copyright © 2009 John Wiley & Sons, Ltd.

A Secure Protocol Based on a Sedentary Agent for Mobile Agent Environments

The main challenge when deploying mobile agent environments pertains to security issues concerning mobile agents and their executive platform. This paper proposes a secure protocol which protects mobile agents against attacks from malicious hosts in these environments. Protection is based on the perfect cooperation of a sedentary agent running inside a trusted third host. Results show that the protocol detects several attacks, such as denial of service, incorrect execution and re-execution of the mobile agent code. Results also indicate that the traffic generated and run time are barely affected.

A security protocol for mobile agents based upon the cooperation of sedentary agents

Despite its many benefits, mobile agent technology results in significant security threats from agents and hosts. This paper presents a protocol which protects mobile agents from malicious hosts. This protocol combines four concepts: the cooperation between a mobile agent and a sedentary agent; the reference execution (reliable platforms which shelter our cooperating sedentary agents); the cryptography and the digital signature to ensure safe inter-agent communication and time-limited execution (timeout). A dynamic approach which makes use of a timer to make it possible to detect a mobile agent's code re-execution was used. The attack on agent permanent modification was also dealt with. Moreover, the protocol is sufficiently robust so that it is durable and fault tolerant.

바이노미얼 트리를 이용한 이동 에이전트의 빠른 전송

네트워크 환경이 좋아지고 인터넷 사용이 급증함에 따라 이동 에이전트(Mobile Agent) 기술이 정보검색, 네트워크관리, 전자상거래, 병렬/분산처리 분야에 널리 활용되고 있다. 최근에 다수의 연구자들이 이동 에이전트를 기반으로 한 병렬/분산처리 개념을 연구하고 있다. SPMD(Single Program Multiple Data)는 하나의 프로그램이 병렬환경에 참여하는 모든 컴퓨터에 전송되어 다른 자료를 사용하여 작업을 수행하는 병렬처리 방법이다. 따라서 하나의 프로그램을 모든 컴퓨터에 빠르게 전송하는 것은 전체 수행시간을 줄이기 위한 주요한 요소 중의 하나이다. 본 논문에서는 이동 에이전트 시스템으로 구성된 병렬환경에서 SPMD의 병렬처리를 효율적으로 수행하기 위해, 바이노미얼 트리를 이용하여 하나의 이동 에이전트 코드를 모든 컴퓨터에 빠르게 전송하는 새로운 방법을 제안한다. 제안된 방법은 IBM's Aglets에서 실험적 평가를 통하여 다른 방법과 비교되었으며 다른 방법에 비해서 상당히 좋은 성능을 보였다. 또한 본 문에서는 바이노미얼 트리에서 에이전트 전송 중에 발생될 수 있는 결함허용에 관한 문제를 다룬다. As network environments have been improved and the use of internet has been increased, mobile agent technologies are widely used in the fields of information retrieval, network management, electronic commerce, and parallel/distributed processing. Recently, a lot of researchers have studied the concepts of parallel/distributed processing based on mobile agents. SPMD is the parallel processing method which transmits a program to all the computers participated in parallel environment, and performs a work with different data. Therefore, to transmit fast a program to all the computers is one of important factors to reduce total execution time. In this paper, we consider the parallel environment consisting of mobile agents system, and propose a new method which transmits fast a mobile agent code to all the computers using binomial trees in order to efficiently perform the SPMD parallel processing. The proposed method is compared with another ones through experimental evaluation on the IBM's Aglets, and gets greatly better performance. Also this paper deals with fault tolerances which can be occurred in transmitting a mobile agent using binomial trees.

Mobile Code for Key Propagation

We introduce the concept of keylets, which are mobile code used to control the propagation of keys in a system, as well as a technique for mobile agent code security that involves encryption of partitioned code components. Keylets are used to support this technique by directing the distribution of keys that decrypt the encrypted components. Formalisation for keylet operations is presented, and a scenario illustrating the use of keylets to implement the technique for mobile agent code security is detailed.