期刊名称：International Journal of Computer Science and Management Studies
电子版ISSN：2231-5268
出版年度：2013
卷号：13
期号：2
出版社：Imperial Foundation
摘要：Wireless Sensor Networks comprises of small sensor nodes communicating with each other in a network topology which keeps on varying. The wireless sensor nodes also known as motes have limited energy resources along with constraints on its computational and storage capabilities. Due to these restrictions coupled with its dynamic topology, routing in Wireless Sensor Networks (WSN) is a very challenging task. In Current research on routing in wireless sensor networks mostly focused on protocols that are energy aware to maximize the lifetime of the network, scalable for large number of sensor nodes and tolerant to sensor damage and battery exhaustion. There are number of reasons that ACO algorithms are a good fit for WSN routing. ACO algorithms are decentralized just as WSNs are similarly decentralized. In this paper an adaptation of Ant Colony Optimization (ACO) technique is demonstrated for network routing. This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating and storing food. The ant routing algorithm performs well for symmetric networks with good success rates and energy efficiency. However, for denser networks the loss rate becomes high with the decrease in success rate and energy efficiency. Furthermore, if the network does not have a symmetric path, the algorithms do not work well as the ant wanders wastefully for searching the destination.
