Toward Optimized Network Capacity in Emerging Integrated Terrestrial-Satellite Networks

被引:21
作者
Gong, Shulei [1 ,2 ]
Shen, Hong [3 ]
Zhao, Kanglian [1 ]
Li, Wenfeng [1 ]
Zhou, Haibo [1 ]
Wang, Ruhai [4 ]
Sun, Zhili [5 ]
Zhang, Xinggan [1 ]
机构
[1] Nanjing Univ, Sch Elect Sci & Engn, Nanjing 210093, Peoples R China
[2] China Mobile Grp Jiangsu Co Ltd, Nanjing 210029, Peoples R China
[3] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Peoples R China
[4] Lamar Univ, Dept Elect Engn, Beaumont, TX 77710 USA
[5] Univ Surrey, Inst Commun Syst, Guildford, Surrey, England
基金
中国国家自然科学基金;
关键词
Satellites; Relays; Optimal scheduling; Low earth orbit satellites; Software packages; Sun; Hybrid transmission; integer program; satellite network capacity; scheduling optimization; SYSTEM;
D O I
10.1109/TAES.2019.2915415
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
In this paper, we investigate the transmission schemes of space data systems for optimized network capacity in an integrated terrestrial-satellite network (ITSN) with a two-layered space segment. First, a theoretical model of the network capacity is developed to evaluate the strategy of utilizing both direct and relayed transmissions. Second, we consider the ideal and the resource-constrained scenarios in which the corresponding network capacity is modeled with respect to the scheduling scheme. In particular, closed form and semi-closed form solutions to difficult integer programs are achieved via rigorous mathematical analysis. The proposed model is general for exploring the capacity of various satellite network deployments whose solutions have not been obtained in prior studies. Furthermore, we verify the potential capacity of the different transmission schemes based on the proposed solutions and prove that the system's network capacity can be significantly improved by the hybrid transmission scheme. The theoretical framework proposed in this paper is expected to provide constructive insights in the design for the future space segments of ITSNs.
引用
收藏
页码:263 / 275
页数:13
相关论文
共 25 条
[11]   Daily imaging scheduling of an earth observation satellite [J].
Lin, WC ;
Liao, DY ;
Liu, CY ;
Lee, YY .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2005, 35 (02) :213-223
[12]   A Lagrangian heuristic for satellite range scheduling with resource constraints [J].
Marinelli, Fabrizio ;
Nocella, Salvatore ;
Rossi, Fabrizio ;
Smriglio, Stefano .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (11) :1572-1583
[13]   Self-Organising Satellite Constellation in Geostationary Earth Orbit [J].
Mushet, Garrie ;
Mingotti, Giorgio ;
Colombo, Camilla ;
McInnes, Colin .
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2015, 51 (02) :910-923
[14]   A tutorial on decomposition methods for network utility maximization [J].
Palomar, Daniel P. ;
Chiang, Mung .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (08) :1439-1451
[15]   A Novel Uplink Scheduling Algorithm for the Galileo System [J].
Porretta, Marco ;
Schlarmann, Bernhard Kleine ;
Ballereau, Alexandre ;
Crisci, Massimo .
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2018, 54 (02) :819-833
[16]   Models and Tools to Evaluate Space Communication Network Capacity [J].
Spangelo, S. C. ;
Cutler, J. W. ;
Klesh, A. T. ;
Boone, D. R. .
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2012, 48 (03) :2387-2404
[17]   Optimization-based scheduling for the single-satellite, multi-ground station communication problem [J].
Spangelo, Sara ;
Cutler, James ;
Gilson, Kyle ;
Cohn, Amy .
COMPUTERS & OPERATIONS RESEARCH, 2015, 57 :1-16
[18]   How to model planning and scheduling problems using constraint networks on timelines [J].
Verfaillie, Gerard ;
Pralet, Cedric ;
Lemaitre, Michel .
KNOWLEDGE ENGINEERING REVIEW, 2010, 25 (03) :319-336
[19]   A hybrid method based on krill herd and quantum-behaved particle swarm optimization [J].
Wang, Gai-Ge ;
Gandomi, Amir H. ;
Alavi, Amir H. ;
Deb, Suash .
NEURAL COMPUTING & APPLICATIONS, 2016, 27 (04) :989-1006
[20]  
Wang Jiasheng, 2013, Spacecraft Engineering, V22, P1, DOI 10.3969/j.issn.1673-8748.2013.01.001