Mobile Agent Routing Algorithm in Dynamic Sensor Network

Abstract

An ant colony optimization-based dynamic energy efficient mobile agent routing algorithm (ADEEMA) is presented in this paper. In this algorithm, mobile agent (MA) has the character of an ant, and a novel probabilistic model is constructed to make MA can find an energy efficient route from processing node (PN) to target nodes (TN). The route considers both the energy consumption and the node residual energy, and a new concept: route optimal degree (ROD) is presented to evaluate the performance of the chosen route. In order to adapt to the topology changes in dynamic sensor network, a new local pheromone re-initialization rule is presented, the rule reinitializes the pheromone in the local area where the sensor network topology changes, so most information of the old optimization route can be reserved and meanwhile the ant can search new route in local area, thus the optimization route can be modified fast. The simulation shows that a route with minimum energy consumption and maximum node residual energy can be obtained by our method. In addition, a new optimization route can be found fast when topology changes by our algorithm.