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.     

面向航空节点的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.     

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.     

DIMENSION VARIATION OF FEATURE-BASED MODEL BY OPERATING DIRECTLY ON B-REP

A new algorithm for dimension variation of feature-based models is developed.The algorithm is based on B-Rep/CSG hybrid scheme and operates directly on B-Rep.Product information (including the features locating dimensions and other data for manufacture) will not lose after model variation and modification.Furthermore, the definition and solution of features constraints are also supported.The scheme of directly operating on B-Rep overcomes many drawbacks of other proposed methods, most of which need to redo all of the previous work to implement dimension variation, so the computational cost is expensive and product information will lose.What is presented in this paper makes a new way in the area of parametric design.     

TCP-ATCA： Improved Transmission Control Algorithm in Satellite Network

An adaptive transmission control algorithm based on TCP （TCP-ATCA） is proposed to reduce the effects of long propagation delay and high link error rate of the satellite network on the performances. The flow control and the error recovery are differentiated by combined dynamic random early detection-explicit congestion notification （DRED-ECN） algorithm, and, moreover, the pertaining congestion control methods are used in TCP-ATCA to improve the throughput. By introducing the entire recovery algorithm, the unnecessary congestion window decrease is reduced, and the throughput and fairness are improved. Simulation results show that, compared with TCP-Reno, TCP-ATCA provides a better throughput performance when the link capacity is higher （ ≥600 packet/s）, and roughly the same when it is lower. At the same time, TCP-ATCA also increases fairness and reduces transmission delay.     

Hierarchical space–time block codes signals classification using higher order cumulants

An efficient method for blind classification of space–time block codes(STBCs) based on fourth-order cumulants is proposed for a single receiver antenna.This paper presents a model of received STBCs signals in multiple input single output(MISO) communication systems and applies the characteristics of coding matrices to derive analytical expressions for the fourth-order cumulants to be used as the basis of an algorithm.The fourth-order cumulants at various delay vectors present non-null values that depend on the transmitted STBCs.Tests of nullity are accomplished by hypothesis testing.The proposed algorithm avoids the need for a priori information of modulation scheme,channel coefficients,and noise power.Consequently,it is well suited for non-cooperative scenarios.Simulations show that this method performs well even at low signal-to-noise ratios(SNRs).     

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.     

Wavelength dimensioning for wavelength-routed WDM satellite network

Internet and broadband applications driven by data traffic demand have become key dri-vers for satellite constellations. The key technology to satisfy the high capacity requirements between satellites is optical satellite networks by means of wavelength division multiplexing inter-satellite links (ISLs) with wavelength routing (WDM-OSN). Due to the limited optical amplifier bandwidth onboard the satellite, it is important to minimize the wavelength requirements to provi-sion requests. However, ISLs should be dynamically established and deleted for each satellite according to its visible satellites. Furthermore, different link assignments will result in different topologies, hence yielding different routings and wavelength assignments. Thus, a perfect match model-based link assignment scheme (LAS-PMM) is proposed to design an appropriate topology such that shorter path could be routed and less wavelengths could be assigned for each ISL along the path. Finally, simulation results show that in comparison to the regular Manhattan street net-work (MSN) topology, wavelength requirements and average end-to-end delay based on the topol-ogy generated by LAS-PMM could be reduced by 24.8%and 12.4%, respectively.     

Navigation message designing with high accuracy for NAV

Navigation message designing with high accuracy guarantee is the key to efficient navigation message distribution in the global navigation satellite system（GNSS）. Developing high accuracy-aware navigation message designing algorithms is an important topic. This paper investigates the high-accuracy navigation message designing problem with the message structure unchanged.The contributions made in this paper include a heuristic that employs the concept of the estimated range deviation（ERD） to improve the existing well-known navigation message on L1 frequency（NAV） of global positioning system（GPS） for good accuracy service; a numerical analysis approximation method（NAAM） to evaluate the range error due to truncation（RET） of different navigation messages; and a basic positioning parameters designing algorithm in the limited space allocation. Based on the predicted ultra-rapid data from the ultra-rapid data from the international GPS service for geodynamic（IGU）, ERDs are generated in real time for error correction.Simulations show that the algorithms developed in this paper are general and flexible, and thus are applicable to NAV improvement and other navigation message designs.     

An SOR Implicit Time-accurate Scheme in Calculating Unsteady Flows

A new time-accurate marching scheme for unsteady flow calculations is proposed in the present work. This method is the combination of classical Successive Over-Relaxation (SOR) iteration method and Jacobian matrix diagonally dominant splitting method of LUSGS. One advantage of this algorithm is the second-order accuracy because of no factorization error. Another advantage is the low computational cost because the Jacobian matrices and fluxes are only calculated once in each physical time step. And, the SOR algorithm has better convergence property than Gauss-Seidel. To investigate its accuracy and convergency, several unsteady flow computa- tional tests are carried out by using the proposed SOR algorithm. Roe’s FDS scheme is used to discritize the inviscid flux terms. Un- steady computational results of SOR are compared with the experiment results and those of Gauss-Seidel. Results reveal that the numerical results agree well with the experimental data and the second-order accuracy can be obtained as the Gauss-Seidel for unsteady flow computations. The impact of SOR factor is investigated for unsteady computations by using different SOR factors in this algorithm to simulate each computational test. Different numbers of inner iterations are needed to converge to the same criterion for different SOR factors and optimal choice of SOR factor can improve the computational efficiency greatly.     

