Name
Abstract | ||
|---|---|---|
Mission scheduling algorithms are envisioned as critical to satisfy the increasing mission requirements in broadband data relay satellite networks, which is severely influenced by time-varying inter-satellite contacts (i.e., potential available communication links) and differentiated satellite downlink contacts. Nevertheless, the intertwined effect of such two types of contacts on mission schedules poses daunting challenges for the efficient mission scheduling design. In this paper, to achieve fair performance among user satellites, we maximize the minimum number of successfully scheduled missions over all user satellites by jointly optimizing contact plan design, power allocation (PA) in relay satellites, and mission schedules based on the time-expanded graph. The formulated problem is a mixed-integer nonlinear program optimization problem that is challenging to solve. For tractability purpose, we equivalently decompose the problem into a PA problem and an optimal PA-based mission scheduling (OPA_MS) problem, which is still a mixed-integer linear program. We further devise a new two-stage scheme to efficiently solve the OPA_MS problem. Simulation results validate the significant gains of the proposed algorithm in mission completion number and necessitate the consideration of the time-varying and differentiated inter-satellite and downlink contacts. |
Year | Venue | Field |
|---|---|---|
2018 | IEEE Journal on Selected Areas in Communications | Program optimization,Resource management,Scheduling (computing),Computer science,Communication channel,Computer network,Schedule,Linear programming,Relay,Telecommunications link |
DocType | Volume | Issue |
Journal | 36 | 5 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||