2017 IEEE International Conference on Communication, Networks and Satellite (Comnetsat) 2017
DOI: 10.1109/comnetsat.2017.8263566
|View full text |Cite
|
Sign up to set email alerts
|

Data relay system data download scheduling algorithm for earth observation satellites

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…The task T E2 of E 2 is split into two parts D 1 and D 2 for transmission, and it is assumed that R 1 is selected for relaying data to the cloud (this path is determined by the ant colony algorithm as described later). The SAF method (which is described in Section 5.2 below) is used in this process, and the transmit time can be calculated by Equation (8). Suppose that the start time of transmission is T start .…”
Section: Calculation Of Transmission Time In Sub-linksmentioning
confidence: 99%
See 3 more Smart Citations
“…The task T E2 of E 2 is split into two parts D 1 and D 2 for transmission, and it is assumed that R 1 is selected for relaying data to the cloud (this path is determined by the ant colony algorithm as described later). The SAF method (which is described in Section 5.2 below) is used in this process, and the transmit time can be calculated by Equation (8). Suppose that the start time of transmission is T start .…”
Section: Calculation Of Transmission Time In Sub-linksmentioning
confidence: 99%
“…D represents the transmission data and D i represents the ith data packet. The time of D i from the source node to the target node using the jth relay node is calculated as Equation (8).…”
Section: Multi-link Optimization Mechanismmentioning
confidence: 99%
See 2 more Smart Citations
“…Karapetyan et al [12] studied the downlink scheduling problem for Canada's earth observing SAR satellite RADARSAT-2 and proposed a flexible solution approach separating the details of the problem-specific constraints from the optimization mechanism. Liang et al [13] proposed a greedy strategybased heuristic data download scheduling algorithm which considered trade-offs among throughput, Qosand fairness. Ling et al [14] calculated the priority value of each data download task and then adopted a resource competition algorithm, which can be considered a ranking problem to select a data download task with high priority.…”
Section: Introductionmentioning
confidence: 99%