Mobile Agent Routing Algorithm in Wireless Sensor Networks

Wireless sensor network is resources-restricted network and similar to traditional mobile ad-hoc networks in the sense that both involve multi-hop communications. An improved ant colony algorithm based on ant colony system is put forward which to find the initial optimal migration path for mobile agent in wireless sensor networks environment. This improved algorithm selects a part of optimal routes from a large of initialization routes with leaving pheromone which consider the resident energy of nodes. A mutation operator is introduced to avoid invalid path since the limitation of communication capability of wireless sensor nodes. The simulation results indicate that the improved ant colony algorithm can enhance the global search capability significantly and solve the migration path problem of mobile agent effectively.