AMIS: Agent Migration Information System

This article presents an approach for inter-agent communication and inter-platform agent migration based on IEEE FIPA (Foundation for Intelligent Physical Agents) Agent Communication Language (ACL) messages. The promising features of IEEE FIPA standards that support open, flexible, and interoperable agent communication and migration are discussed in the paper. Messages for agent communication and migration, platform architecture that deliver and manage these messages, and the main procedure of processing a mobile agent message are also introduced. An application example, in which a mobile agent visits multiple hosts and travels via mobile agent messages, simulates a mobile agent for remote data processing. This example shows the feasibility, simplicity, and openness of the presented approach for mobile agent migration. Using FIPA ACL messages for agent migration in FIPA compliant agent systems simplifies agent platform, reduces development effort, and easily achieves inter-platform migration through well-designed communication mechanisms provided in the agent platform.

A Mobile agents are combination of software programs which works automatically in homogeneous and non-homogeneous environment from one host to another for sharing information among users. Mobile agents migrate in unsecure network, so mobile agent’s security is a major concern during the communication and sharing of data & information. Mobile agent’s migration has major security issues i.e. data integrity, data confidentiality & authentication, on-repudiation, denial of service and access control. In this paper neural network based synchronization key exchange is proposed for Encryption and Decryption.

The Internet of Things (IoT) is becoming an indispensable part of the actual Internet and continues to extend deeper into the daily lives of people, offering distributed and critical services. Mobile agents are widely used in the context of IoT and due to the possibility of transmitting their execution status from one device to another in an IoT network, they offer many advantages such as reducing network load, encapsulating protocols, exceeding network latency, etc. Also, Blockchain Technology is growing rapidly allowing for the addition of an approved security layer in many areas. Security issues related to mobile agent migration can be resolved with the use of Blockchain. This paper aims to demonstrate how Blockchain Technology can be used to secure mobile agents in the context of the IoT using Ethereum and a Smart Contract. The transactions within the Blockchain are used to detect the malevolent mobile agents that could infiltrate the IoT systems. The proposed model aims to provide a secure migration of mobile agents to ensure security and protect the IoT applications against malevolent agents. The case of a smart home with multiple applications is applied to verify the proposed solution. The model presented in this paper could be extended to a wider selection of IoT systems outside of the smart home.

Nowadays, a lot of e-Learning systems are widely deployed in educational schools. Typical e-Learning systems are implemented as client-server model. In the client-server model, the number of clients affects on the load of the server. In order to reduce the load on the server, we developed a P2P-based distributed e-Learning system. The proposed system consists of a lot of mobile agents which manage study contents and some functions such as scoring, showing questions, and correct answers. When a learner requests content, a mobile agent who has its content comes to the learner's computer, and then he/she can start the study. Here, a mobile agent has to manage multimedia data, which may be a huge size of data. Thus, a mobile agent has to migrates to the learner's node with a huge size of data. Then, the learner cannot start the study until the mobile agent finished to migrate. In order to solve this problem, we divide multimedia data into fragments and prepare mobile agents which manages each fragments. Since each mobile agents become small, a learner can start the study soon without waiting for the migration of a mobile agent which has a huge size of multimedia data. We, however, have to search a mobile agent which manages their fragments. Therefore, a mobile agent which manages n-th fragments informs its location to the agent which manages (n+1)-th fragments, and vice versa. Since each agent knows the location of a mobile agent which manages next and previous fragment, and fragments are cached into learner's node, a learner can play multimedia data smoothly without finding the location of mobile agent which manages holding next fragment. Experiment results show the effectiveness of our method.

Clinical Impact of a Radiologic Quality Initiative Promoting More Timely Communication of Critical Pulmonary Embolus Results

Since the topology of now network system is always dynamic, the paper provides a network active defense model that is adaptive for dynamic topology based on the mobile agent technology. The model includes three parts: network topology discovery, adaptive agents modulation mechanism and active defense. The model provided by the paper contains two kinds of agents: topology discovery agent and defense one. The model uses mobile network topology discovery agents to actively probe the current network topology and encodes it; then the adaptive modulation part of the model implements the distribution and migration of the defense agents according to the current topology; at last the defense agents then make active defense for the network.

