MTCR-CR Routing Strategy for Connection-Oriented Routing over Satellite Networks

The high-speed movement of satellites makes it not feasible to directly apply the mature routing scheme on the ground to the satellite network.DT-DVTR in the snapshot-based connectionoriented routing strategy is one of the representative solutions,but it still has room for improvement in terms of routing stability.In this paper,we propose an improved scheme for connection-oriented routing strategy named the Minimal Topology Change Routing based on Collaborative Rules(MTCR-CR).The MTCR-CR uses continuous time static topology snapshots based on satellite status to search for intersatellite link(ISL)construction solutions that meet the minimum number of topology changes to avoid route oscillations.The simulation results in Beidou-3 show that compared with DT-DVTR,MTCR-CR reduces the number of routing changes by about 92%,the number of path changes caused by routing changes is about38%,and the rerouting time is reduced by approximately 47%.At the same time,in order to show our algorithm more comprehensively,the same experimental index test was also carried out on the Globalstar satellite constellation.

Service Function Chain Migration in LEO Satellite Networks

With the advancements of software defined network(SDN)and network function virtualization(NFV),service function chain(SFC)placement becomes a crucial enabler for flexible resource scheduling in low earth orbit(LEO)satellite networks.While due to the scarcity of bandwidth resources and dynamic topology of LEO satellites,the static SFC placement schemes may cause performance degradation,resource waste and even service failure.In this paper,we consider migration and establish an online migration model,especially considering the dynamic topology.Given the scarcity of bandwidth resources,the model aims to maximize the total number of accepted SFCs while incurring as little bandwidth cost of SFC transmission and migration as possible.Due to its NP-hardness,we propose a heuristic minimized dynamic SFC migration(MDSM)algorithm that only triggers the migration procedure when new SFCs are rejected.Simulation results demonstrate that MDSM achieves a performance close to the upper bound with lower complexity.

For LEO Satellite Networks: Intelligent Interference Sensing and Signal Reconstruction Based on Blind Separation Technology

In LEO satellite communication networks,the number of satellites has increased sharply, the relative velocity of satellites is very fast, then electronic signal aliasing occurs from time to time. Those aliasing signals make the receiving ability of the signal receiver worse, the signal processing ability weaker,and the anti-interference ability of the communication system lower. Aiming at the above problems, to save communication resources and improve communication efficiency, and considering the irregularity of interference signals, the underdetermined blind separation technology can effectively deal with the problem of interference sensing and signal reconstruction in this scenario. In order to improve the stability of source signal separation and the security of information transmission, a greedy optimization algorithm can be executed. At the same time, to improve network information transmission efficiency and prevent algorithms from getting trapped in local optima, delete low-energy points during each iteration process. Ultimately, simulation experiments validate that the algorithm presented in this paper enhances both the transmission efficiency of the network transmission system and the security of the communication system, achieving the process of interference sensing and signal reconstruction in the LEO satellite communication system.

Software defined satellite networks:A survey

In recent years,satellite networks have been proposed as an essential part of next-generation mobile communication systems.Software defined networking techniques are introduced in satellite networks to handle the growing challenges induced by time-varying topology,intermittent inter-satellite link and dramatically increased satellite constellation size.This survey covers the latest progress of software defined satellite networks,including key techniques,existing solutions,challenges,opportunities,and simulation tools.To the best of our knowledge,this paper is the most comprehensive survey that covers the latest progress of software defined satellite networks.An open GitHub repository is further created where the latest papers on this topic will be tracked and updated periodically.Compared with these existing surveys,this survey contributes from three aspects:(1)an up-to-date SDN-oriented review for the latest progress of key techniques and solutions in software defined satellite networks;(2)an inspiring summary of existing challenges,new research opportunities and publicly available simulation tools for follow-up studies;(3)an effort of building a public repository to track new results.

High-Risk LEO Satellite Network Path Detection Based on Spatial and Temporal Delay Anomaly Analysis

