An algorithm for mobile agents itinerary planning
Yongjie Wang · Microcomputer Information · 2010
In the distributed information systems based on mobile agent technology,using single mobile agent to travel all nodes in the systems will prolong the system responding time.One solution is dispatching multi agents simultaneously.A heuristic algorithm is proposed in which the set of itinerated nodes is divided into several independent subsets and the itinerary path in each subset is optimized.The simulation in different network environment verifies that the algorithm can evidently reduce the execution time of itinerary task in contrast to random grouping algorithm.Furthermore,the effect in WAN is better than its in LAN.