一种新的星间链路切换保护算法

 星间链路切换将严重影响卫星网络的通信性能，需要对切换链路加以保护，这方面的研究目前还很欠缺。为此,给出一种新颖的星间链路切换保护(ISLHP)算法，该算法可同时生成业务路径和备份路径，且具有最小的综合费用（包括备份费用和业务费用）。算法采用本地链路保护，为星间链路切换提供快速恢复，并利用星间链路切换的可预测性和备份资源的可共用性，通过降低需要保护的链路数，减少闲置的备份资源，来提高网络资源的利用率。仿真结果表明:该算法具有切换恢复时间短，网络资源利用率高等优点。     

Analytic study of Doppler-based handover management in LEO satellite systems

The problem of dynamic handover management in low Earth orbit (LEO) satellite systems is addressed. Particularly, an analytical study of a newly proposed method for handover management, called dynamic Doppler-based handover prioritization scheme (DDBHP), is presented. DDBHP utilizes Doppler shift monitoring of each communicating user terminal onboard the satellite and geometric characteristics to accurately predict the handover load. As a result, handover requests are more effectively managed, resulting in an improved performance in terms of blocking and forced termination probabilities. Moreover, by supporting guaranteed handovers, DDBHP can be used to provide QoS to users of future broadband satellite networks. An extensive mathematical model that justifies Doppler shift monitoring is presented along with a detailed queueing model used not only to evaluate DDBHP performance but also to provide a methodology for associating DDBHP operational parameters with desired performance. Comparison of analytical and simulation results validate the proposed model.     

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

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

基于QoS的卫星网络端-端通信可靠性分析

针对卫星网络动态环境下的高速信息传输、业务类型差异大等特点，提出一种综合考虑各业务QoS（Quality of Service）指标的可靠性分析方法。在卫星通信网络实际运行周期内，通信系统往往处于逐渐劣化过程中，导致卫星的节点和链路除正常工作和完全失效外，还存在部分失效的工作状态。本文在链路多状态基础上基于最小路集算法（Minimum Path Set Algorithms，MPSA）在不同业务的QoS指标（时延、带宽和丢包率）约束下，得出满足该业务QoS约束的所有可靠路径集，对路径集中路径进行不交化处理得到网络端-端可靠性。研究结果表明，不同业务由于QoS需求的差异导致网络端-端可靠性不同，所提算法与传统算法相比更加符合实际。由于实际卫星网络环境中会采用端-端并行多路径传输（Multi-Path Transmission，MTP），本文在上述研究的基础上，进一步对多路径的端-端可靠性进行了研究，结果表明多路径数据传输可靠性高。     

星间链路数量受限的导航卫星网络链路分配问题

对星间链路数量非常有限、需要同时满足星间测距和星间通信需求的导航卫星网络的链路分配问题进行了研究。首先,分析了导航卫星网络的特点,并设计了一种基于有限状态自动机(FSA)的拓扑处理机制。然后,将星间测距需求作为一个约束,以星间通信的延时性能为优化目标,将导航卫星网络的链路分配问题建模为一个多目标优化问题。最后,针对建立的多目标优化问题,分别提出一种基于首次改善(FI)的本地搜索算法和基于模拟退火(SA)的启发式优化算法以对链路分配问题进行求解,并提出一种基于分支交换策略的新链路分配生成方法。仿真结果表明,通过FI算法和SA算法获得的优化链路分配的网络延时性能均得到了改进,且SA算法的性能要优于FI算法;同时,FSA的状态持续时间的减小有利于获得网络延时性能好的链路分配。     

全球卫星导航星座网络协议体系与运行模式

针对全球卫星导航星座网络建设初期或论证阶段所涉及的网络体系结构、协议体系及相关组网等技术问题,开展了基于导航星座星间链路构建空间信息网络的技术研究,分别提出了由子网、接入网、骨干网等节点及其相互之间星间、星地无线链路构成的分层网络系统结构,设计了兼容遥控、遥测、测量与网络交互支持等业务的基于IP over CCSDS(基于空间数据系统咨询委员会标准的空间链路承载互联网协议业务)的协议体系,给出了全系统基本通信业务运行模式等。与传统高轨卫星通信系统相比,该星座网络具有高覆盖、低时延、随遇接入等优点,可实现星座导航性能与中低轨及地面用户通信性能的全方位提升,相关结果对我国全球卫星导航星座网络技术研究具有一定的参考意义。     

Sequential dynamic resource allocation in multi-beam satellite systems:A learning-based optimization method

Multi-beam antenna and beam hopping technologies are an effective solution for scarce satellite frequency resources. One of the primary challenges accompanying with Multi-Beam Satellites(MBS) is an efficient Dynamic Resource Allocation(DRA) strategy. This paper presents a learning-based Hybrid-Action Deep Q-Network(HADQN) algorithm to address the sequential decision-making optimization problem in DRA. By using a parameterized hybrid action space,HADQN makes it possible to schedule the beam patte...     

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.