基于链路信息的卫星网络最优路径选择策略
分层卫星网络路由协议在通信时比单层卫星网络有更好的表现,但是同样有着一些缺点。快照的频繁切换导致计算开销大、链路拥塞和节点失效时处理能力较差。针对LEO/MEO卫星网络的特点,提出了一种新的路由协议。计算相邻卫星间的实际通信开销,和预估可选卫星到目的卫星间的通信开销,在保证一定链路利用率和低延时的情况下,选择一条最优路径。当链路切换或节点失效时,缩小路径搜索区域,无需重新计算源卫星节点到目的卫星节点路径,只更新部分失效节点,减少计算开销。通过仿真发现,该算法在路径建立以及链路拥塞等方面具有良好的性能。...
        Saved in:
      
    
          | Published in | 计算机工程与科学 Vol. 39; no. 3; pp. 470 - 476 | 
|---|---|
| Main Author | |
| Format | Journal Article | 
| Language | Chinese | 
| Published | 
            武汉大学计算机学院软件工程国家重点实验室,湖北武汉430072
    
        2017
     武汉大学地球空间信息技术协同创新中心,湖北武汉430072  | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 1007-130X | 
| DOI | 10.3969/j.issn.1007-130X.2017.03.010 | 
Cover
| Summary: | 分层卫星网络路由协议在通信时比单层卫星网络有更好的表现,但是同样有着一些缺点。快照的频繁切换导致计算开销大、链路拥塞和节点失效时处理能力较差。针对LEO/MEO卫星网络的特点,提出了一种新的路由协议。计算相邻卫星间的实际通信开销,和预估可选卫星到目的卫星间的通信开销,在保证一定链路利用率和低延时的情况下,选择一条最优路径。当链路切换或节点失效时,缩小路径搜索区域,无需重新计算源卫星节点到目的卫星节点路径,只更新部分失效节点,减少计算开销。通过仿真发现,该算法在路径建立以及链路拥塞等方面具有良好的性能。 | 
|---|---|
| Bibliography: | satellite network ; path selection ; link overhead ZHU Zhen-kai1,2, HUANG Chuan-he1,2 (1. State Key Lab of Software Engineering, School of Computer,Wuhan University,Wuhan 430072; 2. Collaborative Innovation Center of Geospatial Technology,Wuhan University, Wuhan 430072, China) 43-1258/TP Two-layered LEO/MEO satellite networks outperform single-layered satellite networks for their better communication service, however, frequent switching of snapshots leads to large compu- tation cost, poor handling capacity of link congestion and node failure. According to the characteristics of LEO/MEO satellite networks, we propose a routing protocol, which can calculate the actual commu- nication overhead between adjacent satellites, estimate the communication overhead between an optional satellite and the destination satellite, and select an optimal path to ensure certain link utilization and low delay. When the link switch or node failure happens, we narrow the searching area. It therefore be- comes unnecessary to recalculat  | 
| ISSN: | 1007-130X | 
| DOI: | 10.3969/j.issn.1007-130X.2017.03.010 |