Skip to Main Content
ASME Press Select Proceedings

International Conference on Information Technology and Computer Science, 3rd (ITCS 2011)

V. E. Muhin
V. E. Muhin
National Technical University of Ukraine
Search for other works by this author on:
W. B. Hu
W. B. Hu
Wuhan University
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

How to get highly efficient data routing in the networks with limited resource is one of the most important problems in the study of the wireless sensor networks. In this paper we deeply research the algorithms of routing in WSNs and ACO (Ant Colony Optimization). Considering the changes of network topology and limited energy, we give out a dynamic routing algorithm based on the ACO. This algorithm can provide efficiently communicating based on the self-organization, self-adaptation and dynamically optimizing characters for ACO.

I. Introduction
II. Ant Colony Algorithm
III. Dynamic Routing Algorithm Based on ACO For Wireless Sensor Networks
IV. Parameter Selection and Analysis
V. Algorithm Features
VI. Conclusion
This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal