Premium
An analytical framework for remote sensing satellite networks based on the model predictive control with convex optimization
Author(s) -
Zheng Yongxing,
Zhao Shanghong,
Tan Qinggui,
Li YongJun,
Jiang Yong,
Xin Ning
Publication year - 2017
Publication title -
international journal of satellite communications and networking
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.388
H-Index - 39
eISSN - 1542-0981
pISSN - 1542-0973
DOI - 10.1002/sat.1234
Subject(s) - computer science , mathematical optimization , heuristic , optimization problem , convex optimization , model predictive control , schedule , throughput , routing (electronic design automation) , transmission (telecommunications) , regular polygon , control (management) , algorithm , computer network , artificial intelligence , telecommunications , geometry , mathematics , wireless , operating system
Summary In this paper, we consider the problem of maximizing the throughput of remote sensing satellite networks. In such networks, the link capacities and routing matrices are varying over time. We propose a convex optimization‐based analytical framework for the problem. To maximize the network throughput under the premise of satisfying the delay constraint, we formulate the data transmission schedule into an optimization problem aiming at maximizing the delay‐constrained throughput. Considering the fact that the future link capacities cannot be accurately known in the actual situation, we propose a heuristic and distributed framework on the basis of model predictive control for approximately solving the problem. This framework can be used to design remote sensing data transmission schedules under various scenarios. We adopt a generic example to simulate and analyze the framework. The simulation results show that the proposed analytic framework can obtain the approximate solution that is very close to the optimal solution by solving the convex optimization problem step‐by‐step. The heuristic algorithm based on model predictive control can obtain the approximate solution, which is very close to the optimal solution in distributed scenario.