A Mobile Agent Routing Algorithm Based On Ant Colony Algorithm In Wireless Sensor Networks

Wireless Sensor Networks have the characters of limit hardware resources,limit communication ability,multi-jump routing,dynamic topology,lots of motes and denseness distributing.It has several distributed optimization problems,such as reducing raw date and routing. Now many existing routing protocols are not applicable.Therefore,in recent years,many new routing algorithms for wireless sensor networks are being proposed.Many factors such as lower the energy consumption, reducing latency,balancing network load,adapting the dynamic changes of network topology should be considered in sensor network routing algorithm's design.Therefore,designing and researching new routing algorithms that fit for wireless sensor networks is a new challenge.In resent years,many researchers have applied the mobile agent to the treatment of the WSN data and the choice of the routing.The thoughts combines the technology of mobile agent with the optimization method has great prospect.Ant colony algorithm provides a distributed solution that solves optimization problems of no centralized control and no global model.Thinking of this,the focus of this paper is to study the wireless sensor routing algorithm that based on the cooperation of mobile agent and ant algorithm.After adequately comparing and analyzing traditional routing protocols and algorithms,researching the technology of mobile agent and the ant algorithm,a new wireless sensor networks routing algorithm based on the combination of mobile agent and ant algorithm is proposed to solve data processing and routing choice problem in this paper.The algorithm considers the balance of router efficiency and the node load.It can not only make full use of the node's computing capacity and improve the treatment efficiency of network data but also reduce the redundancy data and the costs of communication,prolong the life of the sensor.The following list contains the main research achievements of this paper:(1)Proposing a mobile agent routing algorithm based on an improved ant colony algorithm in wireless sensor networks.In the mobile agent routing calculation process,the algorithm takes distance between sensor nodes,surplus energy of nodes,data-processing ability and other factors into consideration,consequently the algorithm can balance the network load,provide less network energy consumption and prolong the lifecycle of the whole network.(2)Improved ant algorithm in this paper overcomes basic ant algorithm's disadvantages such as easy to stagnation and slow convergence.By dynamically changes the evaporation coefficient of pheromone and applying the global updating rule of the best and the worst path,improved ant colony algorithm better solves the basic one for solving mobile agent routing defects.The simulation results show that,proposed algorithm is superior to the ant colony algorithm mobile agent algorithm based on ant algorithm and GA algorithm both on the globalization and on the convergence rate. It better solves a large number of wireless sensor network data's transmission problem and efficiently reduces the redundancy data and the costs of communication,prolongs the life of the sensor nodes and networks.