Ant colony optimisation for the routing problem in the constellation network with node satellite constraint. (2017)

• Record Type: Journal Article
• Authors: Li, Jing; Ke, Liangjun; Ye, Gangqiang; Zhang, Tianjiao
• Is Part Of: International journal of bio-inspired computation. Volume 10:Number 4(2018)
• Page Start: 267
• Page End: 274
• Publication Date: 2017
• Subjects: satellite network -- inter-satellite links -- ISLs -- routing -- network management -- node satellite; Biologically-inspired computing -- Periodicals; Computational biology -- Periodicals; 572.0285
• Languages: English
• ISSNs: 1758-0366

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.