Reinforcement learning based dynamic distributed routing scheme for mega LEO satellite networks

Recently, mega Low Earth Orbit (LEO) Satellite Network (LSN) systems have gained more and more attention due to low latency, broadband communications and global coverage for ground users. One of the primary challenges for LSN systems with inter-satellite links is the routing strategy calculation and maintenance, due to LSN constellation scale and dynamic network topology feature. In order to seek an efficient routing strategy, a Q-learning-based dynamic distributed Routing scheme for LSNs (QRLSN) is proposed in this paper. To achieve low end-to-end delay and low network traffic overhead load in LSNs, QRLSN adopts a multi-objective optimization method to find the optimal next hop for forwarding data packets. Experimental results demonstrate that the proposed scheme can effectively discover the initial routing strategy and provide long-term Quality of Service (QoS) optimization during the routing maintenance process. In addition, comparison results demonstrate that QRLSN is superior to the virtual-topology-based shortest path routing algorithm.     

Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.     

面向导航增强的低轨卫星钟差确定及预报方法研究

低轨导航增强是未来导航发展的重要趋势,而高精度低轨卫星钟差是实现低轨导航增强的必要条件。基于Sentinel-6A卫星,对低轨卫星钟差特性进行了分析,给出了钟差确定方法及影响因素,介绍了顾及钟差特性的低轨卫星钟差预报方法。实验表明,低轨卫星钟差含有多个周期项,给低轨卫星建模和预报带来了困难。与使用运动学定轨模型相比,基于简化动力学的定轨模型可显著提升低轨卫星钟差精度;当基于运动学模型确定低轨卫星钟差时,相较于使用GPS单系统数据,多GNSS观测数据可提升低轨卫星钟差精度。研究表明,基于GPS和Galileo观测的Sentinel-6A卫星钟差精度相较于GPS单系统钟差精度改善了36%,同时,所使用的GNSS产品精度与低轨卫星钟差精度密切相关。利用顾及卫星钟差特性的低轨卫星钟差预报方法,当预报时长小于1 min,低轨卫星钟差预报精度（预报与解算值之差的RMSE）在0.1 ns之内,当预报时长小于5 min,预报精度在0.3 ns之内,随着预报时长的增长,预报精度显著下降。     

Research of multi-path routing based on network coding in space information networks

A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks. On the basis of traditional multi-path routing, the algorithm uses a random linear network coding strategy to code data pack- ets. Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together. The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding. Meanwhile, the algorithm also adopts the flow distribution strategy based on time delay to balance network load. Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate, reduce packet delay, and enhance network performance.     

一种移动卫星网络最小费用切换算法(英文)

For mobile satellite networks, an appropriate handover scheme should be devised to shorten handover delay with optimized application of network resources. By introducing the handover cost model of service, this article proposes a rerouting triggering scheme for path optimization after handover and a new minimum cost handover algorithm for mobile satellite networks. This algorithm ensures the quality of service （QoS） parameters, such as delay, during the handover and minimizes the handover costs. Simulation indicates that this algorithm is superior to other current algorithms in guaranteeing the QoS and decreasing handover costs.     

基于网络编码的空间DTN中CGR改进算法

随着空间通信技术的发展,卫星节点的增多,以及容延迟容中断通信需求的不断提高,空间DTN (DelayTolerant Network,容延迟网络)环境中各通信节点间的路由技术日益重要,相继出现了多种适用于DTN的路由技术.基于空间DTN的结构与特点,对CGR(Contact Graph Routing,接触图路由)算法以及基于编码的路由算法进行了分析比较,然后针对空间DTN中CGR算法的缺点和不足,研究提出了基于NC(Network Coding,网络编码)的空间DTN中的CGR改进算法(NC-CGR),并通过仿真实验平台对算法性能进行了分析评估.仿真结果表明,相比于CGR算法,NC-CGR算法在链路传输时延、传输包裹数目、中继缓存大小、链路丢包率等不同条件下的适应性方面均表现出较大优势,更适用于具有复杂拓扑、带宽受限、高动态特性的空间DTN环境.     

适于低轨卫星IP网络的单核共享树组播算法(英文)

为了解决低轨卫星IP网络中现有典型源组播算法的信道资源浪费问题,本文提出了一套单核共享树组播算法,即核心群合并共享树(CCST)和加权核心群合并共享树(w-CCST)算法。CCST 算法包括动态近似中心(DAC)选核方法和核心群合并组播路径构建方法。DAC方法专为周期、规律运动的低轨卫星网络提出,不需要复杂的星上计算。在核心群合并方法中,以核节点作为初始核心群,通过核心群和剩余组成员的最短路径方法逐步扩展直至整棵组播树构建完成,从而使得组播树的树代价最小,大大提高了网络的带宽利用率和组播传输效率。w-CCST 算法中所提出的加权因子可以调整树代价和端到端传播时延之间的折衷程度,因此,可以通过调整加权因子来适度增大树代价、降低端到端传播时延以支持某些端到端时延要求苛刻的实时组播业务。最后,与低轨卫星 IP 网络中典型算法进行了性能比较,仿真结果说明,CCST 算法的平均树代价比其它算法显著降低,w-CCST 算法的平均端到端传播时延小于 CCST 算法。