首页 | 本学科首页   官方微博 | 高级检索  
     检索      

低轨预警星座通信网络的路由算法
引用本文:李冬,易东云,程洪玮,周伟.低轨预警星座通信网络的路由算法[J].系统工程与电子技术,2011,33(4):884-887.
作者姓名:李冬  易东云  程洪玮  周伟
作者单位:1. 国防科学技术大学数学与系统科学系, 湖南 长沙 410073; 2. 北京跟踪与通信技术研究所, 北京 100094; 3. 中国人民解放军91708部队司令部自动化办, 广东 广州 510320
摘    要:路由技术是低轨预警星座通信网络需解决的关键技术之一。设计了低轨预警星座通信网络的拓扑结构。提出了多约束最优路由模型,该模型将链路的时延、切换率和可用带宽转化为传输费用,表示了时延和跳数受限的最小费用路由问题。给出了求多约束最优路由问题的最优解算法,此算法通过缩小可行路径的搜索空间降低计算复杂性。仿真结果表明,该路由算法的复杂性和切换性能优于同类算法,适合于星上在线路由计算。

关 键 词:预警星座网络  拓扑结构  多约束最优路由  路由算法

Routing algorithm for LEO early-warning constellation networks
LI Dong,YI Dong-yun,CHENG Hong-wei,ZHOU Wei.Routing algorithm for LEO early-warning constellation networks[J].System Engineering and Electronics,2011,33(4):884-887.
Authors:LI Dong  YI Dong-yun  CHENG Hong-wei  ZHOU Wei
Institution:1. Department of Mathematics and Systems Science, National University of Defense Technology, Changsha 410073, China; ; 2. Beijing Institute of Tracking and Telecommunication Technology, Beijing 100094, China; ; 3. Automatization Office of Unit 91708 Command of PLA, Guangzhou 510320, China
Abstract:The routing technology plays a key role in the LEO early warning constellation network.The topological structure of this network is designed. A multi constrained optimal path (MCOP) model is proposed for this network. This model defines the cost of paths using delay, handover probability and the available bandwidth of links, and shows the delay and hop count constrained least cost path problem. An algorithm is given to find the optimal solution to the MCOP problem. This algorithm greatly reduces the computational amount by decreasing the searching field of feasible paths. Simulation results show that the routing algorithm is superior to other current algorithms in the aspects of computing complexity and handover performance, indicating the adaptability for on line routing.
Keywords:
本文献已被 万方数据 等数据库收录!
点击此处可从《系统工程与电子技术》浏览原始摘要信息
点击此处可从《系统工程与电子技术》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号