Delay-Optimal Cooperation Transmission in Remote Sensing Satellite Networks

被引:13
作者
Chen, Long [1 ]
Tang, Feilong [2 ]
Li, Xu [1 ]
Liu, Jiacheng [1 ]
Yang, Yanqin [2 ]
Yu, Jiadi [1 ]
Zhu, Yanmin [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China
[2] East China Normal Univ, Sch Data Sci & Engn, Shanghai 200062, Peoples R China
基金
中国国家自然科学基金;
关键词
Delay-optimal transmission; cooperation transmission; remote sensing satellite networks; ROUTING ALGORITHM; STRATEGY;
D O I
10.1109/TMC.2022.3172848
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many remote sensing applications, such as the forest fire monitoring, need to send a large volume of data to the ground with low delay. Therefore, the cooperation transmission, which relies on cooperation among satellites to achieve continuous transmission, emerges as an indispensable technique. Most existing work cannot optimize the delay through dynamic cooperation transmission. In this paper, we investigate how to optimize the delay in remote sensing satellite networks based on cooperation transmission, where cooperation hotspots refer to the satellites with ground-satellite links to the Earth Stations (ESs). First, we propose the cooperation capability model to quantify capabilities of cooperation hotspots, based on the joint control of the dynamic topology and time-varying available resources. Then, we uniformly model the inter-satellite routing and satellite-ES transmission scheduling, formulate the satellite cooperation transmission problem and prove its NP-hardness. To solve the problem, we propose the delay-optimal cooperation transmission scheme, including the cooperation routing principle based on topology features, the centralized cooperation transmission (CCT) algorithm based on randomized rounding and the distributed cooperation transmission (DCT) based on local information. Both algorithms take advantage of the cooperation capability model and adapt well to the dynamic topology and time-varying available resources. Finally, we formally analyze the approximation ratios and the time complexities of both the CCT and the DCT algorithms. We also prove that the DCT algorithm always setups loop-free paths. NS2-based simulation results demonstrate that our schemes have good scalability, and both CCT and DCT algorithms reduce the end-to-end delay on average by more than 21.77% compared to work in the state-of-the-art, and significantly improve throughput, packet loss rate and flow completion time.
引用
收藏
页码:5109 / 5123
页数:15
相关论文
共 41 条
  • [1] Bai JJ, 2005, 2005 WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, P386
  • [2] Bouttier É, 2018, IEEE ICC
  • [3] Casoni M, 2014, IEEE GLOB COMM CONF, P2850, DOI 10.1109/GLOCOM.2014.7037240
  • [4] Casteigts A, 2012, INT J PARALLEL EMERG, V27, P387, DOI [10.1080/17445760.2012.668546, 10.1007/978-3-642-22450-8_27]
  • [5] Chen L, 2021, P IEEE C COMP COMM, P1
  • [6] Mobility- and Load-Adaptive Controller Placement and Assignment in LEO Satellite Networks
    Chen, Long
    Tang, Feilong
    Li, Xu
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021), 2021,
  • [7] Analysis of Inter-Satellite Link Paths for LEO Mega-Constellation Networks
    Chen, Quan
    Giambene, Giovanni
    Yang, Lei
    Fan, Chengguang
    Chen, Xiaoqian
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2021, 70 (03) : 2743 - 2755
  • [8] A Novel Handover Control Strategy Combined with Multi-hop Routing in LEO Satellite Networks
    Duan, Chaofan
    Feng, Jing
    Chang, Haotian
    Song, Bin
    Xu, Zhikang
    [J]. 2018 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW 2018), 2018, : 845 - 851
  • [9] A multicast routing algorithm for LEO satellite IP networks
    Ekici, E
    Akyildiz, IF
    Bender, MD
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (02) : 183 - 192
  • [10] A distributed routing algorithm for datagram traffic in LEO satellite networks
    Ekici, E
    Akyildiz, IF
    Bender, MD
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2001, 9 (02) : 137 - 147