Based On Improved Ant Colony Algorithm Sensor Network Energy Management

Wirless sensors network has many practical applications owing to its low cost and neatly applying, and is a focus in measure and control technological fields. The primary goal of WSN design is that it can effectively save energy and prolong network's life. In this paper, it is carried out the research on topology control and routing protocol and then presents topology control protocol and routing protocol basing on the ant colony algorithm. The main works following:This paper presents the greedy-elitist ant colony algorithm with a view to the disfigurement of long counting time and geting in part optimization.On the base of elitist ant colony algorithm, This paper adopts greedy algorithm to improve the convergence space of ant colony algorithm; running surveillance amends algorithm's parameter to fall the probability with which the algorithm gets in part optimization. Adopting standard testing function and TSP applying, the simulation experiment shows that the improved algorithm is better than the elitist ant colony algorithm,max-min ant colony algorithm in the aspects of the robustness and performance.In the topology protocol, in view of asymmetry of the cluster head distribution,imbalance of the node's load,nimiety of the coverage redundancy,scarcity of the energy which the LEACH,HEED and GAF protocol bring because those protocols don't calculate the nodes' location distribution and redundant nodes' dormancy, this dissertation presents DEAC protocol.On the base of dynamic stochastic multilayer clustering and considering residuary energy and node's load balance, we use nodes' location to choose the working nodes and cluster head and use the improved ant colony algorithm to confirm protocol's parameter.We apply different protocols to network experiment of 200 nodes. The simulation experiment shows that the improved algorithm can reduce network's energy consumption, prolong the network's life and equilibrate load among the nodes.In the routing protocol, in view of energy consumption when DD protocol is setted up,cyclic rout in RR protocol,geting in part optimization and routing void in GEAR protocol, this paper applies ant colony algorithm in routing protocol to improve the rout self-adaption. Simultaneously, cost equation in energy routing protocol doesn't calculate residuary energy and node's location, GEAR cost equation doesn't calculate communication energy consumption among nodes so that a little rout data passes and consumes much energy.The paper presents improved cost equation. We apply different cost equations and same ant colony algorithm to network routing experiment of 40 SINK nodes. The simulation experiment shows that the improved cost equation is better than other cost equations. And then, we apply different ant colony algorithm,same cost equation and current different routing protocols to network routing experiment of 40 SINK nodes. The simulation experiment shows that the improved algorithm is difficult in getting in void and is better than other ant colony algorithms in the aspects of number of the passing datas and energy consumption.