A Dynamic Building Method of Mobile Agent Path Based on Referral Networks

作     者：WANG Xiaolin ZENG Guangzhou XU Xinshun 

作者机构：School of Computer Science and Technology Shandong University 

出 版 物：《Chinese Journal of Electronics》 (电子学报(英文))

年 卷 期：2014年第23卷第1期

页      面：1-5页

核心收录：

学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统] 

基　　金：supported by the National Natural Science Foundation of China(No.60573169,No.61173068) the Natural Science Foundation of Shandong Province(No.ZR2009GM021) 

主　　题：Mobile agent Path building Referral network Acquaintance tree Minimum payment 

摘      要：The mobile agent is a computer program that is able to migrate continuously among hosts in a network and use host service to meet its task. The host,known as workplace, can be regarded as a proxy of social member. The sequence of workplaces on which the mobile agent completed its tasks is called path. In this paper, we propose a dynamic building method of mobile agent path with minimum payment based on referral. By referral, the next workplace of mobile agent can be recommended by the current workplace provider based on his acquaintance knowledge. The simulation results on a random network model show that the more acquaintance relationships there are on the referral network, the more efficiently the mobile agent path can be built, and the fewer costs need to be paid on the path.