CN114039655A - Inter-satellite route anti-destruction method based on link prediction and region division - Google Patents

Inter-satellite route anti-destruction method based on link prediction and region division Download PDF

Info

Publication number
CN114039655A
CN114039655A CN202111492195.2A CN202111492195A CN114039655A CN 114039655 A CN114039655 A CN 114039655A CN 202111492195 A CN202111492195 A CN 202111492195A CN 114039655 A CN114039655 A CN 114039655A
Authority
CN
China
Prior art keywords
satellite
link
orbit
fault
satellites
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.)
Granted
Application number
CN202111492195.2A
Other languages
Chinese (zh)
Other versions
CN114039655B (en
Inventor
赵国锋
陆毅
徐川
韩珍珍
罗奎
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN202111492195.2A priority Critical patent/CN114039655B/en
Publication of CN114039655A publication Critical patent/CN114039655A/en
Application granted granted Critical
Publication of CN114039655B publication Critical patent/CN114039655B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

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)

Abstract

The invention belongs to the technical field of satellite communication, and relates to an inter-satellite route survivable method based on link prediction and region division; the method comprises the steps that when the satellite has periodic faults, namely the faults occur in an inter-orbit link and the satellite is in a polar region, a fault recovery period is determined based on the on-off rule of the link, and the fault link is updated in advance; when a satellite has a random fault, performing autonomous area division according to the position of the fault, and executing a route anti-destruction strategy; if the fault occurs in the inter-orbit link and the satellite is not in the polar region, the fault satellite performs single-hop flooding and regional fusion to the own neighbor satellite; if the fault occurs in the in-orbit link, the faulty satellite broadcasts the area to all satellites in the same orbit. The invention divides different operation states and fault types among satellites, adopts different routing mechanisms to provide the optimal path under the current network condition, reduces the resource cost and routing loop of path calculation, and reduces the network packet loss.

Description

