By Topic

The design on Migration Algorithm of Mobile Agent based on extended itinerary graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yue Jiang ; Vocational & Tech. Coll., Yunnan Univ. of Finance & Econ., Kunming, China ; Yi Ting Jiang ; You Ming Xia

Mobile Agent technology has broad application prospects, mobile strategy of which will directly affect the performance of Mobile Agent and even completion of its Task. Therefore, the research on self-migration calculation of Mobile Agent has theoretical significance and application value. Sequence will be regarded as a part of selective task, so this paper only discusses migration issues of Mobile Agent under the case of sequential, selective and parallel. This paper proposes a new definition of the extended itinerary graph, and on this basis gives the mathematical calculation model of the fitness function, population selection operator, mutation probability of genetic algorithm. By improving the genetic algorithm, Migration Algorithm of Mobile Agent is designed.

Published in:

Information Science and Service Science (NISS), 2011 5th International Conference on New Trends in  (Volume:2 )

Date of Conference:

24-26 Oct. 2011