Complexity of Routing in Store-and-Forward LEO Satellite Networks
Complexity of Routing in Store-and-Forward LEO Satellite Networks
复制标题
存储转发 LEO 卫星网络中路由的复杂性
DOI：
10.1109/lcomm.2015.2501399
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
Qin Donghong
中科院分区：
文献类型：
--
作者：
Lu Yong;Zhao Youjian;Sun Fuchun;Qin Donghong
本文分析了卫星移动性对存储转发低轨卫星网络路由选择的影响，给出了最小路径伸展调度（MIN-PSS）、最大路径收缩调度（MAX-PCS）和最大恒定路径调度（MAX-CPS）问题的NP难证明。这些结论从理论上证明了存储转发型低轨卫星网络的路由困难性。
In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks.