Mobile Agent System Research Articles

A security framework for mobile agent systems

A security framework for mobile agent systems

Edge-Empowered Communication-Based Vehicle and Pedestrian Trajectory Perception System for Smart Cities

Road traffic crashes are one of the prime issues in the world. Every year 1.35 million people die, 20 to 50 million fatal injuries, and many incur a disability due to road traffic crashes. 50% of the total death, injuries, and disabilities are among vulnerable road users (VRUs), such as motorcyclists, cyclists, and pedestrians. Among these VRUs, highly vulnerable is pedestrians. In this paper, we are dealing with providing safety and alert system to pedestrians and vehicles to reduce and/or avoid the causes of road traffic crashes in metropolitan areas. In this paper, we develop a cooperative communication framework between pedestrians and nearby vehicles as well as traffic light systems using mobile agent systems and apps. The proposed cooperative communication framework controls the mobility of vehicles as well as pedestrians to avoid accidents. We have developed an application that will notify the pedestrian if there is any automobile within the range of 200 meters of the pedestrian. If there are any vehicles in this range, using direct Wi-Fi, connect the vehicles and pedestrians to notify them about their presence of them. The proposed system is implemented and tested in real-time as well as simulated in the SUMO, Veins, OMNeT++, and MiXiM simulator. The proposed systems results (real-time, simulation, and comparison) show real-time deployability, accuracy, and reliability.

Event-triggered distributed robust optimal control of nonholonomic mobile agents with obstacle avoidance formation, input constraints and external disturbances

This paper proposes an event-triggered distributed robust optimal control algorithm for nonholonomic mobile agents (NMA) systems with collision avoidance, asymmetrically saturated inputs and external disturbances. By employing the limit cycle principle and developing the adaptive dynamic programming, zero-sum game theory, and an event-triggering mechanism, the algorithm can optimize an H∞ cost function and relax both the perfect velocity tracking assumption and the persistent excitation condition. First, the graph theory is used to establish the communication configuration, followed by the introduction of the distributed kinematic control for collision avoidance. Second, as a perfect velocity tracking assumption cannot be guaranteed under dynamics changes, input constraints and external disturbances, the distributed optimal robust control algorithm is designed. Third, by developing a new event-triggering mechanism, the burden of computational complexity and communications is reduced. The closed-loop stability and the zeno-behavior exclusion are proven by the Lyapunov theory. Finally, a numerical simulation is conducted with comparison to the sampling period–based control algorithm to demonstrate the effectiveness of the proposed algorithm.

Implementation of Kubeflow MLOps with a distributed information system of mobile agents with increased functional stability

Currently, Machine Learning is one of the main tools for solving complex tasks in various fields of activity. The popularity of Machine Learning is caused by such factors as access to large data sets, the low price of computing resources, ready-made services based on cloud technologies, and rapid progress in the fields of artificial intelligence. To develop, test and support the infrastructure of systems with data, in particular, the concepts of machine learning and processes (Machine Learning and Operation, MLOps) with a set of techniques for implementation and automatic continuous integration are applied. The concept of MLOps is considered in terms of Kubeflow tools — a cloud native system with open source code running on the Kubernetes platform. The possibilities of using the MLOps approach to improve the development processes of machine learning information systems are investigated. A distributed information system based on mobile agents acting as unmanned aerial vehicle (UAVs) is designed and their potential practical implementation in real-time conditions is briefly described. It has been demonstrated that writing model code is only a small part of the tasks of Machine Learning, which affects the need for automation — the presence of a full-fledged pipeline of continuous integration and delivery of the application to the end user. Conducted studies have shown that Kubeflow consists of a set of various open source components that have a high level of integration with each other through the Kubernetes platform. This allows them to be launched on a variety of devices, including mobile agents such as UAVs. The use of mesh networks to increase the functional stability of the distributed information system of mobile agents is proposed and substantiated. The architecture of the system concept was designed based on the Kubernetes k3s distribution, which allows you to work in the edge computing paradigm.

Capture Based Trust Dependence framework for authorized node identification in mobile agent systems

