In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices...In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices. The proposed encoding scheme has the advantages of simplicity for encoding and decoding, ease for GA operations, and better equilibrium between exploration and exploitation. It is also adaptive in that, with few restrictions on the length of code, it can be freely lengthened or shortened according to the characteristics of the problem space. Furthermore, the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node. The simulation results demonstrate the higher performance of our algorithm, with fast convergence to the optima or sub-optima on various problem sizes. Comparing with the binary string encoding of vertices, when the problem size is large, our algorithm runs remarkably faster with comparable search capability. Key words distributed information retrieval - mobile agents - migration problem - genetic algorithms CLC number TP 301. 6 Foundation item: Supported by the National Natural Science Foundation of China (90104005), the Natural Science Foundation of Hubei Province and the Hong Kong Polytechnic University under the grant G-YD63Biography: He Yan-xiang (1952-), male, Professor, research direction: distributed and parallel processing, multi-agent systems, data mining and e-business.展开更多
Mobile agents provide a new method for the distributed computation. This paper presents the advantages of using mobile agents in a distributed virtual environment (DVE) system, and describes the architecture of hetero...Mobile agents provide a new method for the distributed computation. This paper presents the advantages of using mobile agents in a distributed virtual environment (DVE) system, and describes the architecture of heterogeneous computer's distributed virtual environment system (HCWES) designed to populate some mobile agents as well as stationary agents. Finally, the paper introduces how heterogeneous computer network communication is to be realized.展开更多
In mobile cloud computing,trust is a very important parameter in mobile cloud computing security because data storage and data processing are performed remotely in the cloud.Aiming at the security and trust management...In mobile cloud computing,trust is a very important parameter in mobile cloud computing security because data storage and data processing are performed remotely in the cloud.Aiming at the security and trust management of mobile agent system in mobile cloud computing environment,the Human Trust Mechanism(HTM)is used to study the subjective trust formation,trust propagation and trust evolution law,and the subjective trust dynamic management algorithm(MASTM)is proposed.Based on the interaction experience between the mobile agent and the execution host and the third-party recommendation information to collect the basic trust data,the public trust host selection algorithm is given.The isolated malicious host algorithm and the integrated trust degree calculation algorithm realize the function of selecting the trusted cluster and isolating the malicious host,so as to enhance the security interaction between the mobile agent and the host.Given algorithm simulation and verification were carried out to prove its feasibility and effectiveness.展开更多
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 per...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.展开更多
The control problem of a class of parabolic distributed parameter systems (DPSs) is investigated by using mobile agents with capabilities of sensing and actuating. The guidance strategies of mobile agents based on cov...The control problem of a class of parabolic distributed parameter systems (DPSs) is investigated by using mobile agents with capabilities of sensing and actuating. The guidance strategies of mobile agents based on coverage optimization methods are proposed to improve the control performance of the system and make the state norm of the system converge to zero faster. The coverage optimization problems are constructed based on the measurement of each agent. By solving the coverage optimization problems, the local optimal moving direction of each agent can be obtained. Then the gradient-based agent motion control laws are established. With the indicator function and the surface delta function, this method is generalized to n-dimensional space, and suitable for any sensing region with piecewise smooth boundaries. The stability and control performance of the system are analyzed. Numerical simulations show the effectiveness of the proposed methods.展开更多
This paper discusses the model of how the Agent is applied to implement distributed computing of Ada95 and presents a dynamic allocation strategy for distributed computing that based on pre-allocationand Agent. The ...This paper discusses the model of how the Agent is applied to implement distributed computing of Ada95 and presents a dynamic allocation strategy for distributed computing that based on pre-allocationand Agent. The aim of this strategy is realizing dynamic equilibrium allocation.展开更多
With the continuous use of cloud and distributed computing, the threats associated with data and information technology (IT) in such an environment have also increased. Thus, data security and data leakage prevention ...With the continuous use of cloud and distributed computing, the threats associated with data and information technology (IT) in such an environment have also increased. Thus, data security and data leakage prevention have become important in a distributed environment. In this aspect, mobile agent-based systems are one of the latest mechanisms to identify and prevent the intrusion and leakage of the data across the network. Thus, to tackle one or more of the several challenges on Mobile Agent-Based Information Leakage Prevention, this paper aim at providing a comprehensive, detailed, and systematic study of the Distribution Model for Mobile Agent-Based Information Leakage Prevention. This paper involves the review of papers selected from the journals which are published in 2009 and 2019. The critical review is presented for the distributed mobile agent-based intrusion detection systems in terms of their design analysis, techniques, and shortcomings. Initially, eighty-five papers were identified, but a paper selection process reduced the number of papers to thirteen important reviews.展开更多
The aim of this paper is to present a distributed algorithm for big data classification, and its application for Magnetic Resonance Images (MRI) segmentation. We choose the well-known classification method which is th...The aim of this paper is to present a distributed algorithm for big data classification, and its application for Magnetic Resonance Images (MRI) segmentation. We choose the well-known classification method which is the c-means method. The proposed method is introduced in order to perform a cognitive program which is assigned to be implemented on a parallel and distributed machine based on mobile agents. The main idea of the proposed algorithm is to execute the c-means classification procedure by the Mobile Classification Agents (Team Workers) on different nodes on their data at the same time and provide the results to their Mobile Host Agent (Team Leader) which computes the global results and orchestrates the classification until the convergence condition is achieved and the output segmented images will be provided from the Mobile Classification Agents. The data in our case are the big data MRI image of size (m × n) which is splitted into (m × n) elementary images one per mobile classification agent to perform the classification procedure. The experimental results show that the use of the distributed architecture improves significantly the big data segmentation efficiency.展开更多
Nowadays, mobile agents are an effective paradigm for accessing the information in distributed applications, especially in a dynamic network environment such as Internet businesses. In such kind of Internet based appl...Nowadays, mobile agents are an effective paradigm for accessing the information in distributed applications, especially in a dynamic network environment such as Internet businesses. In such kind of Internet based applications, access must be secure and authentication takes a vital role to avoid malicious use of the system. This kind of security has been provided by several previously proposed algorithms based on RSA digital signature cryptography. However, the computational time for performing encryption and decryption operations in the past literatures is very high. In this paper, we propose an anonymous authentication scheme which potentially reduces the overall computation time needed for verifying the legitimacy of the users. Comparing with previous anonymous authentication schemes, our proposed scheme provides more security and it is effective in terms of computation cost. The experimental results show that the proposed method authenticates the users with low computational time significantly.展开更多
基于群组掩饰签名方案和 Mobile Agent,本文提出了一个支持联盟机制的分布式电子银行模型及其相关协议 ,其中结成联盟的多个银行能够安全地发行匿名的和不可跟踪的电子现金 .而且 ,将 Mobile Agent运用到电子支付的电子银行系统中 ,本...基于群组掩饰签名方案和 Mobile Agent,本文提出了一个支持联盟机制的分布式电子银行模型及其相关协议 ,其中结成联盟的多个银行能够安全地发行匿名的和不可跟踪的电子现金 .而且 ,将 Mobile Agent运用到电子支付的电子银行系统中 ,本模型能够均衡计算负载、节省网络带宽、提高响应速度和增强安全性 ,这在概念上是全新的 .对于模型中协议的安全性 。展开更多
文摘In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices. The proposed encoding scheme has the advantages of simplicity for encoding and decoding, ease for GA operations, and better equilibrium between exploration and exploitation. It is also adaptive in that, with few restrictions on the length of code, it can be freely lengthened or shortened according to the characteristics of the problem space. Furthermore, the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node. The simulation results demonstrate the higher performance of our algorithm, with fast convergence to the optima or sub-optima on various problem sizes. Comparing with the binary string encoding of vertices, when the problem size is large, our algorithm runs remarkably faster with comparable search capability. Key words distributed information retrieval - mobile agents - migration problem - genetic algorithms CLC number TP 301. 6 Foundation item: Supported by the National Natural Science Foundation of China (90104005), the Natural Science Foundation of Hubei Province and the Hong Kong Polytechnic University under the grant G-YD63Biography: He Yan-xiang (1952-), male, Professor, research direction: distributed and parallel processing, multi-agent systems, data mining and e-business.
文摘Mobile agents provide a new method for the distributed computation. This paper presents the advantages of using mobile agents in a distributed virtual environment (DVE) system, and describes the architecture of heterogeneous computer's distributed virtual environment system (HCWES) designed to populate some mobile agents as well as stationary agents. Finally, the paper introduces how heterogeneous computer network communication is to be realized.
基金This work was supported by the National Natural Science Foundation of China(61772196,61472136)the Hunan Provincial Focus Social Science Fund(2016ZDB006)+2 种基金Hunan Provincial Social Science Achievement Review Committee results appraisal identification project(Xiang social assessment 2016JD05)Key Project of Hunan Provincial Social Science Achievement Review Committee(XSP 19ZD1005)The authors gratefully acknowledge the financial support provided by the Key Laboratory of Hunan Province for New Retail Virtual Reality Technology(2017TP1026).
文摘In mobile cloud computing,trust is a very important parameter in mobile cloud computing security because data storage and data processing are performed remotely in the cloud.Aiming at the security and trust management of mobile agent system in mobile cloud computing environment,the Human Trust Mechanism(HTM)is used to study the subjective trust formation,trust propagation and trust evolution law,and the subjective trust dynamic management algorithm(MASTM)is proposed.Based on the interaction experience between the mobile agent and the execution host and the third-party recommendation information to collect the basic trust data,the public trust host selection algorithm is given.The isolated malicious host algorithm and the integrated trust degree calculation algorithm realize the function of selecting the trusted cluster and isolating the malicious host,so as to enhance the security interaction between the mobile agent and the host.Given algorithm simulation and verification were carried out to prove its feasibility and effectiveness.
基金supported by the National Natural Science Foundation of China (61772196 61472136)+3 种基金the Hunan Provincial Focus Social Science Fund (2016ZDB006)Hunan Provincial Social Science Achievement Review Committee results appraisal identification project (Xiang social assessment 2016JD05)Key Project of Hunan Provincial Social Science Achievement Review Committee (XSP 19ZD1005)the financial support provided by the Key Laboratory of Hunan Province for New Retail Virtual Reality Technology (2017TP1026)
文摘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.
基金supported by the National Natural Science Foundation of China(61807016 61174021)+3 种基金the Fundamental Research Funds for the Central Universities(JUSRP115A28 JUSRP51733B)the 111 Projeet(B12018)the Postgraduate Innovation Project of Jiangsu Province(KYLX151170)
文摘The control problem of a class of parabolic distributed parameter systems (DPSs) is investigated by using mobile agents with capabilities of sensing and actuating. The guidance strategies of mobile agents based on coverage optimization methods are proposed to improve the control performance of the system and make the state norm of the system converge to zero faster. The coverage optimization problems are constructed based on the measurement of each agent. By solving the coverage optimization problems, the local optimal moving direction of each agent can be obtained. Then the gradient-based agent motion control laws are established. With the indicator function and the surface delta function, this method is generalized to n-dimensional space, and suitable for any sensing region with piecewise smooth boundaries. The stability and control performance of the system are analyzed. Numerical simulations show the effectiveness of the proposed methods.
文摘This paper discusses the model of how the Agent is applied to implement distributed computing of Ada95 and presents a dynamic allocation strategy for distributed computing that based on pre-allocationand Agent. The aim of this strategy is realizing dynamic equilibrium allocation.
文摘With the continuous use of cloud and distributed computing, the threats associated with data and information technology (IT) in such an environment have also increased. Thus, data security and data leakage prevention have become important in a distributed environment. In this aspect, mobile agent-based systems are one of the latest mechanisms to identify and prevent the intrusion and leakage of the data across the network. Thus, to tackle one or more of the several challenges on Mobile Agent-Based Information Leakage Prevention, this paper aim at providing a comprehensive, detailed, and systematic study of the Distribution Model for Mobile Agent-Based Information Leakage Prevention. This paper involves the review of papers selected from the journals which are published in 2009 and 2019. The critical review is presented for the distributed mobile agent-based intrusion detection systems in terms of their design analysis, techniques, and shortcomings. Initially, eighty-five papers were identified, but a paper selection process reduced the number of papers to thirteen important reviews.
文摘The aim of this paper is to present a distributed algorithm for big data classification, and its application for Magnetic Resonance Images (MRI) segmentation. We choose the well-known classification method which is the c-means method. The proposed method is introduced in order to perform a cognitive program which is assigned to be implemented on a parallel and distributed machine based on mobile agents. The main idea of the proposed algorithm is to execute the c-means classification procedure by the Mobile Classification Agents (Team Workers) on different nodes on their data at the same time and provide the results to their Mobile Host Agent (Team Leader) which computes the global results and orchestrates the classification until the convergence condition is achieved and the output segmented images will be provided from the Mobile Classification Agents. The data in our case are the big data MRI image of size (m × n) which is splitted into (m × n) elementary images one per mobile classification agent to perform the classification procedure. The experimental results show that the use of the distributed architecture improves significantly the big data segmentation efficiency.
文摘Nowadays, mobile agents are an effective paradigm for accessing the information in distributed applications, especially in a dynamic network environment such as Internet businesses. In such kind of Internet based applications, access must be secure and authentication takes a vital role to avoid malicious use of the system. This kind of security has been provided by several previously proposed algorithms based on RSA digital signature cryptography. However, the computational time for performing encryption and decryption operations in the past literatures is very high. In this paper, we propose an anonymous authentication scheme which potentially reduces the overall computation time needed for verifying the legitimacy of the users. Comparing with previous anonymous authentication schemes, our proposed scheme provides more security and it is effective in terms of computation cost. The experimental results show that the proposed method authenticates the users with low computational time significantly.
