Research into WMSN Routing Algorithm Based on Ant Colony Optimization

This paper proposes a routing algorithm by using the ant colony optimization that is applicable to WMSN. The algorithm simulates the means of ant colony finding their ways in nature. One node calculates the probability to choose next hop to send package on the basis of the frequency used prier to this route and the cost through this path. The experimental results show that, compared with traditional direct diffusion algorithm, the average service life lengthens by 20%, and the speed of successfully sending packages is much higher by using the proposed algorithm.