A mobile agent is a self-learning machine entity that uses the system infrastructure to keep running in another remote zone, check and compile the results, interact with various locations and return to his home site after completing the relegated activities. Mobile Agent-based solutions for the testing community have grown in popularity and are now used in a variety of fields, including boardroom management, electronic commerce, renewable energy and power management. Addition to these applications, Broadband Interactive Sensors, network performance improvement, disseminated knowledge mining, multimedia, human monitoring, surveillance, affective computing, weather and environment, e-learning and semantic web administrations are only a few of the topics covered. In an extremely non trusty environment, focus should be taken to shield the portable operator from acquiring altered. Existing works on mobile agent frameworks with very surprising instruments does not offer complete security. In this paper a capture based trust dependence framework is proposed for identification of authorized or trust nodes inside mobile agents systems. Here we consider the mobile adhoc networks for computational analysis of network performance using network simulator. The framework provides efficient results in identification of authorized nodes.

Verification of agent navigation in partially-known environments

This paper establishes a framework based on logic and automata theory in which to model and automatically verify systems of multiple mobile agents moving in environments with partially-known topologies, i.e., ones which are not completely known at design time. Examples include physical agents designed to be used in many spatial environments and not tailored for a specific one, robots in environments not reachable by humans, and software exploring partially-mapped networks. We model spatial environments as graphs whose edges are labelled with directions. We model agents as finite-state machines that move on the graphs by issuing commands of the form “go in direction X”, that can communicate their internal state to other agents, and that can sense agent positions (including current and visited positions). We treat the incomplete information about the spatial environment by studying the decision problem that asks whether a given collection of agents achieve their tasks on all graphs from a class of graphs — this is called the parameterised verification problem. The framework also introduces a new logical language based on Linear Temporal Logic that is tailored for expressing agent navigation tasks in such environments.Although the parameterised verification problem is undecidable, we identify two key dimensions that need to be limited in order to regain decidability, namely, the set of graph-environments and the amount of sensing and communication between agents. In particular, one should limit the families of graphs to exclude grids, and there should be a bound on the number of times an agent senses the position of another agent or communicates its own state to another agent. We prove that dropping either of these assumptions results in undecidability, even for agents with severe restrictions on their abilities (e.g., with very limited sensing abilities and no communication abilities). The importance of this work is that a) it provides a general computational model for mobile multi-agent systems in environments with partially-known topologies, b) it identifies, for the first time, the precise causes of undecidability of these systems and presents minimal restrictions to alleviate this problem, and c) it provides a generic sound and complete procedure for solving the parameterised verification problem over a broad range of spatial-environments and for agents with very powerful sensing and communication abilities.

Developing Check-Point Mechanism to Protect Mobile Agent Free-Roaming Against Untrusted Hosts

Mobile Agent has many benefits over traditional distributed systems such as reducing latency, bandwidth, and costs. Mobile Agent Systems are not fully utilized due to security problems. This paper focuses on mobile agent protection against malicious hosts. A new security mechanism called Checkpoints has been proposed. Checkpoint Mechanism (CPM) aims to protect Mobile Agent against malicious hosts in case of Capturing and Integrity attacks. CPM assumes using a free-roaming mobility mechanism by Mobile agent systems. The main idea behind CPM is to generate multiple versions of Mobile Agent. The multiple version is used to recover Mobile Agent from Capturing and Integrity attacks by untrusted hosts. MA versions are kept in Recovery Host(RH). RH plays a key role in CPM by controlling and monitoring MAs’ recovery processes. A prototype method has been used to prove the feasibility of CPM. The prototype was implemented by using the. Net framework and C#. full discussion for several scenarios has been done to analyze the feasibility and performance for CPM. As found from this research, CPM has a strong ability to protect Mobile Agents from Capturing and Integrity attacks completely. In addition, there is no negative impact on the overall performance of the mobile agent system.

Anonymous and lightweight secure authentication protocol for mobile Agent system

Recently mobile agent technology used in intelligent systems, cloud computing and IOT. However using mobile agents in distributed environment makes them facing several security threats. In this paper, we propose a lightweight authentication protocol to overcome the security problem, and to provide a secure and anonymous mobile agent system. Our protocol is based on Elliptic Curve Cryptography (ECC) and fulfill all security requirements. For the validation of our security protocol, we used Automated Validation of Internet Security Protocols and Applications (AVISPA) tool using HLPSL language. Furthermore, we used Java Agent Development Framework (JADE) to implement and simulate the proposed scheme. Finally, the paper presents the security analysis and comparison with well-known and significant related protocols in secure communication.

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.

Dynamics of reputation in mobile agents systems and weighted timed automata

The reputation of a process is based on its past and present behaviour; it evolves in time depending on several factors including the actions performed, the reputation of its interacting processes and locations where the process resides. We design a calculus of mobile agents in distributed systems able to handle the dynamics of reputation which changes over time depending on specified factors. The main idea is to provide a formal understanding of how reputation is formed from complex interactions in agent systems based on timed migration and communication, and how we can verify automatically the properties involving reputation. After presenting the operational semantics of our calculus and some results, the mobile agents described easily in this calculus are translated into networks of weighted timed automata having a bisimilar behaviour. Based on this translation, we use an existing software platform to analyze reputation-based properties of mobile agents in distributed systems.

Enhancing Mobile Agent Security Level (Proposed Model)

Mobile agents are application design schemes for distributed systems that consist of mobile code ideology including Mobile agent software. In the last period mobile computing process had a vision that’s a set of execution code that’s move from platform to another in the heterogeneous network with an ability of carrying there result and updating them self-sate. This paper presents several enhancements on mobile agent security and provides generalized code protection. Several novel techniques are proposed to protect mobile agents in any environments and to describe and solve practical problems in the mobile agent system.

Mobile Agent Security Based on Mutual Authentication and Elliptic Curve Cryptography

Mobile agent system is a satisfying solution for the implementation and maintenance of applications distributed over large-scale networks, this solution is very used in solving complex problems since they are autonomous, Intelligent, robust and fault- tolerant. Mobile agents have the capacity to migrate from one node to another all over the network allowing reduction in communication costs. Although they possess all these advantages, using them in distributed environment increases the threat to mobile agent security and during their mobility they can face different types of attacks such as of attacks like Replay attack, man-in-the-middle attack, Cookie theft attack, Offline password guessing attack, Stolen-verifier attack. In this paper we investigate the security of distributed mobile agent system. We propose a solution based on a secure Elliptic Curve Cryptography (ECC) protocol to ensure mutual authentication and protect the agent from different known attacks. The implementation of the proposed solution is obtained using Java Agent Development Framework (JADE). Also, Binary serialization is used to establish a flexible portability of the agent. Finally, we present security and performance analysis, for our solution to secure mobile agent in distributed systems.

Mobi-X Architecture Modelling for Mobile Agent using Association Pattern Mining

In a mobile agent system, if agents’ functionality can be assessed and evaluated between peers of environmental modelling, it can reduce the exploration burden of unvisited states and unseen situations, thus an effectual learning process has to be accelerated. So as to construct an accurate and effectual model in certain time period is a significant problem, specifically in complex environment. To overcome this crisis, the investigation anticipates a model based data mining approach based on tree structure to achieve co-ordination amongst the mobile agent, effectual modelling and less memory utilization. The anticipated model suggests Mobi-X architecture to mobile agent system with a tree structure for effectual modelling. The construction of tree for real time mobile agent system is utilized to generate virtual experiences like elapse time during mining of tree structure. In addition, this model is appropriate for knowledge mining. This work is inspired by knowledge mining concept in mobile agent systems where an agent can built a global model from scattered local model held by individual agents. Subsequently, it increases modelling accuracy to offer valid simulation outcome for indirect learning at initial stage of mining. In order to simplify mining procedure, this anticipated model relies on re-sampling approach with associative rule mining to grafting branches of constructed tree. The tree structure provides the functions of mobile agents with useful experience from peer to peer connectivity, indeed of combining all the available agents. The simulation outcomes shows that proposed re-sampling can attain efficiency and accelerate the functionality of mobile agents based cooperation applications.

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.

Performance analysis of hierarchical location management system for mobile-multi-agent system

Location management of a Mobile Agent (MA) is necessary for a Mobile Agent System (MAS), in which many significant services are accomplished using MA communications that require specific location information. This paper gives the performance analysis of a Hierarchical Location Management System (HLMS) for mobile Multi Agent System (MUS) with the objectives to reduce the search and update cost. This work also discusses a mailbox-based approach to provide communication among MAs. Mailbox is a data structure which is used to store the messages for MAs. There are two different communication mechanisms (jump and full migration) with mailbox have been used. In jump migration MA's mailbox always resides at the local router and in full migration MA always carries its mailbox with it at the host it is executing. For jump migration MA periodically checks its mailbox to get the message. HLMS has been modelled using the timed Coloured Petri Net (CPN) tool. Performance of HLMS is then observed for identified parameters such as Trip Time (TT), Migration Rate (MR), Search Rate (SR), Network Overhead (ND) and Communication Time (COT). Simulation results show that HLMS can locate the MAs in a fault free environment but TT and ND decrease as intra-region MR increases.

