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.

Novel optimized routing algorithm for LEO satellite IP networks

A lot of routing algorithms have been proposed for low earth orbit（LEO） satellite IP networks in recent years,but most of them cannot achieve global optimization.The dynamic characters of LEO satellite networks are reflected in two aspects：topology and traffic change.The algorithms mentioned above are ＂hard routing＂ which only realize local optimization.A distributed soft routing algorithm combined with multi-agent system（MASSR） is proposed.In MASSR,mobile agents are used to gather routing information actively,and blackboard is introduced to achieve direct information exchange between agents.MASSR provides traffic adaptive routing and tracks the change of LEO satellite network topology.The performance of ant colony optimization（ACO） and MASSR are compared in Iridium constellation,and MASSR presents better end-to-end delay as well as enhanced robustness.

QoS routing based on mobile agent for LEO satellite IP networks

Current quality of service（QoS） routing schemes for low earth orbit（LEO） satellites IP networks either neglect the varying population density or fail to guarantee end-to-end delay.As a remedy,QoS routing protocol based on mobile agent（QoSRP-MA） is proposed.QoSRP-MA is a source-based routing protocol.Once connection requests arrive,QoS mobile agents are dispatched from ingress satellite to explore routes,which migrate using satellite routing tables.Upon arriving in egress satellite,QoS mobile agents migrate back towards ingress satellite to reserve bandwidth.To construct satellite routing tables,load balancing routing algorithm based on mobile agent（LBRA-MA） is presented.In LBRP-MA,at regular intervals mobile agents launched on all satellites migrate autonomously to evaluate path cost and update routing tables.Moreover,path cost between source and destination is evaluated considering satellite geographical position as well as inter-satellite link（ISL） cost.Furthermore,ISL congestion index is considered to update routing table.Through simulations on a Courier-like constellation,it shows that QoSRP-MA can achieve guaranteed end-to-end delay bound with higher throughput,lower connection failing ratio and signaling overhead compared to high performance satellite routing（HPSR） scheme.

Aviation-oriented Mobility Management Method in IP/LEO Satellite Networks

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.

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.