Skip to main navigation Skip to search Skip to main content

An adaptive routing based on an improved ant colony optimization in LEO satellite networks

  • Zi He Gao*
  • , Qing Guo
  • , Ping Wang
  • *Corresponding author for this work
  • Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Ant colony optimization (ACO) has been proposed as a promising algorithm for adaptive routing in communication networks. The algorithm is being successfully applied to optimization problems in a variety of fields. The original ACO has the disadvantages of stagnation behavior and slow convergence .The paper testes and improves the variants of the original ACO in order to give better performances. The improved routing algorithm is simulated in Iridium satellite constellation. The results show that the improved ACO not only achieves fast convergence in dynamic topology networks, but also can avoid networks congestion and counterpoise the load of the network.

Original languageEnglish
Title of host publicationProceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007
Pages1041-1044
Number of pages4
DOIs
StatePublished - 2007
Event6th International Conference on Machine Learning and Cybernetics, ICMLC 2007 - Hong Kong, China
Duration: 19 Aug 200722 Aug 2007

Publication series

NameProceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007
Volume2

Conference

Conference6th International Conference on Machine Learning and Cybernetics, ICMLC 2007
Country/TerritoryChina
CityHong Kong
Period19/08/0722/08/07

Keywords

  • ACO
  • Adaptive routing
  • LEO
  • Mobile agents

Fingerprint

Dive into the research topics of 'An adaptive routing based on an improved ant colony optimization in LEO satellite networks'. Together they form a unique fingerprint.

Cite this