Based On Ant Colony Optimization And Geographical Location Of WSN Routing Algorithms Research

As a powerful tool and important means to get information, WSN has broad application prospect in a lot of application fields. There are numerous sensor nodes in WSN and they usually adopt batteries to supply power for their running. Once the sensor node runs out of power, it will exit the network, this will result in hollow problem in network, and leads a big bad impact in application. This feature enables how to design a kind of energy efficient routing protocols, reduce and equilibrium network node energy consumption, become the key problem to the development of WSN.Ant Colony Optimization(ACO) is a new intelligent bionics algorithm. It has many characteristics, such as distributed computing, stronger robustness and so on. ACO draws inspiration from that when the ants carrying food back, they can always find a shortest way to their Ant nest. It suitables to solve combination optimization problem, and has been applied in many fields successfully. By comparison, it is found that ACO’s many characteristics similar to the performance requirements of WSN routing. So it has research value to optimize the WSN routing using ACO.This paper proposed a kind of energy-efficient location-aware ACO-based routing algorithm(LAACO)for WSN. Using the nodes’geographic location information, the algorithm gives a forwarding routing area. It can reduce searching area for next hop node and make routing more efficient. In the process of searching next hop by ACO algorithm, make the distance between nodes as pheromone, the residual energy as heuristic information of the problem, it can save and balance the energy consumption during routing. The algorithm also gives a routing back off strategy to avoid that there is no next hop node in the current node. By this strategy, it can improve the success rate of routing in a certain extent.We analysis the concept of search field of original LAR and LARDAR algorithm. Take the search field as the forward routing area and use routing strategy of this paper proposed, by this, we can form a new LAR algorithm and LARDAR algorithm. We make simulation experiment from time delay, the rate of sending data packet successfully, energy consumption, energy efficiency and compare with the newly changed algorithms of LAR and LARDAR. The final experiment result indicate that LAACO algorithm is better than other algorithms on the rate of sending data packets successfully, energy efficient and energy standard.