arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.07498cs.NIcs.ITmath.IT
收藏

卫星网络地面站安装费用最小化:复杂性、动态规划与近似算法

Minimizing the Installation Cost of Ground Stations in Satellite Networks: Complexity, Dynamic Programming and Approximation Algorithm

Christos N. Efrem, Athanasios D. Panagopoulos

摘要:

在这封信中,我们研究的最佳选择的地面站(GS)在RF/光卫星网络(SatNets),以尽量减少总的安装成本下的中断概率的要求,假设独立的天气条件之间的网站。首先,我们表明,优化问题可以制定为一个二元线性规划问题,然后我们给出了一个正式的证明,其NP-困难。此外,我们设计了一个动态规划算法的伪多项式复杂性与全局优化的保证,以及一个有效的(多项式时间)近似算法与可证明的性能保证的距离上实现的目标值从全局最优值。最后,通过数值仿真验证了所提出算法的性能。

英文摘要:

In this letter, we study the optimum selection of ground stations (GSs) in RF/optical satellite networks (SatNets) in order to minimize the overall installation cost under an outage probability requirement, assuming independent weather conditions between sites. First, we show that the optimization problem can be formulated as a binary-linear-programming problem, and then we give a formal proof of its NP-hardness. Furthermore, we design a dynamic-programming algorithm of pseudo-polynomial complexity with global optimization guarantee as well as an efficient (polynomial-time) approximation algorithm with provable performance guarantee on the distance of the achieved objective value from the global optimum. Finally, the performance of the proposed algorithms is verified through numerical simulations.

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

↑