The gradual deployment of Low-Earth Orbit(LEO)mega constellations with inter-satellite links(ISLs)promises ubiquitous,low-latency,and high-throughput satellite network services.However,networked LEO satellites with ISLs are also at risk of routing attacks such as hijacking.Existing defenses against route hijacking in terrestrial networks can hardly work for the LEO satellite network due to its high spatiotemporal dynamics.To deal with it,we propose RPD,a high-risk routing path detection method for LEO mega-constellation networks.RPD detects abnormal high-risk LEO network paths by checking the consistency between the path delay and the geographical distance.This is efficiently achieved by combining in-band measurements and out-of-band statistical processing to detect the anomaly of the clustering feature in the reference delay matrix.RPD avoids the recalculation of the header cryptographic marks when the handover occurs,thus greatly reducing the cost and improving the performance of highrisk path detection.Experiments showed that the proposed RPD mechanism achieves an average detection accuracy of 91.64%under normal network conditions,and maintain about 89%even when congestion occurs in multiple areas of the network and measurement noise is considered.In addition,RPD does not require any cryptographic operation on the intermediate node,only minimal communication cost with excellent scalability and deployability.

An Integrated Image Task Planning in Satellite Networks:From Instruction Release and Observation Perspective

The unreasonable observation arrangements in the satellite operation control center(SOCC)may result in the observation data cannot be downloaded as scheduled.Meanwhile,if the operation instructions released by the satellite telemetry tracking center(STTC)for the on-board payloads are not injected on the specific satellites in time,the corresponding satellites cannot perform the observation operations as planned.Therefore,there is an urgent need to design an integrated instruction release,and observation task planning(I-IRO-TP)scheme by efficiently collaborating the SOCC and STTC.Motivated by this fact,we design an interaction mechanism between the SOCC and the STTC,where we first formulate the I-IRO-TP problem as a constraint satisfaction problem aiming at maximizing the number of completed tasks.Furthermore,we propose an interactive imaging task planning algorithm based on the analysis of resource distribution in the STTC during the previous planning periods to preferentially select the observation arcs that not only satisfy the requirements in the observation resource allocation phase but also facilitate the arrangement of measurement and control instruction release.We conduct extensive simulations to demonstrate the effectiveness of the proposed algorithm in terms of the number of completed tasks.

Repeated sending file delivery protocol in satellite networking communication

Satellite networking communications in navigation satellite system and spacebased deep space exploration have the features of a long delay and high bit error rate （BER）. Through analyzing the advantages and disadvantages of the Consulta tive Committee for the Space Data System （CCSDS） file delivery protocol （CFDP）, a new improved repeated sending file delivery protocol （RSFDP） based on the adaptive repeated sending is put forward to build an efficient and reliable file transmission. According to the estimation of the BER of the transmission link, RSFDP repeatedly sends the lost protocol data units （PDUs） at the stage of the retransmission to improve the success rate and reduce time of the retransmission. Theoretical analyses and results of the Opnet simulation indicate that the performance of RSFDP has significant improvement gains over CFDP in the link with a long delay and high BER. The realizing results based on the space borne filed programmable gate array （FPGA） platform show the applicability of the proposed algorithm.

A Novel Onboard-gateway-based Mechanism to Improve TCP Performance in Aeronautical Satellite Networks

The IP-based networks on aircraft serve to support Intemet services via satellites. However, in aeronautical satellite hybrid networks, the TCP protocol performance often deteriorates due to improper decreases and slow recovery of the congestion window. This paper proposes a window size determination and notification mechanism, onboard-gateway-based mechanism （OGBM）, which is based on the onboard gateway in the networks on aircraft. A cross-layer approach is adopted by the onboard gateway to obtain the satellite link bandwidth information. And then, by the gateway, through changing the receiver＇s advertised window field in ACK packets, TCP sources are notified of the window size of each TCP source calculated on the ground of bandwidth delay product and flow numbers. The mechanism is able to avoid improper changes of TCP window and serve multiple users. Simulation results show that the mechanism with the fairness index close to l improves TCP performance in aeronautical satellite networks.

Research on handover algorithm to reduce the blocking probability in LEO satellite network

Based on the characteristics of guaranteed handover （GH） algorithm, the finite capacity in one system makes the blocking probability （PB） of GH algorithm increase rapidly in the case of high traffic losd. So, when large amounts of multimedia services are transmitted via a single low earth orbit （LEO） satellite system, the PB of it is much higher. In order to solve the problem, a novel handover scheme defined by multi-tier optimal layer selection is proposed. The scheme sufficiently takes into account the characteristics of double-tier satellite network, which is constituted by LEO satellites combined with medium earth orbit （MEO） satellites, and the multimedia transmitted by such network, so it can augment this systematic capacity and effectively reduces the traffic loed in the LEO which performs GH algorithm. The detailed processes are also presented. The simulation and numerical results show that the approach integrated with GH algorithm achieves a significant improvement in the PB and practicality, as compared to the single LEO layer network.

QoS-Aware Power Allocation Scheme for Relay Satellite Networks

This paper investigated a QoS-aware power allocation for relay satellite networks.For the given QoS requirements,we analyzed the signal model of relay transmission and formulated the power minimization problem which is non-convex and difficult to solve.To find the optimal solution to the considered problem,we first analyzed the optimization problem and equivalently turn it into a convex optimization problem.Then,we provided a Lagrangian dual-based method to obtain the closed-form of the power allocation and provided an iterative algorithm to the optimal solution.Moreover,we also extended the results to the cooperative transmission mode.Finally,simulation results were provided to verify the superiority of the proposed algorithm.

Dynamic Resource Pricing and Allocation in Multilayer Satellite Network

The goal of delivering high-quality service has spurred research of 6G satellite communication networks.The limited resource-allocation problem has been addressed by next-generation satellite communication networks,especially multilayer networks with multiple low-Earth-orbit(LEO)and nonlow-Earth-orbit(NLEO)satellites.In this study,the resource-allocation problem of a multilayer satellite network consisting of one NLEO and multiple LEO satellites is solved.The NLEO satellite is the authorized user of spectrum resources and the LEO satellites are unauthorized users.The resource allocation and dynamic pricing problems are combined,and a dynamic gamebased resource pricing and allocation model is proposed to maximize the market advantage of LEO satellites and reduce interference between LEO and NLEO satellites.In the proposed model,the resource price is formulated as the dynamic state of the LEO satellites,using the resource allocation strategy as the control variable.Based on the proposed dynamic game model,an openloop Nash equilibrium is analyzed,and an algorithm is proposed for the resource pricing and allocation problem.Numerical simulations validate the model and algorithm.

Dynamic Routing Algorithm for Increasing Robustness in Satellite Networks

In low earth orbit（LEO） and medium earth orbit（MEO） satellite networks, the network topology changes rapidly because of the high relative speed movement of satellites. When some inter-satellite links （ISLs） fail, they can not be repaired in a short time. In order to increase the robustness for LEO/MEO satel- lite networks, an effective dynamic routing algorithm is proposed. All the routes to a certain node are found by constructing a destination oriented acyclic directed graph（DOADG） with the node as the destination. In this algorithm, multiple routes are provided, loop-free is guaranteed, and as long as the DOADG maintains, it is not necessary to reroute even if some ISLs fail. Simulation results show that comparing to the conventional routing algorithms, it is more efficient and reliable, costs less transmission overhead and converges faster.

Protected Fair Secret Sharing Based Bivariate Asymmetric Polynomials in Satellite Network

Verifiable secret sharing mainly solves the cheating behavior between malicious participants and the ground control center in the satellite network.The verification stage can verify the effectiveness of secret shares issued by the ground control center to each participant and verify the effectiveness of secret shares shown by participants.We use a lot of difficult assumptions based on mathematical problems in the verification stage,such as solving the difficult problem of the discrete logarithm,large integer prime factorization,and so on.Compared with other verifiable secret sharing schemes designed for difficult problems under the same security,the verifiable secret sharing scheme based on the Elliptic Curve Cryptography(ECC)system has the advantages of less computational overhead and shorter key.At present,the binary polynomial is a single secret scheme and cannot provide effective verification.Therefore,based on a Protected Verifiable Synchronous Multi Secret Sharing(PVS-MSS)scheme,this paper is designed based on bivariate asymmetric polynomials.The advanced verifiable attribute is introduced into the Protected Secret Sharing(PSS)scheme.This paper extends the protected synchronous multi-secret sharing scheme based on bivariate polynomial design.The ECC system constructs the security channel between the ground control center and participants and constructs the verification algorithm.Through the verification algorithm,any participant can verify the consistency and effectiveness of the secret shadow and secret share received from other participants or presented by the secret distribution center.Therefore,no additional key agreement protocol is required;participants do not need to negotiate the session key for encryption;the secret share polynomial can generate the session key between participants and speed up the secret reconstruction process.The verification stage has lower computational complexity than the verifiable scheme constructed by Rivest Shamir Adleman (RSA) and other encryption methods. Chinese Remainder Theorem (CRT)is used to update the secret shadow. The secret shadow does not need to beupdated with the change of the scheme shared secret, and the public valueupdate efficiency is higher. Reduce the complexity of sharing secret updatesin a synchronous multi-secret sharing scheme.

Distributed Deep Learning for Cooperative Computation Offloading in Low Earth Orbit Satellite Networks

Low earth orbit(LEO) satellite network is an important development trend for future mobile communication systems, which can truly realize the“ubiquitous connection” of the whole world. In this paper, we present a cooperative computation offloading in the LEO satellite network with a three-tier computation architecture by leveraging the vertical cooperation among ground users, LEO satellites, and the cloud server, and the horizontal cooperation between LEO satellites. To improve the quality of service for ground users, we optimize the computation offloading decisions to minimize the total execution delay for ground users subject to the limited battery capacity of ground users and the computation capability of each LEO satellite. However, the formulated problem is a large-scale nonlinear integer programming problem as the number of ground users and LEO satellites increases, which is difficult to solve with general optimization algorithms. To address this challenging problem, we propose a distributed deep learning-based cooperative computation offloading(DDLCCO) algorithm, where multiple parallel deep neural networks(DNNs) are adopted to learn the computation offloading strategy dynamically. Simulation results show that the proposed algorithm can achieve near-optimal performance with low computational complexity compared with other computation offloading strategies.

Energy-Efficient Traffic Offloading for RSMA-Based Hybrid Satellite Terrestrial Networks with Deep Reinforcement Learning

As the demands of massive connections and vast coverage rapidly grow in the next wireless communication networks, rate splitting multiple access(RSMA) is considered to be the new promising access scheme since it can provide higher efficiency with limited spectrum resources. In this paper, combining spectrum splitting with rate splitting, we propose to allocate resources with traffic offloading in hybrid satellite terrestrial networks. A novel deep reinforcement learning method is adopted to solve this challenging non-convex problem. However, the neverending learning process could prohibit its practical implementation. Therefore, we introduce the switch mechanism to avoid unnecessary learning. Additionally, the QoS constraint in the scheme can rule out unsuccessful transmission. The simulation results validates the energy efficiency performance and the convergence speed of the proposed algorithm.

Average Secrecy Capacity of the Reconfigurable Intelligent Surface-Assisted Integrated Satellite Unmanned Aerial Vehicle Relay Networks

Integrated satellite unmanned aerial vehicle relay networks(ISUAVRNs)have become a prominent topic in recent years.This paper investigates the average secrecy capacity(ASC)for reconfigurable intelligent surface(RIS)-enabled ISUAVRNs.Especially,an eve is considered to intercept the legitimate information from the considered secrecy system.Besides,we get detailed expressions for the ASC of the regarded secrecy system with the aid of the reconfigurable intelligent.Furthermore,to gain insightful results of the major parameters on the ASC in high signalto-noise ratio regime,the approximate investigations are further gotten,which give an efficient method to value the secrecy analysis.At last,some representative computer results are obtained to prove the theoretical findings.

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-toend 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.

A multipath routing algorithm for satellite networksbased on service demand and traffic awareness

With the reduction in manufacturing and launch costs of low Earth orbit satellites and the advantages of large coverage and high data transmission rates,satellites have become an important part of data transmission in air-ground networks.However,due to the factors such as geographical location and people’s living habits,the differences in user’demand for multimedia data will result in unbalanced network traffic,which may lead to network congestion and affect data transmission.In addition,in traditional satellite network transmission,the convergence of network information acquisition is slow and global network information cannot be collected in a fine-grained manner,which is not conducive to calculating optimal routes.The service quality requirements cannot be satisfied when multiple service requests are made.Based on the above,in this paper artificial intelligence technology is applied to the satellite network,and a software-defined network is used to obtain the global network information,perceive network traffic,develop comprehensive decisions online through reinforcement learning,and update the optimal routing strategy in real time.Simulation results show that the proposed reinforcement learning algorithm has good convergence performance and strong generalizability.Compared with traditional routing,the throughput is 8%higher,and the proposed method has load balancing characteristics.

Secrecy Outage Probability for Two-Way Integrated Satellite Unmanned Aerial Vehicle Relay Networks with Hardware Impairments

In this paper,we investigate the secrecy outage performance for the two-way integrated satellite unmanned aerial vehicle relay networks with hardware impairments.Particularly,the closed-form expression for the secrecy outage probability is obtained.Moreover,to get more information on the secrecy outage probability in a high signalto-noise regime,the asymptotic analysis along with the secrecy diversity order and secrecy coding gain for the secrecy outage probability are also further obtained,which presents a fast method to evaluate the impact of system parameters and hardware impairments on the considered network.Finally,Monte Carlo simulation results are provided to show the efficiency of the theoretical analysis.

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 for- mulated 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 algo- rithm 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.