arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1912.12911cs.NIcs.DMmath.CO
收藏

卫星系统地面站的全局最优选址

Globally Optimal Selection of Ground Stations in Satellite Systems with Site Diversity

Christos N. Efrem, Athanasios D. Panagopoulos

摘要:

卫星通信系统的可用性受到大气损害的极大限制,例如降雨(无线电频率)和云层覆盖(光学频率)。这个问题的一个解决方案是站点分集技术,其中地理上分布的地面站(GS)的网络能够以高概率确保在每个时间段至少一个GS可用于连接到卫星。然而,冗余GS的安装为网络运营商引入了不必要的额外成本。在这种情况下,我们研究的优化问题,最大限度地减少所需的GS的数量,受可用性约束。首先,将问题转化为一个二进制整数线性规划(BILP)问题,证明了该问题是NP-难的。随后,我们设计了一个分支定界(B&B)算法,具有全局最优性的保证,基于线性规划(LP)松弛和贪婪方法。最后,数值结果表明,该算法显着优于国家的最先进的方法,并具有较低的复杂度,在平均情况下。

英文摘要:

The availability of satellite communication systems is extremely limited by atmospheric impairments, such as rain (for radio frequencies) and cloud coverage (for optical frequencies). A solution to this problem is the site diversity technique, where a network of geographically distributed ground stations (GSs) can ensure, with high probability, that at least one GS is available for connection to the satellite at each time period. However, the installation of redundant GSs induces unnecessary additional costs for the network operator. In this context, we study an optimization problem that minimizes the number of required GSs, subject to availability constraints. First, the problem is transformed into a binary-integer-linear-programming (BILP) problem, which is proven to be NP-hard. Subsequently, we design a branch-and-bound (B&B) algorithm, with global-optimization guarantee, based on the linear-programming (LP) relaxation and a greedy method as well. Finally, numerical results show that the proposed algorithm significantly outperforms state-of-the-art methods, and has low complexity in the average case.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