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

WANG Xiaolin; ZENG Guangzhou; XU Xinshun

Article Contents

Article Navigation > Chinese Journal of Electronics > 2014 > 23(1): 1-5

WANG Xiaolin, ZENG Guangzhou, XU Xinshun, “A Dynamic Building Method of Mobile Agent Path Based on Referral Networks,” Chinese Journal of Electronics, vol. 23, no. 1, pp. 1-5, 2014,

Citation:

WANG Xiaolin, ZENG Guangzhou, XU Xinshun, “A Dynamic Building Method of Mobile Agent Path Based on Referral Networks,” Chinese Journal of Electronics, vol. 23, no. 1, pp. 1-5, 2014,

WANG Xiaolin, ZENG Guangzhou, XU Xinshun, “A Dynamic Building Method of Mobile Agent Path Based on Referral Networks,” Chinese Journal of Electronics, vol. 23, no. 1, pp. 1-5, 2014,

Citation:

WANG Xiaolin, ZENG Guangzhou, XU Xinshun, “A Dynamic Building Method of Mobile Agent Path Based on Referral Networks,” Chinese Journal of Electronics, vol. 23, no. 1, pp. 1-5, 2014,

PDF( 208 KB)

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

School of Computer Science and Technology, Shandong University, Jinan 250101, China

Funds: This work is supported by the National Natural Science Foundation of China (No.60573169, No.61173068) and the Natural Science Foundation of Shandong Province (No.ZR2009GM021).

Received Date: 2012-11-01
Rev Recd Date: 2013-04-01
Publish Date: 2014-01-05

Abstract

Abstract

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.
- Mobile agent,
- Path building,
- Referral network,
- Acquaintance tree,
- Minimum payment

FullText(HTML)

References(15)

References

R.S. Sutton, A.G. Barto, Reinforcement Learning: An Introduction, MIT Press, Cambridge, MA, 1998.

K. Moizumi, G. Cybenco,"The traveling agent problem", Mathematics of Control, Signals, and Systems, Vol.14, No.3, pp.213232, 2001.

M. Chen, V. Leung, S. Mao et al.,"Energy-efficient itinerary planning for mobile agents in wireless sensor networks", Proceedings of the IEEE 2009 International Conference on Communications, Bresden, Germany, pp.14-18, 2009.

L. Rech, C. Montez, R.S. Oliveira,"Itinerary determination of imprecise mobile agents with firm deadline", Web Intelligence and Agent Systems, Vol.6, No.4, pp.421-439, 2008.

H.W. Huo, D.Y. Gao, Y.C. Niu et al.,"A service discovery scheme based on ant colony algorithm in wireless sensor networks", Acta Electronica Sinica, Vol.35, No.12A, pp.49-54, 2007. (in Chinese)

G.P. Yang, G.Z. Zeng,"Migrating workflow organization and execution based on navigation model", Journal of Jilin University (Engineering and Technology Edition), Vol.36, No.5, pp.819-823, 2006. (in Chinese)

J. Cheng, G.Z. Zeng, H. He,"Research on migrating instance path planning in migrating workflow system", Journal of Frontiers of Computer Science and Technology, Vol.2, No.6, pp.658665, 2008. (in Chinese)

B.A. Nardi, S. Whittaker, H. Schwarz,"It's not what you know, it's who you know: Work in the information age", First Monday, Vol.5, No.5, pp.1-26, 2000.

B. Yu, M.P. Singh,"Searching social networks", Proceedings of the 2nd International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pp.65-72, Melbourne, Australia, 2003.

P. Dasgupta, E. Antonson,"Heuristics for uninformed search algorithms in unstructured P2P networks inspired by selforganizing social insect models", International Federation for Information Processing (IFIP), Boston: Springer, Vol.268, pp.19-32, 2008.

J.L. Gao, G.Z. Zeng,"Research of mobile agent workflow path dynamic programming method based on social acquaintance network", Proceedings of the 3rd International Conference on Information Sciences and Interaction Sciences, pp.398-402, 2010.

R. Wang, G.Z. Zeng,"An efficient service recommendation using differential evolutionary contract net for migrating workflows", Expert Systems with Applications, Vol.37, No.2, pp.1152-1157, 2010.

S. Milgram,"The small world problem", Psychology Today, Vol.1, No.1, pp.61-67, 1967.

W.B. Zhang, H. Zhao, W.J. Su et al.,"Research on cooperation of multiple agent based on contract-net model", Acta Electronica Sinica, Vol.34, No.5, pp.837-844, 2006. (in Chinese)

K.J. Liu, Z.W. Yu, Z.Q. Cheng,"Study on model for stochastic network simulation and its key techniques", Computer Engineering and Applications, Vol.41, No.14, pp.130-132/217, 2005. (in Chinese)

Relative Articles

Supplements(0)

Cited By

Proportional views