{'fraction_non_alphanumeric': 0.015873015873015872, 'fraction_numerical': 0.0, 'mean_word_length': 5.92485549132948, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Mobile agent migration algorithms for collaborative processing

Distributed computing paradigm plays an important and fundamental role in facilitating collaboration among sensor nodes. The mobile agent computing paradigm has many benefits in the context of sensor networks. However, the most challenging problem in mobile agent based computing, the design of mobile agent itinerary, is left unanswered. An improper design of itinerary (or route) of mobile agent migration can largely deteriorate the performance of collaborative processing. In this paper, we study the key problem of deriving mobile agent itinerary for collaborative processing, especially the dynamic mobile agent planning since it is more suitable for the wireless sensor networks. This paper presents two dynamic itinerary planning algorithms, the dynamic and the predictive dynamic approaches. We design three metrics (energy consumption, network lifetime, and the number of hops ) and use simulation tools to quantitatively measure the performance of different itinerary planning algorithms. Simulation results show considerable improvement over the dynamic itinerary approach using the predictive dynamic itinerary algorithm