Routing optimization based on ant colony algorithm for wireless sensor networks with long-chain structure

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With the high demand of real-time and reliability, an ant colony algorithm with local search for lines monitoring sensor network is proposed. Heuristic function takes into account link delay, packet rate and distances from the sink node, local search is made every t iteration. Each node no need to maintain the global information, but needed to give the only Numbers. Simulation results show that the algorithm can quickly jump out of local optimum and find path with good performance in real-time and reliability. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Gao, J., Wei, L., Zhu, Y., & Li, L. (2012). Routing optimization based on ant colony algorithm for wireless sensor networks with long-chain structure. In Communications in Computer and Information Science (Vol. 312 CCIS, pp. 91–97). https://doi.org/10.1007/978-3-642-32427-7_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free