LEO卫星网络中一种简洁的星上分布式路由协议
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

Supported by the National Natural Science Foundation of China under Grant No.90104001 (国家自然科学基金); the National High-Tech Research and Development Plan of China under Grant No.2002AA712032 (国家高技术研究发展计划(863))


A Light Weight On-Board Distributed Routing Protocol for LEO Satellite Networks
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    在具有星际链路的低地球轨道(LEO)卫星网络中,高度动态的网络拓扑和受限的星上资源为其路由协议设计带来很大的挑战.提出了一种简洁的星上分布式路由协议ODRP来应对这种挑战.在ODRP协议中,单层LEO星座被作为双层星座处理.根据星际链路动态特性和流量分布情况,各轨道面内位于一定位置的卫星节点被选作为轨道面发言人,从而实现简洁的分布式分层路由.实验结果表明,ODRP能够适应网络拓扑的动态变化,保证路由最优.尤其是在高负载情况下,能够有效降低分组丢失率.通过复杂性分析得知,与其他星上路由机制相比,ODRP具有较低的通信开销、计算开销和存储开销.

    Abstract:

    In LEO satellite networks with inter-satellite links, the highly dynamic topology and the limited on-board resources pose special challenges to routing protocol design. In this paper, a light weight on-board distributed routing protocol is proposed to cope with these challenges. For ODRP, the single layer LEO satellite constellation is considered as double-layer constellation. A satellite at special geographical position is selected as the plane speaker according to the dynamic characteristics of inter-satellite links and the distribution of traffic load carried by the network, consequently the idea of distributed hierarchical routing is realized. Experimental results show that ODRP has the adaptive abilities to deal with the dynamic topology of LEO satellite networks and guarantees the path's optimality, and especially can decrease the packet loss probability efficiently in case of high traffic load. Furthermore, results from the implementation complexity analysis demonstrate that the proposed protocol has lower onboard computational, storage and signaling requirements than other on-board routing schemes.

    参考文献
    相似文献
    引证文献
引用本文

白建军,卢锡城,彭伟. LEO卫星网络中一种简洁的星上分布式路由协议.软件学报,2005,16(12):2139-2149

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2004-08-24
  • 最后修改日期:2005-03-10
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号