一种高效的LEO卫星星座路由算法  

An effective routing algorithm for LEO satellite constellation

作　　者：邹琪[1] 白跃彬[1] 吴渭[2] 骆连合[2] 巨燕文[1] 钱德沛[1] 

机构地区：[1]北京航空航天大学计算机学院,北京100083 [2]中国电子科技集团公司第54研究所,石家庄050081

出　　处：《高技术通讯》2008年第8期795-800,共6页Chinese High Technology Letters

基　　金：863计划(2007AA01Z118);国家自然科学基金(90612004、90412011、60673180、90104022)资助项目

摘　　要：针对由小卫星组成的低地球轨道(LEO)卫星星座网络的星上计算能力和存储资源有限,以及传统的星座路由算法虽能很好地适应网络的动态性但对星上计算能力和存储资源的要求都较高的问题,在基于对实际 LEO 卫星星座网络充分分析的基础上,提出了一种基于离线计算的简洁高效的路由算法。该算法在保证路由有效性的前提下,能够通过使用备份路径来提供流量自适应机制。复杂性分析和仿真结果表明,该算法只需较小的星上存储开销和星上处理开销,而且具有较好的端到端时延性能。该算法简洁、高效的特点使其能作为实际 LEO 卫星星座网络的实用化路由协议。Considering that low earth orbit （LEO） satellite constellation networks composed of small satellites have limited computing capability and storage resource and current constellation routing algorithms can adapt to dynamic network topology but they call for critical requirements of computing capability and storage resource, the paper proposes a simple and effective off-line computing-based routing algorithm, after analyzing the characteristics of practical LEO satellite constellation networks. The algorithm not only provides a reliable route, but also provides a traffic adaptive scheme by backup paths. The analysis of algorithm complexity and simulation results show that the proposed algorithm has lower onboard overload and better end-to-end delay performance. This simple and effective routing algorithm can be applied to practical LEO satellite constellation networks.

关 键 词：LEO卫星星座 路由算法 离线计算 自适应流量 

分 类 号：TN927.2[电子电信—通信与信息系统]