Inter-satellite route anti-destruction method based on link prediction and region division
Technical Field
The invention belongs to the technical field of satellite communication, and particularly relates to an inter-satellite route survivable method based on link prediction and region division.
Background
A Low Earth Orbit (LEO) satellite constellation network will be an important component of the next generation communication infrastructure. A low earth orbit satellite constellation network using inter-satellite links (ISLs) may be immune to geographical obstructions and independent of ground infrastructure. However, the research and selection of routing algorithms are always in important positions in both traditional terrestrial networks and today's satellite networks.
Meanwhile, in a satellite network, space-borne equipment in a spatial information network uses an aerospace-level chip, the computing capacity, the memory capacity and the like of the space-borne equipment are greatly limited, the satellite link connection is unstable due to the severe operating environment of the satellite network, the position of a fault link needs to be detected immediately after the link fails, and countermeasures are taken for the fault situation in a route recovery technology to achieve the aim of efficiently and timely recovering communication.
The common satellite network survivable routing technology adopts the global flooding mode of OSPF and RIP to process the fault information of the satellite, i.e. when the connection is established or changed, the routing protocol interacts the network topology information and reconstructs the routing table. However, compared with the terrestrial network, the satellite network has the characteristic of moving at a high speed, so that the network topology changes rapidly, the topology information is expired rapidly and needs to be refreshed frequently. The algorithm has large processing overhead, so that the algorithm is more difficult to be applied to a satellite network.
And the representative of local flooding is an ant colony algorithm, the algorithm adopts a method of detecting a data packet to process faults, collects and adds fault information of a passing satellite into the detection data packet in the process of going to a destination, and returns the detection data packet according to the original route and simultaneously performs route calculation after the detection data packet reaches the destination. But due to the high dynamics of the satellites and the depth of the probe related to the number in the satellite network, it is difficult to guarantee the timeliness of the computation.
Therefore, in order to ensure that the satellite network can provide stable and reliable communication service, the core problem is how to realize a timely and accurate link fault prediction and flexible and efficient route survivability scheme.
Disclosure of Invention
In order to solve the above problems, the present invention provides an inter-satellite routing survivability method based on link prediction and region division, which is mainly used between Low Earth Orbit (LEO) satellite constellation networks, and is used to ensure that different services still provide an effective routing path and ensure stable forwarding of data when encountering link failure under the satellite network, and reduce occupation of on-satellite resources.
An inter-satellite route survivability method based on link prediction and area division, the method comprising:
when the satellite has periodic faults, namely the faults occur in an inter-orbit link and the satellite is in a polar region, determining a fault recovery period based on the on-off rule of the link, and updating the fault link in advance;
when a satellite has a random fault, performing autonomous area division according to the position of the fault, and executing a route anti-destruction strategy; if the fault occurs in the inter-orbit link and the satellite is not in the polar region, the fault satellite performs single-hop flooding and regional fusion to the own neighbor satellite; if a failure occurs in an in-orbit link and whether or not the satellite is in a polar region, the failed satellite broadcasts the region to all satellites in the same orbit.
The invention has the beneficial effects that:
1. the invention carries out route updating and route judgment based on the periodicity and regularity of satellite motion, can reduce frequent information interaction of different satellites in polar regions, avoids the problem that a routing table cannot be updated immediately due to global flooding, and can provide an effective routing path through local flooding when the satellite has a random link failure, thereby realizing the maximization of the overall benefit of satellite network resources.
2. The invention provides the optimal path under the current network condition by dividing different running conditions and fault types among satellites and adopting different routing mechanisms, thereby reducing the resource cost and routing loop of path calculation and reducing the network packet loss.
Drawings
FIG. 1 is a schematic diagram of a low earth orbit satellite scenario according to an embodiment of the invention;
FIG. 2 is a flowchart of an inter-satellite routing survivability method based on link prediction and area partitioning in an embodiment of the present invention;
FIG. 3 is a diagram of a satellite network topology based on virtual ID numbers according to an embodiment of the present invention;
FIG. 4 is a time slice division diagram of an embodiment of the present invention;
FIG. 5 is a schematic diagram of a random fault occurring within a track in an embodiment of the present invention;
FIG. 6 is a schematic diagram of random faults occurring between tracks in an embodiment of the present invention;
FIG. 7 is a diagram illustrating an embodiment of the present invention in which a child node also generates a random failure;
FIG. 8 is a diagram illustrating region fusion performed by child nodes in an embodiment of the present invention;
FIG. 9 is a flowchart of an inter-satellite route survivability method based on link prediction and area partitioning in a preferred embodiment of the present invention;
fig. 10 is a flow chart of an inter-satellite route survivability method based on link prediction and area division in another preferred embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
FIG. 1 is a schematic diagram of a low earth orbit satellite scenario according to an embodiment of the invention; fig. 1 shows a typical low-earth orbit satellite network scenario applied in the present invention, and the specific application scenario is not limited thereto; the low-orbit satellite network comprises 5 orbit planes, each orbit plane comprises 4 satellites, and the jth satellite positioned on the ith orbit is marked as Si,jEach satellite establishes a connection with its own neighboring satellite. Each satellite contains two satellites except for the satellite along the edge orbitInter-links and two intra-track links. The first and fifth orbital planes maintain only three inter-satellite links due to the presence of the reverse slot. At the same time, when the latitude of the satellite is higher than 70 degrees, the inter-satellite link between the horizontal planes is closed because the relative movement speed of the satellite is too large. For simplicity, all LEO satellites are indexed in XY format, where X represents the orbital plane from 1 to 5 and Y represents the satellite in X orbit from 1 to 4. All satellites act as routers, forming local routing tables, using proprietary routing protocols in the satellite network.
In the invention, considering that the link faults of the satellite are mainly divided into two categories, one category is the periodic faults caused by the periodicity and regularity of the satellite motion, and the other category is the random faults caused by other emergency situations, the invention respectively adopts different modes to process the periodic faults and the random faults so as to solve the problem of inter-satellite route survivability.
Fig. 2 is a flowchart of an inter-satellite routing survivability method based on link prediction and area division in an embodiment of the present invention, and as shown in fig. 2, the method includes:
101. when the satellite has periodic faults, namely the faults occur in an inter-orbit link and the satellite is in a polar region, determining a fault recovery period based on the on-off rule of the link, and updating the fault link in advance;
102. when a satellite has a random fault, performing autonomous area division according to the position of the fault, and executing a route anti-destruction strategy; if the fault occurs in the inter-orbit link and the satellite is not in the polar region, the fault satellite performs single-hop flooding and regional fusion to the own neighbor satellite; if a failure occurs in an in-orbit link and whether or not the satellite is in a polar region, the failed satellite broadcasts the region to all satellites in the same orbit.
In the embodiment of the present invention, before a periodic fault and a random fault occur, a virtual topology needs to be constructed, and a corresponding anti-crash strategy is executed when the periodic fault or/and the random fault occur based on the virtual topology, wherein the construction process of the virtual topology includes:
at satellite initializationSetting a virtual ID number for each satellite during configuration, wherein the virtual ID comprises an orbit number and an in-orbit number of the satellite; each satellite can calculate the number of the orbit of the satellite and the number in the orbit according to the virtual ID number, and the set of the orbit numbers of the satellite is assumed to be I ═ I1,i2,…,iM) M is the maximum number of the track surface, and the number set in the track is J ═ J1,j2,…,jN) N is the largest number in the orbit, and the virtual ID number T of the satellite is (I, J), so that each satellite determines the address of the neighboring satellite around itself according to the virtual ID number of itself, as shown in fig. 3, fig. 3 shows a partial topology, each satellite has 4 neighborhoods, specifically including neighboring satellites in four directions, front, back, left and right, and assuming that the current satellite is (3,2), its neighboring satellites are (2,2), (4,2), (3,1) and (3,3), respectively, because the relative position of the satellite network is basically fixed, the most communication-capable nodes of the satellite are two satellites in front and back in the same orbit (upper and lower satellites in fig. 3) and two satellites in left and right between adjacent orbits, and the satellites in the same orbit with the current satellite (3,2) are (3,1), (3,3) and (3,4), and the current satellite (3,2) the satellites that are in adjacent orbits and that are capable of communication are (2,2) and (4, 2).
In the embodiment of the invention, a topological model of a satellite constellation system can be equivalent to a connected regular chessboard diagram, and because data packets can only travel inter-satellite links in orbits or inter-satellite links between orbits when transmitted in a satellite network, the Manhattan minimum distance between any two satellites (m, n) to (x, y) is equal under the condition that the links are connected and no other faults exist.
c＝|im-ix|+|jn-jy|
Wherein c represents the minimum Manhattan distance, imRepresents the number of orbits of the satellite (m, n); i.e. ixRepresents the orbital number of the satellite (x, y); j is a function ofnRepresents the in-orbit number of the satellite (m, n); j is a function ofyDenotes the in-orbit number of the satellite (x, y).
Therefore, based on the above analysis, the present invention can determine the position of the next-hop packet transmission routing node according to the virtual ID (m, n) of the destination satellite in the received packet and the state information of the associated link. If the inter-orbit parameter m of the target satellite ID is larger than the inter-orbit parameter x of the current relay node, transmitting to the right, otherwise, transmitting to the left; secondly, judging an in-orbit parameter N, wherein the number of satellite nodes in the orbit is N, if the difference of the absolute value of the in-orbit parameter N of the target satellite and the relay point is less than half of the number of satellites in the orbit, transmitting downwards in the same orbit (the reverse direction of the satellite operation), otherwise, transmitting upwards in the same orbit; and if the difference of the absolute values of the in-orbit parameters n of the target satellite and the relay point is more than half of the number of the satellites in the orbit, transmitting upwards in the same orbit, and otherwise, transmitting upwards in the same orbit.
In the embodiment of the invention, each satellite maintains a link state table to store the known random fault information in the satellite network link, and also maintains a network adjacent matrix for route calculation to update the routing table; meanwhile, a transmission mechanism of a Hello data packet of an OSPF protocol is added to generate a neighbor list for maintaining the relationship between the satellite node and the neighbor satellite, so that normal communication between the satellites is ensured.
In the embodiment of the invention, in order to solve the problem of route survivability of the periodic fault of the satellite, the invention divides time slices according to the rule of satellite operation and uploads a corresponding link state table of a satellite network; when the satellite normally operates, the topological snapshot about the satellite network is continuously received from the gateway station, and the route updating is triggered for processing the condition that the satellite enters and exits the polar region.
As shown in fig. 4, the present invention first defines N times of topology change of the satellite network as a set T ═ T (T ═ T)0,t1,…,tN) Wherein each time point is the time of a topology change and the time interval t is slicedi,ti+1]Representing the time of transition of an inter-orbital link in the satellite network, and the corresponding N snapshot slices are P ═ (P)0,p1,…,pN) (ii) a The problem of frequent link switching when the satellite enters and exits the polar region can cause the condition that a plurality of satellite links are disconnected simultaneously, so that the section is abandonedTime slices of time, i.e. pi+1＝pi+2(ii) a At this time, the topology of the network is added to the adjacency matrix for route calculation in advance, and route update is triggered when the satellite enters and exits from the polar region.
In the present invention, since the transition time slice pi+1Generation of (a) piAnd pi+1There is a switching interval, and in order to ensure the stability of switching, the transition time slice p needs to be reseti+1The transition time of (2). Let pi+1Has an original transformation time tpThe time interval to be adjusted is Δ τ (Δ τ)<<tp) If the data packet is at tpEmitted at a time Δ τ, just after t, over a time Δ τpThe moment is to reach the destination end, at the moment, just tpThe data packet loss is caused by passing through the link which is switched on and off at any time. The time of advance of the snapshot can be obtained according to the maximum delay of the network at this time, and it is assumed that the number of satellites on the same orbital plane is M and the number of satellites in the same orbit is N, and at this time, since the satellites in the same orbit enter into north and south polar regions of the earth respectively, the maximum average hop count is: u ═ M + N)/3; meanwhile, the transmission time of a satellite link is set to be Ta, the processing time delay of a satellite node is set to be Tb, and the maximum delay time delay of a satellite network is set to be Sigma (Ta + Tb) U; simultaneous time slices pi+1To pi+2There will also be a certain switching interval, but due to pi+2Has been given pi+1And the error caused by the switching interval at present can be avoided by recording in advance.
In the embodiment of the invention, in order to solve the route survivability of the satellite with random faults, the invention divides autonomous regions according to the positions of the faults and executes a route survivability strategy according to the division result of the autonomous regions; firstly, judging whether the position of a satellite with a random fault is an inter-orbit link or/and an intra-orbit link, and if the random fault is in the intra-orbit link, dividing the current satellite and the satellites in the same orbit into autonomous regions; if the random fault occurs in the inter-orbit link, all the neighborhood satellites of the current satellite and the opposite-end satellite with the inter-orbit link fault are divided into autonomous areas.
In the invention, the failure degree of random failure is mainly judged from the capacity of a link and a point storage space, and the flow of a satellite node and a neighbor node is defined as follows:
Figure BDA0003398829430000061
where M represents the set of neighboring nodes of the satellite and τ represents the time gap.
For the capacity of the link, define
Figure BDA0003398829430000062
Representing the flow of data flow Mi over link uv, since the total data of the tasks on the link cannot exceed its maximum capacity, the capacity constraint can be expressed as:
Figure BDA0003398829430000071
in the above formula, the first and second carbon atoms are,
Figure BDA0003398829430000072
indicating that the link (u, v) is at τqMaximum transmission capacity, w, ofuv(t) is the bandwidth of the link.
Thus, in view of the above capacity constraints, the utility function of the link capacity may be defined as:
Figure BDA0003398829430000073
for the storage space of the node, the maximum buffer size of the satellite node v is assumed to be BvFor intermediate node v, its ingress and egress of data streams affects its buffer queue length, for τ1The buffer queue length of the satellite node v can be expressed as:
Figure BDA0003398829430000074
for a time gap τqThe calculation of the buffer queue length of the satellite node v should also take into account the amount of buffered data in the previous time interval, which can be expressed as:
Figure BDA0003398829430000075
thus, due to the limited buffer size of the satellite node, the total amount of buffered data in any time interval should be less than the satellite node maximum buffer size Bv
Figure BDA0003398829430000076
Based on the above analysis, the node storage space constraint can be expressed as:
Figure BDA0003398829430000077
thus, in view of the above memory space constraints, the utility function of the buffer queue may be defined as:
Figure BDA0003398829430000078
through modeling analysis of chain link capacity and storage space, utility functions U (c) and U (b) can be obtained respectively, and each utility function value is between [0,1 ]. The link quality utility value for the satellite can be expressed as:
Figure BDA0003398829430000081
because U (c) and U (b) are both between [0,1]]Hence the link utility value Ui∈[0,1]，
Figure BDA0003398829430000082
Determining attributes for link capacity and storage space, respectivelyAnd satisfy
Figure BDA0003398829430000083
The adjustment is made according to the processing power of the satellite. The satellite node S (m, n) records the minimum value of the link quality utility values, j represents the order of the records, i.e.:
Figure BDA0003398829430000084
when U is turnedj(S(m,n))-Uj-1(S (m, n)) < 0 and j > 2, determining that the current satellite has a random fault and needing to adopt a survivability strategy; when U is turnedj(S (m, n)) ≈ 0, and also requires an anti-crash policy, i.e., sending an anti-crash request packet.
In order to accurately mark out autonomous regions, the invention firstly accurately describes the connectivity between satellite nodes, and introduces the concept of direction degree according to the relationship between the current satellite S (m, n) and the 4 neighborhoods thereof:
let Lx+(m,n)，Lx-(m,n)，Ly+(m,n)，Ly-(m, n) indicate the degrees of the current satellite S (m, n) to the left, right, forward, and backward, respectively, and the subscript x indicates the horizontal direction and the y vertical direction.
Simultaneously, the method comprises the following steps:
Figure BDA0003398829430000085
Figure BDA0003398829430000086
Figure BDA0003398829430000087
Figure BDA0003398829430000088
then there are:
Figure BDA0003398829430000089
the same can be obtained:
Figure BDA00033988294300000810
thus, the total first and second direction degrees L (m, n, L)*(m, n) are respectively:
Figure BDA0003398829430000091
Figure BDA0003398829430000092
in the embodiment of the invention, the first direction degree L (m, n) and the second direction degree L*(m, n) judging the degree of the link failure of the current satellite:
firstly, the current satellite S (m, n) detects the link interface status of all nodes through the MAC layer to obtain the direction Lx+(m,n)，Lx-(m,n)，Ly+(m,n)，Ly-The value of (m, n).
If all links between the current satellite and the 4 neighboring satellites are failed, the second direction degree L*If (m, n) is 0 and the first direction degree L (m, n) is 0, the satellite S (m, n) is considered to be completely failed, and the neighbor satellite of the current satellite is replaced by sending the anti-crash request packet;
if partial link between the current satellite and the 4 adjacent satellites is in failure, L is*And (m, n) ≠ 0, and L (m, n) ≠ 0, the current satellite carries out the anti-destruction strategy according to the position of the link fault.
In the invention, because only random faults in the orbits are considered when the satellites are in polar regions (the faults between the orbits are processed by adopting a time slice mechanism), region division and flooding are required to be carried out, and if the faults occur in an inter-orbit link and the satellites are not in the polar regions, the faulty satellites carry out single-hop flooding and region fusion to own neighbor satellites; if a failure occurs in an in-orbit link and whether or not the satellite is in a polar region, the failed satellite broadcasts the region to all satellites in the same orbit.
In the embodiment of the invention, when the fault occurs in the in-orbit link, whether the satellite is in the polar region or not does not need to be considered, namely if L isy+(m, n) 0 or Ly-If (m, n)' 0, the current satellite broadcasts the area to all the satellites in the same orbit, and the satellite associated with the failed link is used as a father node to broadcast the area to all the nodes in the orbit, so as to determine the position of the link failure. And simultaneously marking the nodes receiving the fault information as child nodes.
Specifically, as shown in fig. 5, a current satellite < m, n > and a peer-to-peer satellite < m, n-1> in which an intra-orbit link failure occurs transmit a link state packet to all neighboring satellites in the autonomous region, that is, in the current orbit m, by broadcasting, a parent node a < m, n > transmits link failure information to a child node < m, n +1> and a child node < m, n +2>, and a parent node B < m, n-1> transmits link failure information to a child node < m, n-2>, thereby forming the autonomous region in the orbit shown in fig. 5.
And the neighbor satellite receiving the link state data packet, namely the child node < m, n +1>, the child node < m, n +2> and the child node < m, n-2>, judges whether the link fault occurs in the neighbor satellite, if the link fault does not occur, the link state data packet is analyzed, judges whether the analyzed in-orbit link fault exists, if the in-orbit link fault does not exist, the in-orbit link fault is added into a link state table of the neighbor satellite, an adjacent matrix used for route updating is generated, a D algorithm is executed according to the adjacent matrix to calculate the shortest path, and the route table is updated.
In the embodiment of the invention, when the fault occurs in the inter-orbit link and the satellite is not in the polar region, namely the fault occurs in the inter-orbit link of the current satellite and the links of the satellites in the left and right neighborhoods of the current satellite, namely if L is Lx+(m, n) 0 or Lx-If (m, n) is 0, then the current satellite makes a single hop to its own neighbor satelliteFlooding and regional fusion; the current satellite and opposite end satellite with the inter-orbit link failure respectively send a link state data packet to all the neighbor satellites in the autonomous region, the neighbor satellite receiving the link state data packet judges whether the link failure occurs or not, if the link failure does not occur, the link state data packet is analyzed, whether the analyzed inter-orbit link failure exists or not is judged, if the analyzed inter-orbit link failure does not exist, the link state data packet is added into a link state table of the neighbor satellite, an adjacent matrix used for route updating is generated, a D algorithm is executed according to the adjacent matrix to calculate the shortest path, the route table is updated, whether links parallel to the failed inter-orbit link exist or not is detected by all the satellites in the autonomous region, the parallel links are nearest to the Manhattan distance of the detected satellite, if the links exist, all the satellites related to the links are subjected to information interaction, and the opposite side is added into a to-be-transmitted list of the self, and flooding according to the satellites in the list to be transmitted.
In the above embodiment, the present invention may further determine whether the detected failure information in the link state table of the current satellite is recorded, and if so, do not perform any operation, otherwise, store the failed link information in the link state table of the satellite itself, then change the network adjacency matrix of itself, and perform the D algorithm according to the adjacency matrix to calculate the shortest paths to the other satellite nodes in the satellite network, and update the routing table. In the embodiment of the present invention, in order to facilitate determining the location of the failure and processing the flooding message, the node with the link failure is referred to as a parent node, and the node that receives the link status packet sent by the parent node is referred to as a child node. The link state packet contains the virtual ID number of the parent node, the location of the failed link, and the state of the failed link. And simultaneously generating an adjacency matrix W for route updating according to the received fault information:
Figure BDA0003398829430000111
meanwhile, a pending transmission list (the pending transmission list of a father node contains own neighbor nodes by default) and an adjacency matrix in the network are set up for each node. The list to be transmitted refers to that after a certain node receives a link state data packet, the data packet should be flooded to which satellites, and the function of the list is to ensure that the satellites in the autonomous region all receive the same link state information, namely to ensure the routing convergence in the region.
And if the position of the fault link is positioned between the tracks, transmitting a link state data packet to the neighbor node which does not generate the link fault. As shown in fig. 6, when a link { < m, n >, < m +1, n > } has a fault, the parent node a and the parent node B need to send fault information to their respective neighboring satellites, where the neighboring satellites for the parent node a < m, n > to send link state packets are node < m-1, n >, node < m, n +1> and node < m, n-1>, and the neighboring satellites for the parent node B < m +1, n > to send link state packets are node < m +1, n-1>, node < m +2, n > and node < m +1, n +1>, so that a preliminary autonomous region is formed.
If each child node detects a link failure at this time, the child node notifies its own failure information to the parent node of the current satellite, and repeats the above operations, and at this time, the node recognizes as a new parent node, and needs to notify its own child node of new failure information received from other parent nodes, and notify its own failure information to the parent node of the other party. And adding the father node into the self waiting list. As shown in fig. 7, when a random fault occurs in a child node C < m, n +1>, the node needs to flood the fault information to a parent node a < m, n >, a node < m-1, n +1>, and a node < m, n +2 >. Otherwise, the child node detects whether the fault information appears in the own link state table, if not, the fault information is added into the own link state table, then the own network adjacent matrix is changed, the D algorithm is executed according to the adjacent matrix to calculate the shortest paths to the rest satellite nodes in the satellite network, and the routing table is updated. If so, no action is performed.
And then, the child nodes detect whether a link which is parallel to the fault link and has the nearest Manhattan distance from the child nodes exists in the current network topology, if so, the child nodes associated with the link carry out information interaction, and the other side is added into a list to be transmitted. The flooding is targeted to the nodes in the list to be transmitted. As shown in fig. 8, node E < m, n-1> node F < m +1, n-1> needs to perform information interaction, and node C and node D perform the same operation to form region fusion, thereby ensuring the closure of the autonomous region and avoiding the occurrence of routing loops.
If the link state table of the satellite communication system has old fault information and the fault link corresponding to the information is still in a disconnected state, the fault information still needs to be flooded, and the link connectivity relationship between the current satellite and the 4 neighborhoods of the current satellite is redetected, so that the unification and fusion of the fault information in different areas are ensured.
In the above process, when two nodes that originally have a link failure can continue to interact with Hello data packets, it is proved that the link has recovered to normal, it is necessary to notify the nodes in the autonomous region that the failed link has recovered, change the state of the link in its own link state table, update the route, generate a new link state data packet, and send the link state data packet to all nodes in its to-be-transmitted list.
When the links sending random faults in the link state table of the node are all recovered to be normal, the list to be transmitted of the node, the corresponding information in the link state table and the adjacent matrix need to be cleared, only the information in the time slice is reserved, and the initial state of the satellite node is recovered.
Fig. 9 is a flowchart of an inter-satellite routing survivability method based on link prediction and area partitioning in a preferred embodiment of the present invention, as shown in fig. 9, in an embodiment of the present invention, the method includes:
setting a virtual ID for each satellite according to the operation rule of the satellite, and constructing a virtual topological structure;
time slice division is carried out based on the interval of the intermittent link to update the periodic fault link in advance;
in the real-time process, whether a satellite link has a random fault needs to be judged, and if the satellite link has the random fault, whether the random fault occurs in an inter-orbit link needs to be judged;
if the random fault occurs in the inter-orbit link, the satellite node with the link fault can perform regional broadcast to all satellites in the same orbit to update the random link fault;
if the random fault does not occur in the inter-orbit link, the surface random fault occurs in the intra-orbit link, at the moment, whether the satellite node is in the polar region or not needs to be continuously judged, if the satellite node is in the polar region, the link fault is directly updated, and if the satellite node is not in the polar region, the satellite node with the link fault can carry out single-picking flooding and regional fusion to the neighbor node of the satellite node to update the random link fault.
Fig. 10 is a flowchart of an inter-satellite routing survivability method based on link prediction and area partitioning in another preferred embodiment of the present invention, as shown in fig. 10, in an embodiment of the present invention, the method includes:
satellite initialization configuration, namely setting a virtual ID number according to the position of a satellite node in a satellite topology;
the hello data packet of an OSPF protocol is adopted among the satellites to maintain the contact between the satellites and the neighbor satellites, and the communication among the satellites is ensured;
according to the rule of satellite operation, time division is carried out on the topology of the satellite network, and the last time information is passed through a gateway station;
the satellite node judges whether the satellite node is in an polar region according to the link state, if so, a routing table with the shortest path is generated according to the link state table to obtain a next-hop satellite, and if not, the satellite node is directly judged whether the link fails;
if the link failure occurs, flooding the affected satellite nodes according to the position of the link failure to determine the area affected by the on-off, and ending the flooding; and updating the flooding information into a link state table of the satellite, generating a routing table with the shortest path, and obtaining the next hop satellite.
And if no link fault occurs, directly obtaining the next hop satellite according to the Manhattan shortest algorithm.
In the description of the present invention, it is to be understood that the terms "coaxial", "bottom", "one end", "top", "middle", "other end", "upper", "one side", "top", "inner", "outer", "front", "center", "both ends", and the like, indicate orientations or positional relationships based on those shown in the drawings, and are only for convenience of description and simplicity of description, and do not indicate or imply that the devices or elements referred to must have a particular orientation, be constructed and operated in a particular orientation, and thus, are not to be construed as limiting the present invention.
In the present invention, unless otherwise expressly stated or limited, the terms "mounted," "disposed," "connected," "fixed," "rotated," and the like are to be construed broadly, e.g., as meaning fixedly connected, detachably connected, or integrally formed; can be mechanically or electrically connected; the terms may be directly connected or indirectly connected through an intermediate, and may be communication between two elements or interaction relationship between two elements, unless otherwise specifically limited, and the specific meaning of the terms in the present invention will be understood by those skilled in the art according to specific situations.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.

