CN113489528A - Self-adaptive survivability method suitable for inter-satellite routing - Google Patents
Self-adaptive survivability method suitable for inter-satellite routing Download PDFInfo
- Publication number
- CN113489528A CN113489528A CN202110756148.8A CN202110756148A CN113489528A CN 113489528 A CN113489528 A CN 113489528A CN 202110756148 A CN202110756148 A CN 202110756148A CN 113489528 A CN113489528 A CN 113489528A
- Authority
- CN
- China
- Prior art keywords
- satellite
- satellite node
- link state
- node
- routing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18519—Operations control, administration or maintenance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/023—Limited or focused flooding to selected areas of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Radio Relay Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a self-adaptive survivability method suitable for inter-satellite routing, belongs to the technical field of LEO routing, and comprises static routing, dynamic detection and limited fault flooding. The static routing fully utilizes the periodicity and predictability of the constellation movement to divide the satellite period into a plurality of time slices, a routing table is calculated at the beginning of each time slice, and data are forwarded according to the routing table. The dynamic detection part detects the link fault or node failure condition, all satellites periodically send HELLO messages to neighbor nodes, and the link state is judged according to the receiving condition of the HELLO messages in given time. And the limited fault flooding part floods and diffuses fault information to the neighboring satellite, and recalculates the optimal path after synchronizing the link state database. The method can timely recover network communication when the node fails or the link fails in emergency, furthest reduce the end-to-end network delay and the packet loss rate, obviously reduce the routing overhead and avoid updating the routing table in the whole network.
Description
Technical Field
The invention relates to a self-adaptive survivability method suitable for inter-satellite routing, and belongs to the technical field of routing in a low-orbit satellite communication network.
Background
Satellite communication has a series of advantages of large coverage range, no limitation of geographical conditions, long communication distance, mobile communication and the like, future satellite communication is integrated with various communication resources and network resources, and the technology of combining broadband communication, internet technology, personal mobile communication and the like is realized to better serve human beings. The routing problem is always the research focus of satellite network communication, and the quality of ISL section routing performance directly affects various aspects of satellite communication application, so that it is important to find an effective routing scheme. An effective satellite network routing technique should have the following properties: (1) the adaptability of the network topology dynamic change and the satellite network topology high dynamic change require that the routing technology can adapt to the high dynamic change topology. (2) The survivability, when the satellite works in the outer space and the emergency of satellite node failure or link failure occurs, the satellite can not be repaired in time, and the routing technology is required to detect the failure in time and take countermeasures to recover the communication. (3) The method has the advantages of high efficiency, limited satellite storage resources and computing capacity, requirement for reducing the implementation complexity of the routing technology, and capability of obtaining larger transmission success rate and system throughput with smaller routing overhead.
The existing routing technology can be mainly divided into a routing algorithm based on virtual topology, a routing algorithm based on coverage domain division, a routing algorithm based on virtual satellite nodes and a routing algorithm based on data driving. The basic idea of a routing algorithm based on virtual topology is to make full use of the periodicity and predictability of a satellite constellation and divide the satellite constellation period into a plurality of time slices, namely [ t0,t1),[t1,t2),...,[tn-1,tn) Within each time slice, the satellite network topology is regarded as fixed, the cost of each ISL can be regarded as constant, and the connection and disconnection of the ISL only occur at discrete time points t1,t2,...tn. The routing algorithms proposed by Werner based on ATM, proposed by Seong based on FSA, proposed by Gounder based on snapshot sequences, etc. all belong to this kind of routing algorithms. The basic idea of a routing algorithm based on coverage area division is to divide the earth's surface coverage area into different areas, each area being assigned a different fixed logical address, including connection-oriented satellite routing algorithms and connection-orientedThe logical address of the satellite closest to the center of the area at a given moment is the logical address of the area, the logical address of the satellite dynamically changes according to the change of the coverage area in the operation process, and the logical address contains the position information of the ground node. IP-based routing by Hashimoto, TDMA-based routing by Mauger, etc. all belong to this routing algorithm. The basic idea of a routing algorithm based on virtual satellite nodes is to model the satellite network as a network of virtual satellite nodes, assigning fixed geographical coordinates. And mapping the real satellite and the virtual satellite node according to the distance relation between the geographic coordinate and the physical position of the virtual satellite node when the logical address on the earth surface is unchanged. The e.ekici-highlighted distributed routing algorithm DRA, the local zone LZDR-based algorithm proposed by t.h.chan, are all such routing algorithms. The basic idea of a data-driven routing algorithm is that the route is not updated when no data is sent, and the arrival of the data triggers a topology update that includes topology information of the next satellite node to which the data is to be sent and topology information of the last satellite node through which the data has passed. Both the Darting algorithm and the LAOR algorithm belong to this routing algorithm.
The routing algorithm based on the virtual topology strategy, such as DTDVTR algorithm, adopts a static routing mechanism, namely an offline pre-calculation mode to simplify the satellite function, the satellite dynamic network topology is divided into a series of continuous static topology structures according to time slices, the ground station calculates the path between each pair of satellites in a pre-concentrated manner to provide an optimized path, and the satellite only needs to update a routing table at the time slice point. Due to the adoption of an off-line calculation mode, the survivability of the algorithm is poor, and when emergency conditions such as satellite node failure or link failure occur, the performance of the algorithm is remarkably reduced.
A dynamic routing mechanism is adopted for a data-driven routing algorithm such as a Darting algorithm, namely, topology updating is triggered through arrival of a data packet, new changes in a network can be responded in real time, however, periodicity and predictability of satellite constellation movement are completely ignored by the algorithm, topology updating is triggered too frequently, and system overhead is greatly increased.
Other methods such as in the ground fixed network, which are based on a link state routing algorithm such as OSPF, also adopt a dynamic routing mechanism, that is, each satellite node sends link state advertisement LSAs among all satellite nodes forming a neighbor relationship with the satellite node, so that the link state and the satellite node condition can be monitored in real time, each satellite node receiving the LSAs sent from the neighbor satellite nodes records the LSAs in its link state database, and sends a copy of the LSAs to other neighbors of the satellite node, and the LSAs is flooded to the whole area through the LSAs until all satellite nodes form the same link state database, and then a routing table is constructed. However, the algorithm flooding link state information in the whole network greatly increases the system overhead, and when emergency conditions such as satellite node failure or link failure occur, the routing table is recalculated in the whole network, so that great challenges are brought to the computing capability of the satellite nodes, and the algorithm is difficult to be applied to the satellite network.
Due to the characteristics of high dynamic topology, limited storage resources, limited computing capacity and the like, the ground network routing algorithm is difficult to be applied to the satellite. The satellite launching is successful, the upgrading or the maintenance is difficult, the satellite works in the outer space, the operation environment is very bad, and once the problems of satellite node failure or link failure and the like are met, the whole satellite network is greatly influenced, so that the research on the method can detect the link state, timely recover the normal operation of the network, reduce the end-to-end network delay and furthest reduce the system overhead, namely, an efficient satellite anti-damage routing strategy is designed, and the method has important significance for ensuring the normal operation of a satellite system, improving the working efficiency of the satellite and enhancing the space defense and defense competence.
Disclosure of Invention
The invention aims to improve the working efficiency of the conventional satellite network, establish a high-efficiency survivable route, ensure the normal operation of a satellite system and enhance the space attack and defense confrontation capacity, and provides a self-adaptive survivable method suitable for an inter-satellite route.
In order to achieve the purpose, the invention adopts the following technical scheme.
The self-adaptive anti-damage method comprises the steps of static routing, dynamic detection and limited fault flooding, and specifically comprises the following steps: the satellite node calculates a static route at the beginning of each time slice; periodically sending HELLO messages to neighbor satellite nodes to dynamically detect the topology state of the whole satellite network to acquire the link state change; and then enters the limited fault flooding process.
The static routing divides the whole satellite period into a plurality of time slices based on a virtual topology strategy, updates a link state database at the starting moment of each time slice, calculates and updates a routing table, and forwards data according to the routing table when receiving a data packet;
dynamic detection, namely detecting the state of the whole satellite network topology in real time, specifically comprising: all satellite nodes periodically send HELLO messages to neighbor satellite nodes so as to detect the link failure condition in the system;
in limited fault flooding, the optimal path is changed according to the change of the link state, so that the satellite nodes flood and diffuse fault information in a limited range, and the link state database is synchronized to recalculate the optimal path;
the self-adaptive anti-damage method specifically comprises the following steps:
the static routing specifically includes:
step 1), network modeling, specifically: constructing a static weighted undirected graph G by relying on a set E of all satellite nodes and a set V of all inter-satellite linkskThe method specifically comprises the following steps: at an interval of [ t ]m,tm+1]In (1), modeling the network topology as a static weighted undirected graph Gk＝(V,E)；
Wherein G iskFor a static weighted undirected graph, V is the set of all satellite nodes, E is the set of all inter-satellite links, separated by [ t ]m,tm+1]Is equal to the LEO period T and is divided into m +1 of n time slices, and the n time slices are marked as [ T0＝0,t1]，[t1,t2]，...，[tn-1,tn]The link length of all inter-satellite links in E is only at discrete time t0，t1,.. or tnA change occurs; the satellite node directly connected with the satellite node i belongs to the V through the inter-satellite link is a neighbor satellite node of the satellite node i; line i, line i of Ej columns of inter-satellite links are denoted ISLi,j，ISLi,jE.g., E, the ISLi,jCorresponding weight is WijThe weight is determined by the link propagation delay;
step 2), each satellite maintains its own link state database, and calculates a static routing update routing table according to the link state database information, specifically: when each time slice starts, all satellite nodes update a link state database, static routing is calculated by using a Dijkstra algorithm according to the information of the link state database, namely, the optimal paths from the satellite nodes to all satellite nodes are calculated, and a routing table is updated according to the optimal paths;
the network nodes and the inter-satellite links in the link state database are stored in a static weighting undirected graph form;
the dynamic detection specifically comprises the following steps:
step A), periodically sending HELLO messages to neighbor satellite nodes by all satellite nodes, and maintaining a neighbor satellite state table by each satellite node;
the neighbor satellite state table records whether the on-off state of the neighbor satellite is accessible or not;
step B), the satellite node judges the link state according to the receiving condition of the HELLO message at the timeout moment, and the method specifically comprises the following steps: if the satellite node receives the HELLO message of the neighbor satellite node but the state of the corresponding neighbor satellite node is not reachable at the moment, executing the step C); if the satellite node does not receive the HELLO message of the neighbor satellite node but the state of the corresponding neighbor satellite node can be reached at the moment, executing the step D); if the satellite node receives the HELLO message of the neighbor satellite node and the state of the corresponding neighbor satellite node is reachable at the moment, the satellite node does not receive the HELLO message of the neighbor satellite node and the state of the corresponding neighbor satellite node is unreachable at the moment, and the link state is not changed, executing the step N);
step C), the satellite node judges that the link between the satellite node and the corresponding neighbor satellite node is recovered to be normal, namely the state of the neighbor satellite node is changed to be reachable, and the step E) is executed;
step D), the satellite node judges that the link between the satellite node and the corresponding neighbor satellite node starts to fail, namely the neighbor satellite node is updated to be unreachable, and the step E) is executed;
the limited fault flooding method specifically comprises the following steps:
step E), when the satellite node detects that the link starts to recover or the link starts to fail through the HELLO process, the satellite node immediately updates the corresponding record in the link state database of the satellite node, generates a Link State Advertisement (LSA), and adds the LSA into a link state update list;
the LSA carries the latest link state information, and the satellite node address for generating the LSA is the address of the starting satellite node, the LSA serial number and the LSU hop count; the LSA serial number and the address of the originating satellite node uniquely identify one LSU, and the flooding range is controlled by controlling the hop count of the LSU; storing LSA in the link state updating list;
step F), all satellite nodes maintain own LSA serial numbers, and when an LSA is generated, the LSA serial number is added with 1, the satellite nodes package the generated LSA in a link state update LSU message and send the LSA to all reachable neighbor satellite nodes;
step G), the intermediate satellite node judges whether to receive the LSU message, which specifically comprises the following steps: when the intermediate satellite node receives the LSU message, judging whether to receive the LSU message according to the LSA serial number stored in the self link state updating list and the address of the originating satellite node: if the link state updating list has no LSA, executing step H); if the link state updating list has the LSA, executing step J);
step H), the intermediate satellite node receives the message, the hop count of the LSU message is added with 1, the LSA is stored in a link state updating list, and a link state database is updated according to the latest LSA;
step I), the intermediate satellite node judges whether the hop count of the LSU message reaches the maximum flooding hop count at the moment, and if the hop count reaches the maximum flooding hop count, the step J) is executed; otherwise, executing the step K);
step J), the intermediate satellite node discards the LSU message, continues to wait for the reception of other LSU messages, and executes the step L);
step K), the intermediate satellite node forwards the LSU message to other reachable neighbor satellite nodes except the entrance direction, and step L) is executed;
step L), all satellite nodes periodically check a link state updating list, and if the link state updating list is checked to have LSA, the step M) is executed; otherwise, executing the step N);
step M), the satellite node recalculates the routing table by utilizing Dijkstra algorithm according to the connection and cost information of the link state database, and then clears the link state update list;
step N), the satellite node forwards data according to the routing table;
so far, from step 1) to step N), an adaptive survivability method suitable for the inter-satellite routing is completed.
Advantageous effects
Compared with the existing survivability method of the inter-satellite route, the self-adaptive survivability method suitable for the inter-satellite route has the following beneficial effects:
1. the method makes full use of the periodicity and predictability of the satellite constellation motion, adds the static route, forwards the data according to the routing table when the data arrives, reduces the topology updating frequency and reduces the system overhead;
2. the method is added into a dynamic detection process, can detect the link state, can respond to emergency situations such as satellite node failure or link failure, can generate a link state updating message after detecting the change of the link state, can restore network communication in time, and has certain survivability;
3. the method is added into the limited fault flooding process, when emergency conditions such as satellite node failure or link fault occur, the end-to-end network delay and the packet loss rate are reduced to the maximum extent, the flooding range is controlled by controlling the link state updating message hop number, the routing overhead is obviously reduced, the routing table does not need to be updated in the whole network, and the method can be well applied to the satellite network.
Drawings
FIG. 1 is a LEO satellite network topology scene diagram of an adaptive survivability method for inter-satellite routing in accordance with the present invention;
fig. 2 is a schematic flow chart of an implementation of the adaptive survivability method applicable to the inter-satellite routing of the present invention.
Detailed Description
For better illustrating the purpose and advantages of the adaptive survivability method for inter-satellite routing according to the present invention, the detailed description of the present application will be further described with reference to the accompanying drawings and specific embodiments.
Example 1
Using Walker star polar orbit constellation scene, the satellites at two sides of the reverse seam do not establish connection, each satellite except the satellites at two sides of the reverse seam establishes four inter-satellite links, including two inter-orbit inter-satellite links connected with adjacent satellites in the same orbit plane and two inter-orbit inter-satellite links connected with adjacent satellites in the left and right orbit planes, and the satellites at two sides of the reverse seam establish three inter-satellite links, including one inter-orbit inter-satellite link and two inter-orbit inter-satellite links, as shown in fig. 1.
The self-adaptive anti-damage method comprises static routing, dynamic detection and limited fault flooding;
the method of the invention has advantages over the existing methods in terms of static routing. Examples are as follows: the prior method 1: although the routing algorithm DTDVTR based on the virtual topology strategy also adopts a static routing mechanism, namely an offline pre-calculation mode to simplify the satellite function, the satellite dynamic network topology is divided into a series of continuous static topology structures according to time slices, the ground station calculates the path between each pair of satellites in a pre-centralized manner to provide an optimized path, and the satellites only need to update a routing table at the time slice points. However, the method adopts off-line calculation, so that the survivability of the method is poor, and when emergency conditions such as satellite node failure or link failure occur, the performance of the algorithm is remarkably reduced.
The prior method 2 comprises the following steps: a dynamic routing mechanism is adopted for a data-driven routing algorithm such as a Darting algorithm, namely, topology updating is triggered through arrival of a data packet, new changes in a network can be responded in real time, periodicity and predictability of satellite constellation movement are completely ignored by the algorithm, topology updating is triggered too frequently, and system overhead is greatly increased.
The method of the invention comprises static routing and dynamic detection; the static routing is based on a virtual topology strategy, the whole satellite period is divided into a plurality of time slices, a link state database is updated at the starting moment of each time slice, a routing table is calculated and updated, and when a data packet is received, data is forwarded according to the routing table; dynamic detection, namely detecting the state of the whole satellite network topology in real time, specifically comprising: all satellite nodes periodically send HELLO messages to neighbor satellite nodes so as to detect the link failure condition in the system;
due to the combination of the dual advantages of static routing and dynamic detection, compared with the existing method 1 and the existing method 2, on one hand, when the satellite node fails or the link fails and other emergencies occur, the packet loss rate and the time delay can be further reduced, and the survivability can be improved; on the other hand, the method avoids frequent updating of the topology and effectively reduces the system overhead by combining the periodicity and predictability of the satellite constellation motion.
The method of the invention is different from the existing self-adaptive anti-destruction method in fault flooding: the existing OSPF (Link State routing algorithm) based on the ground fixed network also adopts a dynamic routing mechanism, so that the link state and the satellite node condition can be monitored in real time, but the flooding of the method is diffused to the whole area, namely the flooding is performed to all satellite nodes through the LSA to construct a routing table, and the system overhead is greatly increased. In the method, the optimal path is changed aiming at the change of the link state in order to limit fault flooding, so that the satellite nodes flood and diffuse fault information in a limited range, and the synchronous link state database recalculates the optimal path; compared with the OSPF method, the method greatly reduces the system overhead.
The satellite nodes calculate static routes when each time slice starts, send HELLO messages to neighbor satellite nodes periodically to dynamically detect the topological state of the whole satellite network, and enter a limited fault flooding process after detecting that the link state changes through the dynamic detection process.
Referring to fig. 2, the steps of an embodiment of the present invention will be described in further detail.
The self-adaptive anti-damage method specifically comprises the following steps:
step 1), network modeling, namely establishing a set of satellite nodes and all inter-satellite links, and modeling a network topology into a static weighted undirected graph;
in specific implementation, the establishment process of the inter-satellite link is as follows: equally dividing an LEO period T into a plurality of time slices, establishing an inter-satellite link between each satellite and four neighbor satellites except satellites on two sides of a reverse seam, and establishing an inter-satellite link between the satellites on two sides of the reverse seam and three neighbor satellites;
step 2), each satellite maintains a link state database of the satellite, a static route updating routing table is calculated according to the link state database information, during specific implementation, the inter-satellite link length between each pair of satellite nodes is used as link cost for route calculation, a Dijkstra algorithm is used for calculating the link cost with the minimum link cost in all paths from a source satellite node to a destination satellite node as an optimal path, and the routing table is updated according to the optimal path;
the network nodes and the inter-satellite links in the link state database are stored in a static weighting undirected graph form;
when the data arrives, the data is forwarded according to the routing table, so that the topology updating frequency is reduced, and the system overhead is reduced; when the routing table is implemented, it is shown in table 1:
table 1 routing table
| Time slice sequence number | Source satellite node | Destination satellite node 1 | Next hop |
| Time slice sequence number | Source satellite node | Destination satellite node 2 | Next hop |
| …… | …… | …… | …… |
| Time slice sequence number | Source satellite node | Destination satellite node n-1 | Next hop |
The dynamic detection specifically comprises the following steps:
step A), periodically sending HELLO messages to neighbor satellite nodes by all satellite nodes, and maintaining a neighbor satellite state table by each satellite node;
the neighbor satellite state table records whether the on-off state of the neighbor satellite is accessible or not;
in specific implementation, the satellite node A sends a HELLO message to the neighbor satellite node B, C, D, E, and the satellite node A maintains a neighbor satellite state table and records the address of the neighbor satellite node and the corresponding on-off state;
step B), the satellite node A judges the link state according to the receiving condition of the HELLO message at the timeout moment, and the method specifically comprises the following steps: the satellite node A receives the HELLO message of the neighbor satellite node B, and if the state of the neighbor satellite node B is not reachable at the moment, the step C) is executed; if the satellite node A does not receive the HELLO message of the neighbor satellite node B but the state of the neighbor satellite node B can be reached at the moment, executing the step D); if the satellite node A receives the HELLO message of the neighbor satellite node B, the state of the neighbor satellite node B can be reached, the satellite node does not receive the HELLO message of the neighbor satellite node B, the state of the neighbor satellite node B cannot be reached, and the state of a link between the satellite node A and the neighbor satellite node B is not changed, the step N is executed;
step C), judging that the link between the satellite node A and the neighbor satellite node B is recovered to be normal, namely, the state of the neighbor satellite node B is changed to be reachable; performing step E);
step D), judging that a link between the satellite node A and the neighbor satellite node B starts to fail, namely updating the state of the neighbor satellite node B to be unreachable; performing step E);
the limited fault flooding method specifically comprises the following steps:
step E), the satellite node A immediately updates the corresponding record in the own link state database, generates a Link State Advertisement (LSA), and adds the LSA into a link state update list;
the LSA carries the latest link state information, and the satellite node address for generating the LSA is the address of the starting satellite node, the LSA serial number and the LSU hop count; the LSA serial number and the address of the originating satellite node uniquely identify one LSU, and the flooding range is controlled by controlling the hop count of the LSU; storing LSA in the link state updating list;
the link state updating message is generated after the change of the link state is detected, so that emergency situations such as satellite node failure or link failure can be responded, network communication can be recovered in time, and the end-to-end network delay is reduced; the LSA is embodied as shown in table 2:
the satellite node 1 and the satellite node 2 are satellite node addresses at two ends of link state updating, the cost measurement carries updated link cost information, and the initial satellite node address is a satellite node address for generating the LSA.
Table 2 link state advertisement LSA
| Satellite node 1 address |
| Satellite node 2 address |
| Cost metric |
| Originating satellite node address |
| LSA sequence number |
| Number of LSU hops |
Step F), the satellite node A maintains the self LSA serial number, and when one LSA is generated, the LSA serial number is added with 1, the satellite node A encapsulates the generated LSA in a link state updating LSU message and sends the LSA to the reachable neighbor satellite node C, D, E;
step G), the intermediate satellite node judges whether to receive the LSU message, which specifically comprises the following steps: when the intermediate satellite node receives the LSU message, judging whether to receive the LSU message according to the LSA serial number stored in the self link state updating list and the address of the originating satellite node: if the link state updating list has no LSA, executing step H); if the link state updating list has the LSA, executing step J);
in specific implementation, when the intermediate satellite node E receives the LSU message, judging whether the LSU message is received according to the LSA serial number stored in the link state updating list of the intermediate satellite node E and the address of the originating satellite node, and executing the step H if the LSA is not in the link state updating list;
step H), the intermediate satellite node receives the message, the hop count of the LSU message is added with 1, the LSA is stored in a link state updating list, and a link state database is updated according to the latest LSA;
step I), the intermediate satellite node judges whether the hop count of the LSU message reaches the maximum flooding hop count at the moment, and if the hop count reaches the maximum flooding hop count, the step J) is executed; otherwise, executing the step K);
the maximum flooding hop count is in the range of 1 to 10, and is set to 3 in this embodiment.
The change of the link state only affects the optimal path of the satellite nodes around the failed satellite node, the satellite load capacity is limited, the flooding range can be controlled to remarkably reduce the routing overhead without affecting the algorithm performance, and the flooding range is controlled by controlling the link state to update the message hop number, so that the routing overhead is remarkably reduced;
in specific implementation, the intermediate satellite node E determines whether the hop count of the LSU message at this time reaches the maximum flooding hop count, which does not reach the maximum flooding hop count of 3, and executes step K);
step J), the intermediate satellite node discards the LSU message, continues to wait for the reception of other LSU messages, and executes the step L);
step K), the intermediate satellite node forwards the LSU message to other reachable neighbor satellite nodes except the entrance direction, and step L) is executed;
in specific implementation, the intermediate satellite node E forwards the LSU message to other reachable neighbor satellite nodes F, G except for the entry direction, and executes step L);
step L), all satellite nodes periodically check a link state updating list, and if the link state updating list is checked to have LSA, the step M) is executed; otherwise, executing the step N);
the satellite nodes with the LSA in the link state updating list update the routing table, the routing table does not need to be updated in the whole network, and the system overhead is reduced;
step M), the satellite node recalculates the routing table by utilizing Dijkstra algorithm according to the connection and cost information of the link state database, and then clears the link state update list;
and step N), the satellite node forwards the data according to the routing table.
While the foregoing is directed to the preferred embodiment of the present invention, it is not intended that the invention be limited to the embodiment and the drawings disclosed herein. It is intended that all equivalents and modifications which come within the spirit of the disclosure be protected by the present invention without departing from the spirit of the disclosure.
Claims (5)
1. A self-adaptive survivability method suitable for inter-satellite routing is characterized by comprising the following steps: the method comprises the steps of static routing, dynamic detection and limited fault flooding, and specifically comprises the following steps:
the static routing specifically includes:
step 1, network modeling, specifically: constructing a static weighted undirected graph G by relying on a set E of all satellite nodes and a set V of all inter-satellite linksk；
Step 2, each satellite maintains a link state database of the satellite, and a static routing updating routing table is calculated according to the link state database information;
the dynamic detection specifically comprises the following steps:
step A), periodically sending HELLO messages to neighbor satellite nodes by all satellite nodes, and maintaining a neighbor satellite state table by each satellite node;
step B), the satellite node judges the link state according to the receiving condition of the HELLO message at the timeout moment, and the method specifically comprises the following steps: if the satellite node receives the HELLO message of the neighbor satellite node but the state of the corresponding neighbor satellite node is not reachable at the moment, executing the step C); if the satellite node does not receive the HELLO message of the neighbor satellite node but the state of the corresponding neighbor satellite node can be reached at the moment, executing the step D); if the satellite node receives the HELLO message of the neighbor satellite node and the state of the corresponding neighbor satellite node is reachable at the moment, the satellite node does not receive the HELLO message of the neighbor satellite node and the state of the corresponding neighbor satellite node is unreachable at the moment, and the link state is not changed, executing the step N);
step C), the satellite node judges that the link between the satellite node and the corresponding neighbor satellite node is recovered to be normal, namely the state of the neighbor satellite node is changed to be reachable, and the step E) is executed;
step D), the satellite node judges that the link between the satellite node and the corresponding neighbor satellite node starts to fail, namely the neighbor satellite node is updated to be unreachable, and the step E) is executed;
the limited fault flooding method specifically comprises the following steps:
step E), when the satellite node detects that the link starts to recover or the link starts to fail through the HELLO process, the satellite node immediately updates the corresponding record in the link state database of the satellite node, generates a Link State Advertisement (LSA), and adds the LSA into a link state update list;
the LSA carries the latest link state information, and the satellite node address for generating the LSA is the address of the starting satellite node, the LSA serial number and the LSU hop count; storing LSA in the link state updating list;
step F), all satellite nodes maintain own LSA serial numbers, and when an LSA is generated, the LSA serial number is added with 1, the satellite nodes package the generated LSA in a link state update LSU message and send the LSA to all reachable neighbor satellite nodes;
step G), the intermediate satellite node judges whether to receive the LSU message, which specifically comprises the following steps: when the intermediate satellite node receives the LSU message, judging whether to receive the LSU message according to the LSA serial number stored in the self link state updating list and the address of the originating satellite node: if the link state updating list has no LSA, executing step H); if the link state updating list has the LSA, executing step J);
step H), the intermediate satellite node receives the message, the hop count of the LSU message is added with 1, the LSA is stored in a link state updating list, and a link state database is updated according to the latest LSA;
step I), the intermediate satellite node judges whether the hop count of the LSU message reaches the maximum flooding hop count at the moment, and if the hop count reaches the maximum flooding hop count, the step J) is executed; otherwise, executing the step K);
step J), the intermediate satellite node discards the LSU message, continues to wait for the reception of other LSU messages, and executes the step L);
step K), the intermediate satellite node forwards the LSU message to other reachable neighbor satellite nodes except the entrance direction;
step L), all satellite nodes periodically check a link state updating list, and if the link state updating list is checked to have LSA, the step M) is executed; otherwise, executing the step N);
step M), the satellite node recalculates the routing table by utilizing Djkstra algorithm according to the connection and cost information of the link state database, and then clears the link state update list;
and step N), the satellite node forwards the data according to the routing table.
2. The method of claim 1A self-adaptive survivability method suitable for inter-satellite routing is characterized by comprising the following steps: step 1, specifically: at an interval of [ t ]m，tm+1]In (1), modeling the network topology as a static weighted undirected graph Gk＝(V，E)；
Wherein G iskFor a static weighted undirected graph, V is the set of all satellite nodes, E is the set of all inter-satellite links, separated by [ t ]m，tm+1]Is equal to the LEO period T and is divided into m +1 of n time slices, and the n time slices are marked as [ T0＝0，t1]，[t1，t2]，...，[tn-1，tn]The link length of all inter-satellite links in E is only at discrete time t0，t1,.. or tnA change occurs; the satellite node directly connected with the satellite node i belongs to the V through the inter-satellite link is a neighbor satellite node of the satellite node i; the i row and j column inter-satellite links in E are denoted as ISLi，j，ISLi，jE.g., E, the ISLi，jCorresponding weight is WijThe weight is determined by the link propagation delay.
3. The adaptive survivability method for inter-satellite routing according to claim 2, characterized in that: step 2, specifically: and when each time slice starts, all the satellite nodes update the link state database, and according to the information of the link state database, the static route is calculated by using the Djkstra algorithm, namely, the optimal paths from the satellite nodes to all the satellite nodes are calculated, and the routing table is updated according to the optimal paths.
4. The adaptive survivability method for inter-satellite routing according to claim 3, characterized in that: in the step A, the neighbor satellite state table records whether the on-off state of the neighbor satellite is accessible or not.
5. The adaptive survivability method for inter-satellite routing according to claim 4, characterized in that: in step E, the LSA serial number and the originating satellite node address uniquely identify an LSU, and the flooding range is controlled by controlling the hop count of the LSU.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110756148.8A CN113489528A (en) | 2021-07-05 | 2021-07-05 | Self-adaptive survivability method suitable for inter-satellite routing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110756148.8A CN113489528A (en) | 2021-07-05 | 2021-07-05 | Self-adaptive survivability method suitable for inter-satellite routing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113489528A true CN113489528A (en) | 2021-10-08 |
Family
ID=77939887
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110756148.8A Pending CN113489528A (en) | 2021-07-05 | 2021-07-05 | Self-adaptive survivability method suitable for inter-satellite routing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113489528A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114039655A (en) * | 2021-12-08 | 2022-02-11 | 重庆邮电大学 | Inter-satellite route anti-destruction method based on link prediction and region division |
| CN114285458A (en) * | 2021-12-24 | 2022-04-05 | 网络通信与安全紫金山实验室 | Ground simulation method, system, equipment and medium for progressive deployment of satellite network |
| CN114422017A (en) * | 2021-12-28 | 2022-04-29 | 中国电子科技集团公司第二十九研究所 | Method for realizing flow load balance of low-orbit constellation |
| CN114422015A (en) * | 2021-12-28 | 2022-04-29 | 中国电子科技集团公司第二十九研究所 | Method for implementing survivable route of low-orbit constellation |
| CN114614883A (en) * | 2022-03-17 | 2022-06-10 | 中国人民解放军国防科技大学 | Dynamic off-orbit complex constellation inter-satellite link routing method |
| CN114828144A (en) * | 2022-03-27 | 2022-07-29 | 西安电子科技大学 | Low-earth-orbit satellite constellation-oriented service quality guarantee routing method |
| CN114978285A (en) * | 2022-05-17 | 2022-08-30 | 北京交通大学 | Centralized control-based satellite network route elastic recovery method and system |
| CN114978275A (en) * | 2022-04-07 | 2022-08-30 | 航天行云科技有限公司 | Low-orbit satellite route processing method and device for inter-satellite rabdosis interruption and satellite |
| CN115361335A (en) * | 2022-07-13 | 2022-11-18 | 鹏城实验室 | SR-MPLS-based dynamic routing method for low-orbit satellite network |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101022457A (en) * | 2007-03-12 | 2007-08-22 | 北京交通大学 | Radio multi-hopping network audio frequency, data transmission nodal equipment |
| CN101459946A (en) * | 2008-12-12 | 2009-06-17 | 南京邮电大学 | Satellite network reliable routing method based on virtual nodes |
| CN207782838U (en) * | 2018-01-22 | 2018-08-28 | 苗增良 | A kind of multirouting transmission converter |
| US20190081884A1 (en) * | 2017-09-12 | 2019-03-14 | Adara Networks, Inc. | Dynamic link state routing protocol |
| CN112351469A (en) * | 2020-09-23 | 2021-02-09 | 北京遥测技术研究所 | Route optimization method based on inter-satellite link |
| CN113067627A (en) * | 2021-03-18 | 2021-07-02 | 西安电子科技大学 | Self-adaptive survivable satellite routing method based on virtual nodes |
-
2021
- 2021-07-05 CN CN202110756148.8A patent/CN113489528A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101022457A (en) * | 2007-03-12 | 2007-08-22 | 北京交通大学 | Radio multi-hopping network audio frequency, data transmission nodal equipment |
| CN101459946A (en) * | 2008-12-12 | 2009-06-17 | 南京邮电大学 | Satellite network reliable routing method based on virtual nodes |
| US20190081884A1 (en) * | 2017-09-12 | 2019-03-14 | Adara Networks, Inc. | Dynamic link state routing protocol |
| CN207782838U (en) * | 2018-01-22 | 2018-08-28 | 苗增良 | A kind of multirouting transmission converter |
| CN112351469A (en) * | 2020-09-23 | 2021-02-09 | 北京遥测技术研究所 | Route optimization method based on inter-satellite link |
| CN113067627A (en) * | 2021-03-18 | 2021-07-02 | 西安电子科技大学 | Self-adaptive survivable satellite routing method based on virtual nodes |
Non-Patent Citations (5)
| Title |
|---|
| 张胜东等: "面向GEO/LEO双层卫星网络的抗毁路由策略", 《南京邮电大学学报(自然科学版)》 * |
| 杜保洋等: "LEO卫星网络路由协议研究", 《广东通信技术》 * |
| 赵志刚等: "LEO/MEO卫星网络基于动态路由策略的链路故障检测", 《小型微型计算机系统》 * |
| 邢川等: "基于动静结合方法的卫星网络路由方法研究", 《空间控制技术与应用》 * |
| 郭炎鑫等: "多层卫星网络链路中断容忍路由策略设计", 《电子与信息学报》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114039655A (en) * | 2021-12-08 | 2022-02-11 | 重庆邮电大学 | Inter-satellite route anti-destruction method based on link prediction and region division |
| CN114039655B (en) * | 2021-12-08 | 2023-07-25 | 重庆邮电大学 | Inter-satellite route survivability method based on link prediction and region division |
| CN114285458A (en) * | 2021-12-24 | 2022-04-05 | 网络通信与安全紫金山实验室 | Ground simulation method, system, equipment and medium for progressive deployment of satellite network |
| CN114422017A (en) * | 2021-12-28 | 2022-04-29 | 中国电子科技集团公司第二十九研究所 | Method for realizing flow load balance of low-orbit constellation |
| CN114422015A (en) * | 2021-12-28 | 2022-04-29 | 中国电子科技集团公司第二十九研究所 | Method for implementing survivable route of low-orbit constellation |
| CN114614883A (en) * | 2022-03-17 | 2022-06-10 | 中国人民解放军国防科技大学 | Dynamic off-orbit complex constellation inter-satellite link routing method |
| CN114614883B (en) * | 2022-03-17 | 2023-06-13 | 中国人民解放军国防科技大学 | Dynamic different-orbit complex constellation inter-satellite link routing method |
| CN114828144A (en) * | 2022-03-27 | 2022-07-29 | 西安电子科技大学 | Low-earth-orbit satellite constellation-oriented service quality guarantee routing method |
| CN114978275A (en) * | 2022-04-07 | 2022-08-30 | 航天行云科技有限公司 | Low-orbit satellite route processing method and device for inter-satellite rabdosis interruption and satellite |
| CN114978285A (en) * | 2022-05-17 | 2022-08-30 | 北京交通大学 | Centralized control-based satellite network route elastic recovery method and system |
| CN115361335A (en) * | 2022-07-13 | 2022-11-18 | 鹏城实验室 | SR-MPLS-based dynamic routing method for low-orbit satellite network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113489528A (en) | Self-adaptive survivability method suitable for inter-satellite routing | |
| CN111953399B (en) | Inter-satellite routing method in low-earth-orbit satellite communication network | |
| CN103986512B (en) | Satellite network inter-satellite link failure recovery method based on regional division | |
| CN111211828A (en) | Inter-satellite routing method and device for low earth orbit communication satellite constellation | |
| CN113067627B (en) | Self-adaptive survivable satellite routing method based on virtual nodes | |
| CN107276663B (en) | Satellite network snapshot route optimization method | |
| CN114039655B (en) | Inter-satellite route survivability method based on link prediction and region division | |
| CN109600312B (en) | BATMAN-Adv protocol optimization design method for intelligent terminal ad hoc network | |
| Zhou et al. | Geo‐LANMAR: a scalable routing protocol for ad hoc networks with group motion | |
| Ji et al. | A destruction-resistant on-demand routing protocol for LEO satellite network based on local repair | |
| Sakurai et al. | AODV multipath extension using source route lists with optimized route establishment | |
| Kretschmer et al. | Dt-dymo: Delay-tolerant dynamic manet on-demand routing | |
| CN115297045B (en) | Low-orbit satellite network-oriented flooding topology construction method, device and storage medium | |
| Vijayalakshmi et al. | Towards sustainable energy efficient routing for dynamic ad-hoc communications in smart cities | |
| Chakraborty et al. | A tree-based local repairing approach for increasing lifetime of query driven WSN | |
| Lu et al. | Distributed traffic balancing routing for LEO satellite networks | |
| Gruber et al. | Ad hoc routing for cellular coverage extension | |
| Liu et al. | Advanced Fast Recovery OLSR Protocol for UAV Swarms in the Presence of Topological Change | |
| Lu et al. | Quick routing response to link failure in low-earth orbit satellite networks | |
| Khayou et al. | A hybrid distance vector link state algorithm: distributed sequence number | |
| Choi et al. | Bio-inspired routing protocol based on pheromone diffusion in mobile ad hoc networks | |
| CN114614883B (en) | Dynamic different-orbit complex constellation inter-satellite link routing method | |
| Biradar et al. | Information priority based multicast routing in MANETs | |
| CN112910543B (en) | Method for realizing double-layer satellite routing mechanism with delay tolerance and disconnection tolerance | |
| Yan et al. | Performance Analysis and Improved of Using OLSR in Low-orbit Satellite Communication System |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20211008 |
|
| WD01 | Invention patent application deemed withdrawn after publication |