一种基于时空等级的LEO卫星网络路由策略

随着5G技术的发展和6G技术的研究，低轨卫星网络在未来空天地一体化网络中的地位越发重要，而作为网络核心技术的路由策略仍面临一些挑战，如卫星网络拓扑高动态变化、链路频繁切换、节点计算处理能力有限以及负载流量分布不均衡等。针对卫星所覆盖区域负载不均衡且与时间因素有关，以及星上用户多业务服务质量需求的问题，设计了一种基于时空等级的业务分类负载均衡路由算法。算法考虑了卫星网络流量的分布与时空等级的关系。卫星节点需先根据当前时刻及其所覆盖的地面区域计算其时空等级，并在路由算法的下一跳实时调整阶段加入时空等级作为选路条件之一，同时改进了阈值的计算方式，并在路由时考虑了不同的链路代价以满足多业务服务质量需求。仿真结果表明，相较于DSP、TLR和RMLBR算法，所提算法虽然在总吞吐量表现不及TLR和RMLBR算法，但在时延以及链路利用率方面有所改进，有效降低了平均端到端时延，较好地满足不同业务服务质量需求，均衡网络负载。     

卫星网络动态资源图多QoS约束路由算法

针对高动态卫星网络拓扑变化导致的网络更新期间可用路径失效，QoS需求难以满足的问题，提出了一种基于软件定义网络（SDN）架构的虚拟节点动态资源图多QoS约束路由算法（DRGVN-QR）。根据节点的切换状态、缓存以及链路的剩余带宽、时延等信息，结合虚拟节点的网络拓扑方式，建立虚拟节点动态资源图模型。根据资源图模型，建立最小路径代价的优化模型，利用蚁群算法（ACO）并发地为每个连接请求找到一段时间范围内的最优路径集合，并对信息素挥发系数的取值问题进行了讨论，以提升路径质量和算法性能。最后，为了适应卫星网络的时变性，设计一种幂数加权公式求出一段时间范围内的最优路径。仿真结果表明：DRGVN-QR算法能够规避路径失效带来的传输中断问题，提高网络QoS，与其他算法相比，该算法降低了平均端到端时延、网络丢包率和时延抖动。     

星载GPS测量数据预处理方法研究

针对低地球轨道(LEO)卫星星载全球定位系统(GPS)接收机应用的特点,对星载GPS测量数据误差及其对周跳探测的影响进行了分析,提出TurboEdit数据预处理方法中周跳探测算法的改进算法。在原周跳判断算法的基础上,通过引入与测量数据观测高度角相关的加权系数,将周跳探测与测量误差紧密联系起来。根据观测高度角的变化对测量数据误差进行估计,并根据估计情况对加权系数取值,从而实现对周跳探测算法进行调节,达到降低周跳探测失误率的目的。增加参与定轨计算的观测数据量,提高了低轨卫星连续定轨的能力。通过GRACE编队卫星实测数据对改进算法进行了仿真验证。     

多状态空间信息网络拓扑生成优化算法

依据空间信息网络（SIN）高动态性的特点，并考虑卫星工作的多状态特性，兼顾星间通信时延和拓扑抗毁性的要求，研究了多状态下空间信息网络拓扑生成及动态优化的问题。根据卫星星座的周期性，建立了一种卫星网络的拓扑周期表。综合卫星的可视性和连接度等约束条件，以网络平均和最大时延作为通信性能的优化目标，建立拓扑的多目标优化模型。提出一种改进的多目标模拟退火（IMOSA）算法，求解全局时延最优的卫星拓扑，并在考虑多状态情况下对链路进行优化，以满足网络高动态性。最后基于具有66颗低轨（LEO）的铱星星座进行仿真，研究表明：针对多状态条件下的铱星星座，该算法最大化减小了通信时延，得到抗毁性良好的拓扑结构，通信性能较之原有静态拓扑明显得到改善。     

低轨微纳卫星全磁自主导航算法研究

针对低轨微纳卫星体积小、功耗低的设计约束,提出了基于低轨地磁的定轨/定姿全磁自主导航算法.该算法仅利用三轴磁强计测量值和卫星动力学方程建立Kalman滤波器,实现了低轨微纳卫星的全自主轨道确定和姿态测量,理论仿真结果表明,该全磁导航算法精度能够满足低轨微纳卫星的一般要求.利用高精度地磁模拟器搭建了微纳卫星全磁自主导航地面仿真验证系统,对算法进行了全物理仿真测试和实验误差分析,进一步验证了全磁自主导航算法的可行性,为低轨微纳卫星提供了一种低成本、高自主、高可靠性的导航方法.     

