Abstract:

The authors analyzed the constraint conditions and the objective function of the mobile Agent routing problem in WSNs. We employed the theory of evolutionary algorithm to propose a new method of genetic operation in connection of the constraints of the energy reserves, computing power, and the communicating ability of the sensor node, i.e., a routing selecting algorithm for
 mobile Agent in WSNs. This algorithm can detect the path with the minimal energy consumption for mobile Agent, and also ensure the integrity of informationgathering. The experimental results show that this algorithm has the better adaptability, and can reduce the energy consumption of sensor node, which better meets the WSNs demand of mobile Agent routing algorithm in the real world.

Key words: wireless sensor networks(WSNs), mobile Agent, routing problem, genetic algorithm