Fast routing convergence optimization method for LEO/MEO (Low Earth Orbit/Medium Earth Orbit) satellite network
A satellite network and fast convergence technology, which is applied in the direction of data exchange network, radio transmission system, digital transmission system, etc., can solve problems that affect the convergence of network roads, increase routing overhead, and high fault misjudgment rate
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0078] The routing fast convergence optimization method of LEO / MEO satellite network includes: the steps of dynamic bidirectional forwarding detection. Aiming at the problem of high misjudgment rate of RLSR, a dynamic bidirectional forwarding detection technology DBFD (Dynamic Bidirectional forwarding Detection) is proposed. The reliability parameters are assigned to the road and each node, and the reliability of the link and the node is set according to the number of failures of the link and the node in a satellite network cycle, and the sending interval of the end-to-end message is dynamically adjusted according to the reliability, so that It is able to adapt to the highly dynamic nature of satellite networks.
[0079] 1. Relevant parameter settings, specifically:
[0080] Two parameters are set inside each node: set the number of neighbor nodes as n, and the reliability level of neighbor nodes Reliability level of the peer link When a node failure occurs on node A, the ...
Embodiment 2
[0094] The routing fast convergence optimization method for LEO / MEO satellite network, including: the steps for coverage clustering of MEO / LEO satellite network, clustering is carried out according to the coverage of MEO satellite, the cluster head is served by MEO satellite, and then the repeated coverage nodes Coincidence Node and Free Node are further processed to complete the entire clustering process. This algorithm limits the routing hops of LSA diffusion and reduces routing overhead;
[0095] S1, satellite classification:
[0096] Given a satellite set S, according to the orbital height, the satellite set is divided into two categories: M={m i |i=1,2,...,m}, which means the set of mid-orbit satellites; L={l j |j=1, 2,...,n}, representing a set of low-orbit satellites;
[0097] e(i, j) represents the link between satellite i and satellite j, and E(i) represents the set of neighbor nodes of satellite i;
[0098] S2, determine the link weight:
[0099] Let d(s i ,s j...
Embodiment 3
[0107] Such as image 3 As shown, as a further supplement to Embodiment 2, due to the overlap of coverage areas of cluster heads, the same LEO satellite may be covered by multiple cluster heads, so it is necessary to further process the repeated coverage nodes. The processing method is as follows:
[0108] The first step is to traverse the set N, and set the repeated coverage node set Represents a cluster and the intersection of
[0109] like Then update N as
[0110] like Then update N as
[0111] like Assume where l k ∈ L ij . like Then update N as like Then update N as like Then update N,
[0112] like and traverse L ij Calculate d(m i , l k ) and d(m j , l k ), where l k ∈ L ij . If d(m i , l k )>d(m j , l k ),but If d(m i , l k )j , l k ),but If d(m i , l k ) = d(m j , l k ),Assume Represents a cluster The number of elements in . like then update the cluster for like then update the cluster for ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com