Improvements on Ant Routing for Sensor Networks

  • Ying Zhang
  • Lukas D. Kuhn
  • Markus P. J. Fromherz
Conference paper

DOI: 10.1007/978-3-540-28646-2_14

Volume 3172 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Zhang Y., Kuhn L.D., Fromherz M.P.J. (2004) Improvements on Ant Routing for Sensor Networks. In: Dorigo M., Birattari M., Blum C., Gambardella L.M., Mondada F., Stützle T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2004. Lecture Notes in Computer Science, vol 3172. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Ying Zhang
    • 1
  • Lukas D. Kuhn
    • 2
  • Markus P. J. Fromherz
    • 1
  1. 1.Palo Alto Research CenterPalo AltoUSA
  2. 2.Ludwig Maximilian UniversityMunichGermany