Ant-colony optimizational routing selected algorithm based on remain-energy

In order to decrease energy consumption of node and congestion degree of network, ant-optimization is applied to improving a routing selected problem of remain-energy in ad hoc networks. This essay aims at putting forward an ant-optimization routing selected algorithm which is based on remain-energy and improving it by taking advantage of the self-adaptive characteristic of ant-optimization. The simulation results demonstrate that the routing selected algorithm has better performance than AODV algorithm in aspects of loading and unloading capacity, average end-to-end delay and lifetime in the networks, and it can improve the performance the ant-colony optimized algorithm can improve in a certain extent.