Claims (8)

1. An inter-satellite route anti-destruction method based on link prediction and area division, characterized in that the method comprises:
when the satellite has periodic faults, namely the faults occur in an inter-orbit link and the satellite is in a polar region, determining a fault recovery period based on the on-off rule of the link, and updating the fault link in advance;
when a satellite has a random fault, performing autonomous area division according to the position of the fault, and executing a route anti-destruction strategy; if the fault occurs in the inter-orbit link and the satellite is not in the polar region, the fault satellite performs single-hop flooding and regional fusion to the own neighbor satellite; if a failure occurs in an in-orbit link and whether or not the satellite is in a polar region, the failed satellite broadcasts the region to all satellites in the same orbit.
2. The inter-satellite route survivable method based on link prediction and area division according to claim 1, characterized in that before determining that the satellite has a periodic failure or/and a random failure, it further comprises setting a virtual ID for each satellite, wherein the virtual ID comprises an orbit number and an in-orbit number of the satellite; and constructing a virtual topological structure according to the virtual IDs, and dividing the link relation of the satellite into an inter-orbit link or/and an intra-orbit link according to the virtual IDs of all the satellites.
3. The method as claimed in claim 1, wherein the link-based on-off law determines a failure recovery period, the updating of the failed link in advance includes determining a period of the intermittent link according to a rule of satellite operation, slicing the system period to form discrete and limited time slices, and determining a time slice corresponding to the period of the intermittent link, when the satellite is in a previous time slice of the time slices corresponding to the period of the intermittent link, discarding a subsequent time slice corresponding to the period of the intermittent link, and reserving a time slice when the satellite enters the polar region, i.e., the previous time slice.
4. The inter-satellite routing survivable method based on link prediction and area division according to claim 1, wherein when a satellite has a random failure, performing autonomous area division according to the location of the failure comprises judging whether the location of the satellite having the random failure is an inter-orbit link or/and an intra-orbit link, and if the random failure occurs in the intra-orbit link, dividing the current satellite and the satellite in the same orbit into autonomous areas; if the random fault occurs in the inter-orbit link, all the neighborhood satellites of the current satellite and the opposite-end satellite with the inter-orbit link fault are divided into autonomous areas.
5. The method according to claim 4, wherein the performing of the route survivability strategy comprises calculating a direction value L of the current satellite S (m, n) in its 4-neighborhood according to the connectivity of the satellite and its neighboring satellitesx+(m,n)，Lx-(m,n)，Ly+(m,n)，Ly-(m, n), calculating the first direction L (m, n) of the current satellite by summing the direction values of the 4 neighborhoods, and obtaining the second direction L by multiplying the direction values of the 4 neighborhoods*(m, n); judging the degree of link failure of the current satellite according to the first direction degree and the second direction degree, and if all links of the current satellite and the 4 adjacent satellites are failed, namely L*If (m, n) is 0 and L (m, n) is 0, the neighbor satellite of the current satellite sends the anti-crash request packet instead; if partial link between the current satellite and the 4 adjacent satellites is in failure, L is*If (m, n) ═ 0 and L (m, n) ≠ 0, the current satellite transmits an anti-crash request packet according to the position where the link failure occurred.
Wherein L isx+(m, n) represents the direction of the current satellite (m, n) from its right neighborhood satellite (m +1, n), Lx-(m, n) represents the direction degree of the current satellite (m, n) and its left-adjacent satellite (m-1, n), Ly+(m, n) represents the direction of the current satellite (m, n) and its neighboring satellite (m, n +1), Ly-(m, n) represents the direction of the current satellite (m, n) and its next neighbor (m, n-1).
6. The method of claim 5, wherein if the fault occurs in the inter-orbit link and the satellite is not in the polar region, the faulty satellite performs one-hop flooding and regional fusion to its neighboring satellite, including if the link between the current satellite and its left and right neighboring satellites has an inter-orbit link fault, that is, if L is Lx+(m, n) 0 or Lx-If (m, n) is 0, performing single-hop flooding and regional fusion from the current satellite to the own neighbor satellite; when the inter-orbit link fails, single-hop flooding is carried out, namely the current satellite and the opposite-end satellite respectively go to all neighbors in the autonomous regionThe star sends a link state data packet; the neighbor satellite receiving the link state data packet judges whether the link state data packet has link fault, if the link fault does not occur, the link state data packet is analyzed, whether the analyzed inter-orbit link fault exists or not is judged, if the analyzed inter-orbit link fault does not exist, the link state data packet is added into a link state table of the neighbor satellite, an adjacency matrix used for route updating is generated, a D algorithm is executed according to the adjacency matrix to calculate the shortest path, a route table is updated, whether links parallel to the failed inter-orbit link exist or not is detected by all satellites in the autonomous region, if the links exist, region fusion is carried out, namely all satellites related to the links carry out information interaction, the other side is added into a waiting list of the neighbor satellite, and when the waiting list is not empty, flooding is carried out according to the satellites in the waiting list.
7. The method according to claim 6, wherein when the link between the current satellite and the opposite-end satellite with the inter-orbit link failure recovers, the current satellite and the opposite-end satellite respectively send updated link state data packets to all neighboring satellites in the autonomous region, and send the link state data packets to all satellites in the waiting list.
8. The method of claim 5, wherein the area broadcasting to all satellites in the same orbit by the failed satellite if the failure occurs in the in-orbit link and whether the satellite is in the polar region or not comprises the in-orbit link failure if the link between the current satellite and the satellites in the left and right neighborhoods, that is, if L is Ly+(m, n) 0 or Ly-If (m, n) is 0, the current satellite broadcasts the area to all the satellites in the same orbit; the current satellite and the opposite-end satellite which have link failure in the orbit respectively send link state data packets to all the neighbor satellites in the autonomous region, the neighbor satellites which receive the link state data packets judge whether the link failure occurs in the neighbor satellites, if the link failure does not occur, the link state data packets are analyzed, and the judgment and the solution are carried outAnd if the analyzed intra-rail link fault does not exist, adding the intra-rail link fault into a link state table of the intra-rail link fault, generating an adjacent matrix for updating the route, executing a D algorithm according to the adjacent matrix to calculate the shortest path, and updating the route table.
CN202111492195.2A 2021-12-08 2021-12-08 Inter-satellite route survivability method based on link prediction and region division Active CN114039655B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111492195.2A CN114039655B (en) 2021-12-08 2021-12-08 Inter-satellite route survivability method based on link prediction and region division

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111492195.2A CN114039655B (en) 2021-12-08 2021-12-08 Inter-satellite route survivability method based on link prediction and region division

Publications (2)

Publication Number Publication Date
CN114039655A true CN114039655A (en) 2022-02-11
CN114039655B CN114039655B (en) 2023-07-25

Family

ID=80146460

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111492195.2A Active CN114039655B (en) 2021-12-08 2021-12-08 Inter-satellite route survivability method based on link prediction and region division

Country Status (1)

Country Link
CN (1) CN114039655B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023241392A1 (en) * 2022-06-15 2023-12-21 华为技术有限公司 Failure processing method and device for satellite communication
CN117278110A (en) * 2023-11-20 2023-12-22 上海卫星互联网研究院有限公司 Island satellite processing method, device and equipment of satellite network

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5602838A (en) * 1994-12-21 1997-02-11 Lucent Technologies Inc. Global multi-satellite network
CN101459946A (en) * 2008-12-12 2009-06-17 南京邮电大学 Satellite network reliable routing method based on virtual nodes
US20100039984A1 (en) * 1996-12-06 2010-02-18 Brownrigg Edwin B Systems and methods for facilitating wireless network communication, satellite-based wireless network systems, and aircraft-based wireless network systems, and related methods
CN104079496A (en) * 2014-07-02 2014-10-01 南京邮电大学 Double-deck satellite load balancing method based on link cost conversion
US20160080072A1 (en) * 2014-09-17 2016-03-17 Iridium Satellite Llc Satellite communications networking
US20180084476A1 (en) * 2016-09-17 2018-03-22 Hughes Network Systems, Llc Radio resource management and routing for fixed data circuits in an ngso satellite data communications system
US20190182148A1 (en) * 2017-12-12 2019-06-13 Mastercard International Incorporated Transparent satellite routing system and method
CN110336751A (en) * 2019-07-26 2019-10-15 南京邮电大学 Low-track satellite network routing policy based on membership function
CN112351469A (en) * 2020-09-23 2021-02-09 北京遥测技术研究所 Route optimization method based on inter-satellite link
CN112468206A (en) * 2020-10-20 2021-03-09 清华大学 Partition-based constellation satellite network distributed routing method and device
CN112821940A (en) * 2021-01-15 2021-05-18 重庆邮电大学 Satellite network dynamic routing method based on inter-satellite link attribute
CN113067625A (en) * 2021-03-17 2021-07-02 西安电子科技大学 Satellite network multi-service QoS routing method based on region division
CN113489528A (en) * 2021-07-05 2021-10-08 北京理工大学 Self-adaptive survivability method suitable for inter-satellite routing

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5602838A (en) * 1994-12-21 1997-02-11 Lucent Technologies Inc. Global multi-satellite network
US20100039984A1 (en) * 1996-12-06 2010-02-18 Brownrigg Edwin B Systems and methods for facilitating wireless network communication, satellite-based wireless network systems, and aircraft-based wireless network systems, and related methods
CN101459946A (en) * 2008-12-12 2009-06-17 南京邮电大学 Satellite network reliable routing method based on virtual nodes
CN104079496A (en) * 2014-07-02 2014-10-01 南京邮电大学 Double-deck satellite load balancing method based on link cost conversion
US20160080072A1 (en) * 2014-09-17 2016-03-17 Iridium Satellite Llc Satellite communications networking
US20180084476A1 (en) * 2016-09-17 2018-03-22 Hughes Network Systems, Llc Radio resource management and routing for fixed data circuits in an ngso satellite data communications system
US20190182148A1 (en) * 2017-12-12 2019-06-13 Mastercard International Incorporated Transparent satellite routing system and method
CN110336751A (en) * 2019-07-26 2019-10-15 南京邮电大学 Low-track satellite network routing policy based on membership function
CN112351469A (en) * 2020-09-23 2021-02-09 北京遥测技术研究所 Route optimization method based on inter-satellite link
CN112468206A (en) * 2020-10-20 2021-03-09 清华大学 Partition-based constellation satellite network distributed routing method and device
CN112821940A (en) * 2021-01-15 2021-05-18 重庆邮电大学 Satellite network dynamic routing method based on inter-satellite link attribute
CN113067625A (en) * 2021-03-17 2021-07-02 西安电子科技大学 Satellite network multi-service QoS routing method based on region division
CN113489528A (en) * 2021-07-05 2021-10-08 北京理工大学 Self-adaptive survivability method suitable for inter-satellite routing

Non-Patent Citations (6)

* Cited by examiner, † Cited by third party
Title
CHUAN XU: "Link Reliability-Based Adaptive Routing for Multilevel Vehicular Networks", 《 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY ( VOLUME: 69, ISSUE: 10, OCTOBER 2020)》 *
JIAN ZHOU: "Routing Strategy for LEO Satellite Networks Based on Membership Degree Functions", 《SECURITY AND COMMUNICATION NETWORKS》 *
YUANCAO LV: "Research of Adaptive Routing Scheme for LEO Network", 《2019 IEEE 5TH INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATIONS (ICCC)》 *
李冬妮,王光兴: "LEO/MEO卫星网络中的一种新型分布式动态路由算法", 《小型微型计算机系统》 *
郝选文: "空间信息网抗毁路由及网络防攻击技术研究", 《中国博士学位论文全文数据库信息科技辑》 *
韩珍珍: "基于时延的LEO卫星网络SDN控制器动态放置方法", 《通信学报》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023241392A1 (en) * 2022-06-15 2023-12-21 华为技术有限公司 Failure processing method and device for satellite communication
CN117278110A (en) * 2023-11-20 2023-12-22 上海卫星互联网研究院有限公司 Island satellite processing method, device and equipment of satellite network
CN117278110B (en) * 2023-11-20 2024-02-02 上海卫星互联网研究院有限公司 Island satellite processing method, device and equipment of satellite network