基于双星定位系统和星敏感器的低轨卫星自主定轨方法研究

利用双星定位系统的两个测距信息外加星敏感器的测角信息,基于信息融合和信息守恒理论,采用联合推广卡尔曼滤波算法,对低轨卫星进行自主定轨仿真研究。计算结果表明,该方法可以显著提高定轨精度,达到低轨卫星自主定轨的精度要求。     

多层卫星网络数据缓存技术研究

针对星间链路和星地链路传播时延大、内容分发经过多跳传输后总体时延较大的问题,研究在多层卫星网络中部署网络内缓存技术,并提出基于卫星缓存容量大小和内容流行度的概率缓存策略。仿真结果显示,当每个卫星节点缓存容量大小仅占内容总量大小30%时,与IP协议、未部署缓存的NDN协议以及NDN-LCE缓存策略相比,采用提出的缓存策略,用户平均内容访问时延分别下降60%、53.4%和7.1%。     

面向声源定位的改进广义互相关时延估计方法

面向以数字微机电系统(MEMS)麦克风作为声传感器的声源定位阵列,完成了前端麦克风阵列的电路设计和以现场可编程逻辑门阵列(FPGA)为核心的数据采集系统的开发,并对麦克风输出的脉冲密度调制信号进行了降采样处理.针对传统的广义互相关算法在低信噪比下时延估计误差较大的问题,提出了一种改进PHAT加权函数的方法.在同等条件下对基于不同加权函数的广义互相关算法进行了MATLAB仿真验证,实验结果表明,在低信噪比条件下该方法相较于传统的广义互相关算法,时延估计误差更小且抗噪性能更强.     

基于改进UKF的小卫星磁测定轨方法

针对小卫星设计简单、功耗低的特点,提出一种利用三轴磁强计测量信息实现卫星磁测自主定轨的方法。为了提高自主定轨的计算效率,采用基于球体单形ε点采样的改进UKF(Unscented Kalman Filter)作为处理自主定轨的滤波算法。最后对这种定轨方法进行了仿真试验,结果表明,该滤波算法能有效保证收敛的速度和定轨精度。     

有限姿控能力的低RCS微小卫星姿态实时规划

 为提高在轨微小卫星使用效能及生存能力,提出一种受姿控能源消耗及驱动能力约束的低雷达散射截面（RCS）微小卫星姿态实时规划算法。算法应用曲面像素法、时域有限差分法及假设检验,在三维空间内对微小卫星的RCS及雷达探测水平进行建模,并结合雷达分布模型构建了相应的威胁评估函数及规划代价评估函数。同时,为提高算法的实时性能,采用了粒子群优化(PSO)算法以降低计算复杂度。仿真结果表明,在有限计算量的基础上,算法能够以较小规划代价有效降低卫星威胁方向的RCS及雷达探测概率,满足对微小卫星飞行姿态实时规划的需要。     

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.     

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

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.     

面向航空节点的IP/LEO卫星网络移动性管理方法(英文)

Taking into chief consideration the features of aviation nodes in satellite networks, such as high moving speed, long communication distance, and high connection frequency, this article proposes an aviation-oriented mobility management method for IP/low earth orbit （LEO） satellite networks. By introducing the concept of ground station real-time coverage area, the proposed method uses ground-station-based IP addressing method and cell paging scheme to decrease the frequency of IP binding update requests as well as the paging cost. In comparison with the paging mobile IP （P-MIP） method and the handover-independent IP mobility management method, as is verified by the mathematical analysis and simulation, the proposed method could decrease the management cost. It also possesses better ability to support the aviation nodes because it is subjected to fewer influences from increased node speeds and newly coming connection rates.     

TP-Satellite: A New Transport Protocol for Satellite IP Networks

As a result of the exponential growth of the worldwide Internet, satellite systems are used to support broadband Internet access. Existing TCP protocols perform very well for Internet access on wired networks. However, in the case of satellite channels, due to the effects of high bandwidth asymmetry, long propagation delay, high sporadic bit error rate (BER) and burst errors, TCP performance degrades significantly. In this paper, a new end-to-end transport protocol, TP-Satellite, is proposed for satellite IP networks. TP-Satellite replaces the traditional slow start algorithm with a novel super start algorithm. In order to distinguish congestion events from link errors, a new scheme is introduced, which is based on alternate transmission of different class priority packets. Bandwidth asymmetry problems are addressed by the adoption of a modified negative acknowledgement (M-NACK) strategy, which periodically sends M-NACK packets. Simulation results show that TP-Satellite enhances the throughput performance on the forward path, reduces the bandwidth used in the reverse path, and offers a fair share of network resources.     

Crosslink slot assignment in LEO networks

The problem of crosslink time slot assignment in low Earth orbiting (LEO) satellite networks is addressed. A crosslink channel connects two neighboring satellites through half-duplexed directional antennas. Coordination among the crosslinks between a satellite and all its neighbors in a dynamic LEO network is a delicate problem and rarely addressed in the literature. The problem is solved here using bipartite graphs. Two versions of slot assignment algorithm are given: distributed and centralized.     

IP多播技术的无根多播实现

随着互联网的发展,IP多播技术在需要大量带宽的多媒体应用中的地位日益重要.对IP多播技术进行全面介绍,分析其原理及应用,并着重探讨在灵活性、互动性强的多点对多点通信应用中,采用无根多播的方法来实现的优势和关键.     

HOI延迟对LEO卫星简化动力学POD的影响

通常使用无电离层(IF)线性组合(LC)消除低地球轨道(LEO)卫星简化动力学精密定轨(POD)一阶电离层延迟误差,忽略了高阶电离层(HOI)延迟误差。随着LEO卫星POD技术的发展,计算不同轨道高度的HOI延迟并探索其变化已成为进一步提高POD精度的重要手段。首先,使用国际参考电离层-2016(IRI-2016)和国际地磁参考场第13代(IGRF-13)模型,计算电离层穿刺点(IPP)位置和地磁场强度。其次,使用平滑星载GNSS数据计算电离层斜路径总电子含量(STEC)。然后,分别计算GOCE、GRACE-A和SWARM-A/B卫星的二阶和三阶电离层延迟。最后,评估了HOI延迟对LEO卫星重叠轨道分析、卫星激光测距(SLR)检核和精密科学轨道(PSO)比较结果的影响。实验结果表明：HOI延迟对LEO卫星简化动力学POD的影响大约在毫米至厘米的数量级上;HOI延迟对LEO卫星简化动力学POD外符合精度的影响分别达到0.92,0.22,0.21和0.18 mm;随着LEO卫星轨道高度的增加,HOI延迟对LEO卫星简化动力学POD的影响减小。     

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.     

测量船通信网络自检测方法

针对测量船通信网络由2层帧方式交换升级为3层包交换方式后无法使用上星自环检测方式实现自检测的问题,在分析通信网络自检测模式下的链路特性的基础上,提出基于组播报文实现自检测的构想。设计利用组播洪泛特性实现报文环回的网络拓扑结构以及实现检测与对比报文的硬件设备,阐述检测软件发送、接收、处理报文的流程,实现了网络通断、时延及丢包率的自检测,并通过模拟检测实验证明了设计方案是切实可行的。     

UMR: A utility-maximizing routing algorithm for delay-sensitive service in LEO satellite networks

This paper develops a routing algorithm for delay-sensitive packet transmission in a low earth orbit multi-hop satellite network consists of micro-satellites. The micro-satellite low earth orbit(MS-LEO) network endures unstable link connection and frequent link congestion due to the uneven user distribution and the link capacity variations. The proposed routing algorithm,referred to as the utility maximizing routing(UMR) algorithm, improve the network utility of the MS-LEO network for carrying flows with strict end-to-end delay bound requirement. In UMR, first, a link state parameter is defined to capture the link reliability on continuing to keep the end-to-end delay into constraint; then, on the basis of this parameter, a routing metric is formulated and a routing scheme is designed for balancing the reliability in delay bound guarantee among paths and building a path maximizing the network utility expectation. While the UMR algorithm has many advantages, it may result in a higher blocking rate of new calls. This phenomenon is discussed and a weight factor is introduced into UMR to provide a flexible performance option for network operator. A set of simulations are conducted to verify the good performance of UMR, in terms of balancing the traffic distribution on inter-satellite links, reducing the flow interruption rate,and improving the network utility.