Improvements on Ant Routing for Sensor Networks

  • Ying Zhang
  • Lukas D. Kuhn
  • Markus P. J. Fromherz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3172)

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.

References

  1. 1.
    Di Caro, G., Dorigo, M.: Antnet: Distributed stigmergetic control for communication networks. Journal of Artificial Research 9, 317–365 (1998)MATHGoogle Scholar
  2. 2.
    Cerpa, A., Estrin, D.: Ascent: Adaptive self-configuring sensor networks topologies. In: Proc. IEEE InfoComm., New York (June 2002)Google Scholar
  3. 3.
    Chu, M., Haussecker, H., Zhao, F.: Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks. Int. Journal on High Performance Computing Applications (JUne 2002)Google Scholar
  4. 4.
    Subramanian, J.C.D., Druschel, P.: Ants and reinforcement learning: A case study in routing in dynamic networks. Technical report tr96-259, Rice University (July 1998)Google Scholar
  5. 5.
    Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics - Part B 26(1), 1–13 (1996)Google Scholar
  6. 6.
    Estrin, D., Govindan, R., Heidemann, J., Kumar, S.: Next century challenges: Scale coordinations in sensor networks. In: Proc. ACM MobiComm., Seattle, WA, August 17-19, pp. 263–270 (1999)Google Scholar
  7. 7.
    Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: Proc. 6th Int’l Conf. on Mobile Computing and Networks (ACM Mobicom), Boston, MA (2000)Google Scholar
  8. 8.
    Perkins, C.E., Royer, E.M.: Ad hoc on-demand distance vector routing. In: Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications, February 1999, pp. 90–100 (1999)Google Scholar
  9. 9.
    Royer, E., Toh, C.: A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications (April 1999)Google Scholar
  10. 10.
    Schoonderwoerd, R., Holland, O., Bruten, J., Rothkrantz, L.: Ant-based load balancing in telecommunications networks. Adaptive Behavior 5(2), 169–207 (1997)CrossRefMATHGoogle Scholar
  11. 11.
    Simon, G.: Probabilistic wireless network simulator, http://www.isis.vanderbilt.edu/projects/nest/prowler/
  12. 12.
    Zhang, Y., Fromherz, M.: Message-initiated constraint-based routing for wireless ad-hoc sensor networks. In: Proc. IEEE Consumer Communication and Networking Conference (2004)Google Scholar

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

Personalised recommendations