Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (14): 148-150.

• 网络、通信与安全 • Previous Articles     Next Articles

On-Demand Partial Topology Routing Algorithm in LEO Satellite Networks

Yao Weng Lixiang Li   

  • Received:2006-06-08 Revised:1900-01-01 Online:2007-05-10 Published:2007-05-10
  • Contact: Yao Weng


翁耀 刘立祥   

  1. 中科院软件所 上海交通大学电子信息学院
  • 通讯作者: 翁耀

Abstract: Satellite networks provide global coverage and support a wide range of services; in particular, Low Earth Orbit (LEO) satellites are becoming more and more important for their short round trip delays. One of the challenges in LEO satellite network research is to develop a specialized and efficient routing algorithm. In this paper, the researches that have been done in the passed ten years are reviewed, and a simple and efficient routing algorithm (On-Demand Partial Topology Routing Algorithm) is proposed. This algorithm guarantees the routes have the minimum delay while having a good convergence time which make the algorithm suitable for the dynamic topology of LEO satellite networks. Then, the performance of the algorithm is evaluated through simulation and future works are also proposed.

摘要: 卫星网络提供全球覆盖并且支持广泛的服务类型,其中低轨卫星(LEO)网络因其低延时而在应用中变得越来越重要,而设计一种高效的、专用于卫星网络的路由算法成为低轨卫星网络应用的关键。论文首先对近10年来低轨卫星网络路由算法的研究进行总结和分析,在已有研究的基础上,提出了一种简单有效的路由算法——按需局部拓扑路由算法。该算法在保证建立的路由具有最小延时的同时,具有很好的收敛时间,能够有效地适应低轨卫星网络的动态拓扑特性。论文还给出了局部拓扑路由算法的仿真结果及分析;最后给出了下一步研究的重点——基于Qos的路由算法。