Performance analysis of hierarchical location management system for mobile-multi-agent system

Location management of a Mobile Agent (MA) is necessary for a Mobile Agent System (MAS), in which many significant services are accomplished using MA communications that require specific location information. This paper gives the performance analysis of a Hierarchical Location Management System (HLMS) for mobile Multi Agent System (MUS) with the objectives to reduce the search and update cost. This work also discusses a mailbox-based approach to provide communication among MAs. Mailbox is a data structure which is used to store the messages for MAs. There are two different communication mechanisms (jump and full migration) with mailbox have been used. In jump migration MA's mailbox always resides at the local router and in full migration MA always carries its mailbox with it at the host it is executing. For jump migration MA periodically checks its mailbox to get the message. HLMS has been modelled using the timed Coloured Petri Net (CPN) tool. Performance of HLMS is then observed for identified parameters such as Trip Time (TT), Migration Rate (MR), Search Rate (SR), Network Overhead (ND) and Communication Time (COT). Simulation results show that HLMS can locate the MAs in a fault free environment but TT and ND decrease as intra-region MR increases.

Incorporating novel hierarchical secure model for performance and reliability evaluation in mobile agent system

Emerging mobile agent paradigm supports towards wider applications of mobile agent system (MAS). To guarantee security challenges due to several vulnerable threats into MAS, reliability issues are addressed. In this paper, a hierarchical secure model is designed for reliability prediction of MAS. The proposed security model is categorised as: host security, agent security and communication channel security. Security improvising effects over the reliability enhancements, security is maintained in mobile agent, host and during mobile agent migration. A novel multi-factor authentication is used at mobile agent verification; hosts are verified with respect to the certificate originality and pseudo identity. Opinions from neighbouring host are requested for secure migration of mobile agent. Security-based challenges solved in this paper shows enhancements in reliability of MAS that is estimated in terms of confidentiality, authentication at origin, integrity of agent, quality of mobile agent, security, fault tolerance, dynamic topology and link connectivity. Our proposed MAS are designed in NS3 simulator that results reliability enhancement according to number of mobile agents, size of MAS and number of hosts.

Incorporating novel hierarchical secure model for performance and reliability evaluation in mobile agent system

Emerging mobile agent paradigm supports towards wider applications of mobile agent system (MAS). To guarantee security challenges due to several vulnerable threats into MAS, reliability issues are addressed. In this paper, a hierarchical secure model is designed for reliability prediction of MAS. The proposed security model is categorised as: host security, agent security and communication channel security. Security improvising effects over the reliability enhancements, security is maintained in mobile agent, host and during mobile agent migration. A novel multi-factor authentication is used at mobile agent verification; hosts are verified with respect to the certificate originality and pseudo identity. Opinions from neighbouring host are requested for secure migration of mobile agent. Security-based challenges solved in this paper shows enhancements in reliability of MAS that is estimated in terms of confidentiality, authentication at origin, integrity of agent, quality of mobile agent, security, fault tolerance, dynamic topology and link connectivity. Our proposed MAS are designed in NS3 simulator that results reliability enhancement according to number of mobile agents, size of MAS and number of hosts.

Q-learning and ACO hybridisation for real-time scheduling on heterogeneous distributed architectures

In the intensive computation field, it is worth mentioning that extensive computing power and considerable storage capacity are needed by greedy applications. To reach the required processing power, multiple processing units should be linked to handling the distributed jobs. However, the heterogeneity of the associated resources/workers is to be considered during the tasks scheduling process. Our approach consists of combining Q-learning with ant colony optimisation (ACO) to solve the job scheduling problems on heterogeneous architectures. The proposed approach is implemented by using the mobile agent's systems. The obtained results from simulation demonstrated the effectiveness of the proposed hybridisation due to the considerable reduction of the overall execution time (makespan) and to the fast convergence observed after a small number of learning steps.