Evaluation of algorithms for efficient partitioning and scheduling of data bursts in satellite communications

Abstract

SUMMARYWe evaluate four scheduling algorithms for satellite communications that use the Time Division Multiple Access methodology. All the algorithms considered are based on the open-shop model. The open-shop model is suitably represented or modified to exploit some existing algorithms to solve the satellite communication problem. In the first two algorithms, namely pre-emptive scheduling with no intersatellite links and greedy heuristics with two intersatellite links, a (traffic) matrix representation of the open-shop model is used to get a near optimal schedule. In the next two algorithms, generalized heuristic algorithm and the branch and bound algorithm, the open-shop model is modified to accommodate the inter-satellite link and this modified open-shop model is used to solve for a near optimal schedule. The basic methodology of all the algorithms are briefly described and their performance was evaluated through extensive simulations. The performance criteria to evaluate the algorithms are}run time of the algorithms, schedule lengths, and optimality of the algorithm against theoretical bounds. Three of the abovementioned algorithms are evaluated by comparing the performance criteria under similar conditions. Optimal branch and bound algorithm is not evaluated due to its high complexity. The general heuristic algorithm is found to give a good trade off between computation time and optimality. The computation time is comparable with the pre-emptive scheduling algorithm and greedy heuristic algorithm and the schedule length achieved is near to the lower bound value.

Distributed finite-time configuration containment control for satellite formation

“…where Theorem 1. Consider the satellite formation system in equations (1) and (2). There exist general disturbances in follower satellites and only a subset of follower satellites can receive the leader satellites' information.…”

“…Satellites are used in many fields, like communication satellites, meteorological satellites, and deep space exploration. [1][2][3][4] However, space missions have become more and more diversified, which cause some problems when certain design goals are achieved by one single satellite, for example, the structures become more complex, and the costs increase. Meanwhile, once there exists a partial failure in the satellite, the entire mission is on the risk of failure.…”

“…Performance comparisons of finite-time (FT) and non-finite-time (NFT) algorithms(2). The impact of parameter on performance indexes.…”

Neural network-based distributed adaptive configuration containment control for satellite formations

“…Satellite formation flying means to assign the complex tasks of a large satellite to a group of small satellites which have information interaction and cooperative control in a certain space. 5,6 The main advantages of satellite formation flying include higher reliability, better adaptability, and lower costs. 7 At present, most satellite formation systems adopt the master-slave control strategies which mean that one main satellite (denoted as the master) receives the control information from the ground and the other satellites (denoted as the slaves) track the master.…”

“…Satellite formation flying means to assign the complex tasks of a large satellite to a group of small satellites which have information interaction and cooperative control in a certain space. 5,6 The main advantages of satellite formation flying include higher reliability, better adaptability, and lower costs. 7…”