Ant colony optimisation for the routing problem in the constellation network with node satellite constraint Online publication date: Fri, 10-Nov-2017
by Jing Li; Liangjun Ke; Gangqiang Ye; Tianjiao Zhang
International Journal of Bio-Inspired Computation (IJBIC), Vol. 10, No. 4, 2017
Abstract: In the field of satellite communication, there is a trend towards interconnecting satellites into a heterogeneous network. Inter-satellite links (ISLs) are used to transmit satellite management data, such as telemetry and telecommand data, as well as application data. The ground stations act as a management entity, which are connected with node satellites. This paper considers a routing problem with the aim of combining the satellite network with ground station management network to make integrated planning under the node satellite constraint. Based on the characteristic of the routing problem, ant colony optimisation is adopted to solve it. Two solution construction methods, i.e., the sequential method and concurrent method, are proposed. Experimental results on real data show that the concurrent ACO algorithm is better, and it can provide better data transmitting bandwidth of ISLs and save ground station management resources, which makes the algorithm suitable for real requirements.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook