Abstract
Ad-hoc wireless sensor networks have been an active research topic for the last several years. Sensor networks are distinguished from traditional networks by characteristics such as deeply embedded routers, highly dynamic networks, resource-constrained nodes, and unreliable and asymmetric links. Ant routing has shown good performance for communication networks; in this paper, we show why the existing ant-routing algorithms do not work well for sensor networks. Three new ant-routing algorithms are proposed and performance evaluations for these algorithms on a real application are conducted on a routing simulator for sensor networks. © 2004 Springer-Verlag.
Cite
CITATION STYLE
Zhang, Y., Kuhn, L. D., & Fromherz, M. P. J. (2004). Improvements on ant routing for sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3172 LNCS, pp. 154–165). Springer Verlag. https://doi.org/10.1007/978-3-540-28646-2_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