A mobile agent is a software program which migrates from a site to another site to perform tasks assigned by a user. For the mobile agent system to support agents in various application areas, the issues regarding reliable agent execution, as well as compatibility between two different agent systems or secure agent migration, have been considered. Some of the proposed schemes are either replicating the agents (Hamidi & Mohammadi, 2005) or check-pointing the agents (Park, Byun, Kim, & Yeom, 2002; Pleisch & Schiper, 2001;) For a single agent environment without considering inter-agent communication, the performance of the replication scheme and the check-pointing scheme is compared in Park et al. (2002) and Silva, Batista, and Silva (2000). In the area of mobile agents, only few works can be found relating to fault tolerance. Most of them refer to special agent systems or cover only some special aspects relating to mobile agents, such as the communication subsystem. Nevertheless, most people working with mobile agents consider fault tolerance to be an important issue (Izatt, Chan, & Brecht, 1999; Shiraishi, Enokido, & Takzawa, 2003). Mobile agents are becoming a major trend for designing distributed systems and applications in the last few years and foreseeable future. It can bring benefits such as reduced network load and overcoming of network latency (Chan, Won, & Lyu, 1993). Nevertheless, security is one of the limiting factors of the development of these systems. The main unsolved security problem lies in the possible existence of malicious hosts that can manipulate the execution and data of agents (Defago, Schiper, & Sergent, 1998). Most distributed applications we see today are deploying the client/server paradigm. There are certain problems with the client/server paradigm, such as the requirement of a high network bandwidth, and continuous user-computer interactivity. In view of the deficiencies of the client/server paradigm, the mobile code paradigm has been developed as an alternative approach for distributed application design. In the client/server paradigm, programs cannot move across different machines and must run on the machines they reside on. The mobile code paradigm, on the other hand, allows programs to be transferred among and executed on different computers. By allowing code to move between hosts, programs can interact on the same computer instead of over the network. Therefore, communication cost can be reduced. Besides, mobile agent (Fischer, Lynch, & Paterson, 1983) programs can be designed to work on behalf of users autonomously. This autonomy allows users to delegate their tasks to the mobile agents, and not to stay continuously in front of the computer terminal. The promises of the mobile code paradigm bring about active research in its realization. Most researchers, however, agree that security concerns are a hurdle (Greenberg, Byington, & Harper, 1998). In this article, we investigate these concerns. First, we review some of the foundation materials of the mobile code paradigm. We elaborate Ghezzi and Vigna’s classification of mobile code paradigms (Ghezzi & Vigna, 1997), which is a collection of the remote evaluation, code on demand, and mobile agent approaches. In the next section, we address the current status of mobile code security. The following section presents the model for fault-tolerant mobile agent. In the next section, security issues of the mobile agent are discussed, and we discuss security modeling and evaluation for the mobile agent in the section after. In the following section, simulation results and influence of the size of agent are discussed. We then conclude the article.

SOFAR (SOuthampton Framework for Agent Research) is used to build a pervasive information system which provides context-adapted information to mobile users. Mobile agents are used as intermediaries between mobile users and the fixed infrastructure, migrating to locations with resources adapted to their objectives. SOFAR is equipped with an algorithm for tracking mobile agents and for transparently routing messages to them, without assuming the existence of any fixed or centralised control. In this paper, we present the algorithm and describe how it was integrated in the declarative style of SOFAR communications. Then we present the Agent Meeting Room: the realisation, in the agent framework, of a mechanism by which mobile users may exchange information during meetings. (11 pages)

No doubt, the usages of mobile agent and mobile phone technologies are rapidly increased. The mobile agent has a promising room in the industry area. Unfortunately, this technology faces some security problems from mobile agents and hosts sides. Two of the fundamental issues in designing protocols for message passing between mobile agents (MAs) are tracking the migration of the target agent and forwarding messages to it. Even with an ideal fault-free network-transport mechanism, messages can be dropped during MA migration. Therefore, in order to provide reliable message delivery, protocols need to overcome message loss caused by asynchronous operations of agent migration and message forwarding. As mobile devices and third generation mobile networks have become a reality, location based services are thought to be a major growing area. Mobile devices are given context sensitiveness so that they can be aware of the users/services surrounding physical environment and state. In this paper we propose message forwarding approaches, namely push and pull, are explored to design adaptive and reliable message delivery protocols.Also location aware services scheme by using an agency, which helps in discovering the required services for the mobile users. The agency consists of five agents: Manager Agent (MA), Route Monitoring Agent (RMA), Local Service Management Agent (LSMA), Global Service Management Agent (GSMA) and Area Monitoring Agent (AMA).

Semi-online scheduling with GoS eligibility constraints

In wireless sensor networks, the mobile agent technology is used in data transmission from one cluster to another cluster. The Optimization of mobile agent in the routing within the clustering algorithm for wireless sensor networks to further reduce the amount of data transfer. the main objectives of wireless sensor network design is to improve the energy efficiency & effective utilization of sensor nodes to prolong the lifespan of a wireless network .This paper presents an effective clustering algorithm, which is an extension to the LEACH routing algorithm., this algorithm fully utilizes the location information of network nodes in routing to reduce the routing cost. Through a clustering approach of intelligent mobile agents, it is possible to reduce the cost of time for each individual agent, here the problem of Multiple Clustering of Mobile Agents (MCCMA) where the decision is to cluster mobile agents such that a group of similar intelligent mobile agents will visit a group of similar sensor nodes are compare with location based clustering algorithm of wsn. both of Simulation results indicate that these algorithm & approach of mobile agent & wireless sensor network Nodes can have balance nodes' energy consumption and prolong the network's life span. It also has good extensibility & stability

A bi-criterion priority rule for minimizing machine interference and reducing job waiting time in the case of two semiautomatic machines sharing the same server for loading-unloading purposes is presented. It is shown that the interference resulting from scheduling a job is a function of the total processing time (including loading-unloading time) of the last job scheduled on the other machine minus the total processing time of the job currently under consideration. The resulting algorithm selects as the next job to be processed the one with the smallest total processing time resulting in no interference. If there is no such a job, machine interference is minimized by selecting as the next job to be processed the one with the longest total processing time among all jobs waiting for the machine. It is shown that the algorithm is highly effective in situations where machines and server are highly utilized.

This research apply two algorithms namely Mathematic Algorithm and table lookup Algorithm. From both algorithms, the research examine what algorithm have the fasted processing time and the smallest memory occupation. From the examination results the Mathematic Algorithm have 20.62 milliseconds processing time and the Table lookup algorithm have 14.08 milliseconds processing time. The Table lookup algorithm have the fastest processing time because the Matematic algorithm need the rounding process of the fi gure. Eventhough such processing time is not exceed from the 125 millisecond of delay time, in real condition, the total processing time are include the error correction processing time and voice compression processing time such as ADPCM or QCELP voice compression techniques.<br>

Now a days mobile agents are commonly used in e-commerce applications. Mobile agent is an independent program that moves around the network to execute the predefined tasks on behalf of user. Stock market can utilize mobile agents for brokering services especially for advisory dealing. Here mobile agent helps the client to make a decision on which share has to bought. Security is the major concern when mobile agents are used. Mobile agents must be protected when it travels from one host to another host. When mobile agent technology is adopted a major type of security issue encountered is colluded truncation attack. The proposed method helps to avoid this type of attack by constructing a routing table. Routing table constructed with trust and reputation value identifies the secure route for migration and cryptographic algorithms are used to protect the gathered information. The cryptographic algorithms achieve security goals like confidentiality and integrity.

This paper introduces the parallel machine scheduling problems with work related musculoskeletal disorder (WMSD) risk considerations. By the WMSD consideration, we mean that job processing times are an increasing function of occupational repetitive technical actions (OCRA) risk factor. The OCRA index was recruited for risk assessment of occupational repetitive technical actions. WMSD risks were modeled with cumulative mean value of OCRA index. Due to NP-Hard structure of parallel machine scheduling problems with WMSD considerations and learning rate, the solution cannot be found always. However, problem can be solved by transforming assignment problem. In spite of the fact that the computational effort remains O (n 4 ), problem is solved within more efficient time. In this study, a model that includes learning effect and WMSD risk was proposed. WMSD risk was considered as cumulative mean of risk value throughout shift. In order to the balance between productivity and WMSD risk, jobs’ foreseeable cycle time (FCT) value was changed. It is aimed to decrease mean of risk along schedule without increasing total basic process time. The value of sacrifice from the FCT was compensating from job which have optimal, acceptable, borderline or slight risk level. Process time and risk values were recalculated by using new FCT value. Thus, balanced process times and risk values obtained. Proposed model was solved with Lingo software and sequence of jobs was obtained. Total flow time and mean of risk were compared for balanced and none balanced schedules. Total flow time and mean of risk belong to balanced schedule is smaller than none balanced schedule. It was shown that handled problem is solvable at the polynomial time and total flow time can be improved by bringing balance between WMSD risks and productivity.