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.

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.

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.

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.

An IP mobility management scheme with dual location areas for IP/LEO satellite network

One of the issues of mobility management in a low Earth orbit (LEO) satellite network is the high-frequency location binding update initiated by mobile nodes (MNs).To solve this problem,we propose a location management scheme based on dual location area (LA) in an IP/LEO satellite network.The proposed scheme uses two kinds of LA,the fixed Earth station LA and satellite LA,to manage the location of the MNs together.MNs operate the binding update procedures only when they are moving out of both of the two LAs last registered.Geographical location information of MN is used in the binding update procedures,so that the network can page the idle MNs near their last registered location first,to enhance the probability of paging success.A detailed description of the implementation of the scheme is provided.Mathematical analysis shows that the proposed scheme reduces the location management cost and minimizes the influences of the distance between MN and its home agent.Paging cost is also reduced by introducing geographical location information in the binding update procedures.

Reliability Evaluation of All-User Terminals in LEO Satellite Communication Network Based on Modular Reduction

LEO satellite communication network has a large number of satellites distributed in low orbits,which leads to multiple coverage of many areas on the ground.It is hard work to describe and evaluate the reliability of LEO satellite communication network.To solve this problem,the reliability of all-user terminals in LEO satellite communication network is defined,and the corresponding reliability evaluation method is proposed in the paper.Due to the large scale of the interstellar network,a modular reduction algorithm using the modular network instead of the original network for state decomposition is proposed in this paper.Case study shows that the calculation time of the proposed method is equivalent to 6.28%of the original state space decomposition algorithm.On this basis,the reliability of LEO satellite communication network is further analyzed.It is found that the reliability of LEO satellite network was more sensitive to the reliability of Inter-Satellite link and the satisfaction of global coverage in the early stage,and it is more sensitive to the reliability of the satellite in the later stage.The satellite-ground link has a relatively constant impact on of LEO satellite network.

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.

New dynamic routing algorithm based on MANET in the LEO/MEO satellite network

The features of low earth orbit/medium earth orbit(LEO/MEO)satellite networks routing algorithm based on inter-satellite link are analyzed and the similarities between satellite networks and mobile Ad Hoc network(MANET)are pointed out.The similar parts in MANET routing protocol are used in the satellite network for reference.A new dynamic routing algorithm based on MANET in LEO/MEO satellite networks,which fits for the LEO/MEO satellite communication system,is proposed.At the same time,the model of the algorithm is simulated and features are analyzed.It is shown that the algorithm has strong adaptability.It can give the network high autonomy,perfect function,low system overhead and great compatibility.