期刊文献+

一种新的低轨通信星座路由技术研究与仿真 被引量:1

Study and Simulation of Novel Routing Technology in LEO Constellation Communication System
下载PDF
导出
摘要 低轨星座卫星通信系统由于卫星间的相对运动使卫星的相互可见关系不断变化,这给星上交换的路由选择带来了挑战。研究具有同轨及异轨星间链路,并具有星上交换的24/3/1walker星座网络,将星间链路状态与星座网络的拓扑快照相结合,提出了两种路由优化方案—业务加权的路由优化方案以及基于K短路径的路由优化方案,并进行了仿真研究,得出了有用的结果。 In LEO satellite constellation communication system,the visibility relationship between satellites changes continuously because of the continual movement of satellite;this makes the routing technology to be a big challenge for onboard switching.Considering the 24/3/1 walker satellite constellation with onboard switching that has inter-ISL and intra-ISL,two routing optimizing scenarios based on satellite-link state and topology snapshot were suggested,that is the routing optimization based on traffic weighting and the routing optimization based on k-shortest path.A simulation about these two routing optimizing scenarios provides some useful results.
出处 《系统仿真学报》 CAS CSCD 北大核心 2009年第24期7842-7844,7850,共4页 Journal of System Simulation
基金 国家"863"高技术研究发展计划(2008AA12A204) 国家自然科学基金(60972061 60972062)
关键词 星座网络 拓扑快照 路由技术 仿真 constellation network topology snapshot routing technology simulation
  • 相关文献

参考文献7

  • 1Fsa_based link assignment and routing in low orbit satellite networks [J]. IEEE Transactions on Vehicular Technology (S0018-9545), 1998, 47(3): 1037-1048.
  • 2郦苏丹.星座卫星通信系统体系及关键技术研究[R].江苏南京:解放军理工大学通信工程学院,博士后工作报告,2005.
  • 3张涛,柳重堪,张军.卫星时变拓扑网络最短路径算法研究[J].计算机学报,2006,29(3):371-377. 被引量:24
  • 4张海忠,王东进,丁俊章.一种优化的卫星通信星际路由算法设计[J].通信学报,2003,24(10):139-144. 被引量:5
  • 5陈文兰,潘荫荣.一个求解次短和渐次短路径的实用算法[J].计算机应用与软件,2006,23(1):94-96. 被引量:5
  • 6John Hershberger, Matthew Maxel, Subhash Suri. Finding the K shortest simple paths: A new algorithm and its implementation [J]. ACM Transaction on Algorithms (S1549-6325), 2007, 3(4): 11-14.
  • 7Christopher C SKISCIM. Brace L GOLDEN Solving k-shortest and Constrained Shorten path Problems Efficiently [J]. Annals of Operations Research (S0254-5330), 1989, 20(20): 249-282.

二级参考文献22

  • 1王东进 张海忠 周林风 等.适于中国的几种卫星组网通信方案[A]..微小卫星和星座技术学术研讨会[C].,1999.189-200.
  • 2WERNER M, DELUCCHI C, VOGEL H J, et al. ATM-based routing in LEO/MEO satellite networks with intersatellite links[J].IEEE Journal on Selected Areas in Communications, 1997,15( 1):69-82.
  • 3WERNER M, JAHN A, et al. Analysis of system parameters for LEO/ICO-satellite communication networks[J]. IEEE JSAC, 1995,13(2): 371-381.
  • 4E. W. Dijkstra, A note on Two Problem in connexion with graphs, Numeric Mathematics 1 (1959) ,269 -271.
  • 5Stuart E. Dreyfus,An Appraisal of Some Shortest-Path Algorithms. Operations Research, 17 ( 1969 ) ,395 - 412.
  • 6Luis C. Dias and Joao N. Climaco, Shortest path problems with partial information:Models and algorithms for detecting dominance, European Journal of Operation Research, 121 (2000), 16 - 31.
  • 7Narsingh Deo and Chi-yin Pang, Shortest-Path Algorithms:Taxonomy and Annotation. Networks, Vol. 14 (1984) ,275 - 323.
  • 8Yen JY. Finding the k shortest loopless paths in a network. Management Science 17( 1971 ) ,712 - 16.
  • 9Katoh N. , Ibaraki T. , Mine H. , An efficient algorithm for k shortest simple paths. Networks, 12 (1982) ,411 - 427.
  • 10Eppstein D. Finding the k shortest paths,SIAM Journal of Computing,28 ( 1998 ),652 - 673.

共引文献31

同被引文献21

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部