Researches On Ant Colony Based Routing In Wireless Sensor Networks

Wireless sensor networks are an important part of "the internet of things",the quality of routing technology that used by network layer will affect the data transmission rate,transmission,speed and the network life cycle of the WSN.The routing algorithm of WSN has been a hotspot about the research,and it has great significance for the research of routing optimization problem.Ant colony optimization is simulated the ant algorithms from nature in ants finding the shortest path between food and ant nest.In this paper,introduces by the view of the wireless sensor network,the principle of ant colony Optimization,then using method of mathematical model is established and validated the feasibility in the routing algorithm in wireless sensor networks.In order to optimize the overall performance of the wireless sensor network routing algorithm.On the basis of the above research,this paper proposed a new data acquisition scheme:the shortest path based on the maximum number of data(Max-number Shortest Path,MSP).The scheme is based on improved ant colony Optimization use the integer linear programming,solved the problem of weaken or disappear,unbalanced energy consumption by AOC.Two aspects are mainly put forward in MSP routing algorithm.First,MSP prposed a path binded moving sink node in circular movement,The sensor nodes distributed around the trajectory.Then the MSP routing algorithm by using dual paths searching was proposed.Two groups of ants are searching from front and the back.One of them search path from nest to food,and another search path from food to nest,after one round,the two groups of ants exchange information.All of the ants are distributed to the two groups,in order to avoid the stop-searching of in the same direction.At the same time,in each searching records the best path and the Probability.In the probability selection and alternate selection,appearing new routing algorithm.The routing algorithm guaranteed the local best path and recorded the new shortest past.Secondly using two kinds of ants agents was proposed,including data ants and searching ants.In MSP,the routing process starting only there is data transmission.In order to avoid the overhead of communication.MSP have two ant agents:data ant and search ant.The header of the MSP have ID and death-time to avoid the looping,ensuring the data transmission.The simulation experiment shows the speed of data transmission and the life time of the MSP is better than AOC.In the overhead of data packet,the MSP is less than E&D ANTS,in efficiency of data packet transmission,the MSP is higher,transmission rate is higher,energy consumption is lower.At last the simulation in NS2 shows the MSP improved the performance of wireless sensor networks in optimization of transmission quality and prolonged the network life.