Ant Colony Optimization-Based Location-Aware Routing for Wireless Sensor Networks
The routing for Wireless Sensor Networks (WSNs) is a key and hard problem, and it is a research topic in the field of WSN applications. Based on Ant Colony Optimization (ACO), this paper proposes a novel adaptive intelligent routing scheme for WSNs. Following the proposed scheme, a high performance routing algorithm for WSNs is designed. The proposed routing scheme is very different from the existing ACO based routing schema for WSNs. On one hand, in the proposed scheme, the search range for an ant to select its next-hop node is limited to a subset of the set of the neighbors of the current node. On the other hand, by fusing the residual energy and the global and local location information of nodes, the new probability transition rules for an ant to select its next-hop node are defined. Compared with other ACO based routing algorithms for WSNs, the proposed routing algorithm has a better network performance on aspects of energy consumption, energy efficiency, and packet delivery latency.
KeywordsWSN routing ACO pheromone transition probability simulation
Unable to display preview. Download preview PDF.
- 4.Aghaei, R.G., Rahman, M.A., Gueaieb, W., Saddik, A.E.: Ant colony-based reinforcement learning algorithm for routing in wireless sensor networks. In: 2007 IEEE Instrumentation and Measurement Technology, pp. 1–6. IEEE Press, New York (2007)Google Scholar
- 12.Chakrabarty, K., Iyengar, S.S.: Scalable infrastructure for distributed sensor networks. Springer, Heidelberg (2005)Google Scholar