Skip to main content

Dynamic Routing Exponent Strategies for Ant-Based Protocols

  • Conference paper
Book cover Applications of Evolutionary Computation (EvoApplications 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6625))

Included in the following conference series:

  • 1567 Accesses

Abstract

In ant-based routing protocols, the routing exponent controls how ants hop from node to node to discover routes based on pheromone values. It has been shown that stable multi-route solutions for small routing exponent values are dynamically connected to stable single-route solutions for large routing exponent values. These stable single-route solutions correspond to paths that have the smallest hop count. In this paper, we leverage this idea to improve the performance of ant-based routing protocols by dynamically adjusting the routing exponent. The results are validated via simulation.

This work is supported by U.S. Army Research Laboratory contract #W911QX-09-C-0076. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the Army Research Laboratory or the U.S. Government.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence – From Natural to Artificial Systems. Oxford University Press, New York (1999)

    MATH  Google Scholar 

  2. Di Caro, G.A., Dorigo, M.: AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research 9, 317–365 (1998)

    MATH  Google Scholar 

  3. Di Caro, G.A., Ducatelle, F., Gambardella, L.: AntHocNet: An Adaptive Nature-Inspired Algorithm for Routing in Mobile Ad Hoc Networks. European Transactions on Telecommunications, Special Issue on Self-organization in Mobile Networking 16(5), 443–455 (2005)

    Google Scholar 

  4. Ducatelle, F., Di Caro, G.A., Gambardella, L.: Principles and applications of swarm intelligence for adaptive routing in telecommunications networks. Swarm Intelligence 4(3) (2010) (in press)

    Google Scholar 

  5. Rajagopalan, S., Shen, C.C.: ANSI: A Swarm Intelligence-based Unicast Routing Protocol for Hybrid Ad hoc Networks. Journal of System Architecture, Special issue on Nature Inspired Applied Systems 52(8-9), 485–504 (2006)

    Google Scholar 

  6. Torres, C.E., Rossi, L.F., Keffer, J., Li, K., Shen, C.C.: Modeling, analysis and simulation of ant-based routing protocols. Swarm Intelligence 4(3), 221–244 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fang, R., Huang, Z., Rossi, L.F., Shen, CC. (2011). Dynamic Routing Exponent Strategies for Ant-Based Protocols. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2011. Lecture Notes in Computer Science, vol 6625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20520-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20520-0_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20519-4

  • Online ISBN: 978-3-642-20520-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics