Skip to main content

Performance of an Ant Colony Optimization (ACO) Algorithm on the Dynamic Load-Balanced Clustering Problem in Ad Hoc Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3801))

Abstract

This paper examines the performance of a recently proposed ACO algorithm when applied to the problem of constructing load-balanced clusters in ad hoc networks with node mobility. Performance, in this context, is measured in terms of the magnitude of change in solution quality after nodes move, and reactivity. Reactivity refers to the number of cycles ACO takes to recover from any degradation in solution quality resulting from node movements. Empirical results on 16 problem instances of various sizes revealed a positive correlation

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dorigo, M., Maniezzo, V., Colorni, A.: Positive Feedback as a Search Strategy. Technical Report 91-016, Politecnico di Milano, Italy (1991)

    Google Scholar 

  2. Bonabeau, E., Théraulaz, G.: Swarm Smarts. Scientific American 282(3), 72–79 (2000)

    Article  Google Scholar 

  3. Dorigo, M., Gambardella, L.M.: Ant Colony System: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, and Cybernetics – Part B 26(1), 29–41 (1996)

    Article  Google Scholar 

  4. Maniezzo, V., Colorni, A.: The ant system applied to the quadratic assignment problem. IEEE Trans. Knowledge and Data Engineering 11(5), 769–778 (1999)

    Article  Google Scholar 

  5. Colorni, A., Dorigo, M., Maniezzo, V., Trubian, M.: Ant system for job-shop scheduling. Belgian Journal of Operations Research, Statistics and Computer Science (JORBEL) 34, 39–53 (1994)

    MATH  Google Scholar 

  6. Gambardella, L.M., Taillard, E., Agazzi, G.: Ant colonies fir vehicle routing problems. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization. McGraw-Hill, New York (1999)

    Google Scholar 

  7. Gambardella, L.M., Dorigo, M.: HAS-SOP: An hybrid ant system for the sequential ordering problem. Technical Report 11-97, IDSIA, Lugano, CH (1997)

    Google Scholar 

  8. Costa, D., Hertz, A.: Ants can color graphs. Journal of the Operations Research Society 48, 295–305 (1997)

    MATH  Google Scholar 

  9. Michel, R., Middendorf, M.: An island model based ant system with lookahead for the shortest supersequence problem. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 692–701. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  10. Di Caro, G., Dorigo, M.: AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research (JAIR) 9, 317–365 (1998)

    MATH  Google Scholar 

  11. Subramanian, D., Druschel, P., Chen, J.: Ants and reinforcement learning: A case study in routing in dynamic networks. In: Proc. of IJCAI 1997, International Joint Conference on Artificial Intelligence, pp. 832–838. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  12. Ho, C.K., Ewe, H.T.: A hybrid ant colony optimization approach for creating load-balanced clusters. In: Proc. IEEE Congress on Evolutionary Computation 2005 (CEC 2005), Edinburgh, Scotland, September 2-5 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ho, C.K., Ewe, H.T. (2005). Performance of an Ant Colony Optimization (ACO) Algorithm on the Dynamic Load-Balanced Clustering Problem in Ad Hoc Networks. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_92

Download citation

  • DOI: https://doi.org/10.1007/11596448_92

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30818-8

  • Online ISBN: 978-3-540-31599-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics