earticle

영어

Due to the limited lifetime of nodes in ad hoc and sensor network, energy efficiency needs to be an important design consideration in any routing algorithm. Most of the existing Ant colony based routing algorithms grantee the packet delivery. However, they suffer from the high power consumption due to the huge number of control messages to establish and maintain a route from a source to a destination. This paper introduces two new power-aware ant colony routing algorithms for mobile ad hoc network under three main concurrent constraints. (1) Localized algorithms where only information about neighbors' nodes is needed. (2) Maximize the algorithms delivery rate. (3) Minimize the energy consumption. Our new algorithms are based on the idea of extracting a sub-graph of the original network topology and combine it with the advantage of ant based routing algorithms. Extensive experiments are conducted to prove that the new algorithms have significant improvement on the network lifetime (up to twice) without affecting the high delivery rate.