Ant Colony Optimization Algorithm and Its Convergence for Wireless Sensor Network Routine Problem
求解无线传感器网络路由问题的蚁群最优化算法及其收敛性

In this paper,the Steiner tree model for the wireless sensor network routing is first proposed,then an ant colony optimization algorithm and its convergence proof for solving the minimal Steiner tree model is presented and finally changes of the pheromone trails after an optimal solution has been found and analysised.In particularly,it is shown that under condition of constraint of pheromone trails,the probability of finding an optimal solution tends the to 1 for sufficiently large number of iterations.And after an optimal solution has been found,the pheromone trails associated to the optimal solution monotonically increase to reach the maximum value while others pheromone trails reach the minimum one in finite iterations.