Also Published As

Publication number Publication date
CN114039655B (en) 2023-07-25

Similar Documents

Publication Publication Date Title
CN111211828B (en) Inter-satellite routing method and device for low earth orbit communication satellite constellation
CN111953399B (en) Inter-satellite routing method in low-earth-orbit satellite communication network
Bellur et al. A reliable, efficient topology broadcast protocol for dynamic networks
JP6535387B2 (en) Self-organizing network concept for small cell backhaul
JP5584360B2 (en) Situation-aware adaptive switching in reconfigurable low earth orbit satellite networks
Xiaogang et al. A survey of routing techniques for satellite networks
CN114039655B (en) Inter-satellite route survivability method based on link prediction and region division
US8064377B2 (en) Method for enhancement of multicasting forwarding protocol in a wireless network
Sharma et al. Topological Broadcasting Using Parameter Sensitivity-Based Logical Proximity Graphs in Coordinated Ground-Flying Ad Hoc Networks.
CN111416655A (en) Low-orbit satellite routing improvement method based on virtual topology
CN106656302A (en) Distributed node self-adaptive routing algorithm for LEO satellite network
Dong et al. Load balancing routing algorithm based on extended link states in LEO constellation network
Feng et al. Elastic resilience for software-defined satellite networking: Challenges, solutions, and open issues
CN114584226B (en) Low-energy-consumption high-throughput underwater acoustic break delay tolerant network communication method
Huang et al. An adaptive multipath routing for LEO satellite network
CN114938235B (en) Satellite network data transmission method and device integrating multipath and network coding
CN114222345B (en) Routing path calculation method, device, electronic equipment and storage medium
CN114553298B (en) Routing method based on clustering in multi-layer satellite network
CN114513241B (en) SDN-based high-performance QoS guaranteed low-orbit satellite inter-satellite routing method
CN108011661A (en) A kind of satellite network route oscillation suppressing method and system
Page et al. Distributed probabilistic congestion control in LEO satellite networks
Lu et al. Quick routing response to link failure in low-earth orbit satellite networks
Di et al. A new routing algorithm of two-tier LEO/MEO mobile satellite communication systems
Fang et al. Research on multi-orbit hybrid satellite network routing algorithm based on detection and self-learning
CN112910543B (en) Method for realizing double-layer satellite routing mechanism with delay tolerance and disconnection tolerance

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
GR01 Patent grant
GR01 Patent grant