Investigation On Routing Algorithm For WSN By Optimized Ant Colony

As a new technology of collecting and dealing with information，Wireless SensorNetwork(WSN) gathers different kinds of information of a data required environment in areal time with the cooperation of sensors.The collected information is sent in wireless wayand transmitted with packets by sensor’s antenna，sensors can self-organize a net ofinformation transmission quickly to give users the useful data by the method ofmulty-hop.Thus an intelligent net is produced to comply user’s accessing data remotely.Asthe working model of WSN is completely different from other networks，it is a big challengeto study routing of WSN.In recent years，the research of WSN becomes diversified，Somerouting protocols are analyzed in this paper and an improved routing algorithm of WSNwhich is based on ACO and LEACH protocol is proposed on the basis of assimilating theexcellent idea from them.From lucubrate and analysis the existing routing protocol of WSN，this paper willoptimize the communication phase between cluster nodes and Sink node of LEACHprotocol.The vigorous of every present cluster is in the scope of examination to choose thebest one to share a more energy consumption in the data transmission and ensure the cost ofevery cluster is even.It will enlarge lifecycle of the network.It is significant to apply the Ant Colony Algorithm(ACA) in WSN for it can be at theconvergence of the shortest path in a little time.This paper uses the characteristics what aredistributed，the positive feedback and self-organization of ACA to add the hops count toSink node，the quality of link and node remainder energy into the optimized ACAs updatemechanisms of pheromone and promote the communication route between clusters throughprobabilistic routing of the next hop，then，the new algorithm is simulated by MATLAB andthe result shows that it has a better adaptability then LEACH protocol，each node cost havea much better balanced and the lifecycle of network is longer.