CN113489525A - Routing method for LEO satellite constellation - Google Patents

Routing method for LEO satellite constellation Download PDF

Info

Publication number
CN113489525A
CN113489525A CN202110372132.7A CN202110372132A CN113489525A CN 113489525 A CN113489525 A CN 113489525A CN 202110372132 A CN202110372132 A CN 202110372132A CN 113489525 A CN113489525 A CN 113489525A
Authority
CN
China
Prior art keywords
satellite
data packet
frame
routing
route
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
Application number
CN202110372132.7A
Other languages
Chinese (zh)
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.)
China Academy of Space Technology CAST
Original Assignee
China Academy of Space Technology CAST
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 China Academy of Space Technology CAST filed Critical China Academy of Space Technology CAST
Priority to CN202110372132.7A priority Critical patent/CN113489525A/en
Publication of CN113489525A publication Critical patent/CN113489525A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/14Relay systems
    • H04B7/15Active relay systems
    • H04B7/185Space-based or airborne stations; Stations for satellite systems
    • H04B7/1853Satellite systems for providing telephony service to a mobile station, i.e. mobile satellite service
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/14Relay systems
    • H04B7/15Active relay systems
    • H04B7/185Space-based or airborne stations; Stations for satellite systems
    • H04B7/1853Satellite systems for providing telephony service to a mobile station, i.e. mobile satellite service
    • H04B7/18558Arrangements for managing communications, i.e. for setting up, maintaining or releasing a call between stations
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/24Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248Connectivity 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)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Radio Relay Systems (AREA)

Abstract

The invention relates to a routing method for LEO satellite constellation, wherein (1) a routing table is set on the ground and is solidified in all satellite nodes in advance; in the routing table of each satellite node, a plurality of routes are available between the satellite and each other satellite; (2) after the satellite node receives the data packet, firstly reading a frame header, and judging whether the format of the data packet is wrong or not according to the frame header; (3) inquiring a corresponding satellite output port in a forwarding table according to the inquired route; (4) judging the connection state of an inter-satellite link where a satellite output port is located according to the connection state of the inter-satellite link in a topology table periodically updated by the satellite, wherein the connection state comprises normal communication and abnormal communication; if the communication is normal, the survival time of the data packet is reduced by 1, the data packet is sent to the satellite output port, then the next data packet is continuously received, if the communication is abnormal, whether an unused new route exists in the routing table is judged, if yes, the new route is inquired again from the routing table, the step (3) is returned, and if not, the data packet is discarded.

Description

Routing method for LEO satellite constellation
Technical Field
The invention relates to a routing method for an LEO satellite constellation, belonging to the technical field of routing design of low-orbit satellite constellation networking.
Background
In recent years, Low Earth Orbit (LEO) mobile communication satellite constellation has become an important development direction in the field of satellite communication. LEO satellites have a low orbital height and a short orbital period compared to medium and high orbit satellites, and thus can provide users with high-speed connections with low time delay (compared to high orbit communication satellites), and the famous low orbit communication satellites include Iridium-Next, OneWeb, Startlink and the like. Under the push of a low-earth-orbit communication satellite system with the characteristics of broadband, large capacity, low delay, global coverage and the like, inter-satellite links and satellite networks gradually become research hotspots. LEO satellites can be interconnected together through inter-satellite links to form a space communication network (hereinafter referred to as a satellite network) with the satellites as switching nodes.
Compared with the ground network, the current satellite network starts late, and to realize low-orbit satellite networking, the routing design problem of the satellite network must be solved firstly, and the routing design of the satellite network cannot carry the routing technology widely used by the current ground network, because the satellite network is obviously different from the ground network:
(1) compared with ground hardware equipment, the satellite processor has limited computing capability and storage resources, and if high-complexity routing calculation is required to be carried out in real time, a large amount of software and hardware resources on the satellite are consumed.
(2) Because the LEO satellite moves around the earth at a high speed, inter-satellite links can change along with the LEO satellite, the inter-satellite links are frequently switched, the topological structure of a satellite network changes frequently, and the effective routing time is short.
(3) Compared with a ground network, the inter-satellite link of the satellite network has the advantages of small bandwidth, long transmission distance, long time delay and high error rate.
(4) The distribution of the load data flow is not balanced, and the satellite network gateway node connected with the ground gateway is easy to generate link congestion.
Given the multiple gateway stations of a satellite network, existing centralized routing techniques are not applicable to LEO satellite constellations. The existing distributed routing technology also requires that topology information is frequently flooded or synchronized in a satellite network, and on one hand, precious bandwidth resources of the satellite network need to be occupied. On the other hand, the synchronization of the topology information of the whole network and the rapid convergence of the routing algorithm are difficult to achieve due to the restriction of frequent change of the topology structure of the satellite network.
Based on the above restriction factors, the routing design of the LEO satellite constellation networking has no mature experience to follow.
Disclosure of Invention
The technical problem solved by the invention is as follows: the method is a brand new routing method, and is suitable for networks such as LEO satellite constellations in which the positions of nodes periodically move and the connection between the nodes periodically changes along with the positions of the nodes.
The technical scheme of the invention is as follows: a routing method for LEO satellite constellation includes the following steps:
(1) the routing table is set on the ground and is solidified in all the satellite nodes in advance; in the routing table of each satellite node, a plurality of routes are available between the satellite and each other satellite;
(2) after receiving the data packet, the satellite node firstly reads the frame header, judges whether the format of the data packet is wrong or not according to the frame header, if so, discards the data packet, if so, judges whether the destination satellite address in the frame header is the address of the satellite, if so, further judges the frame type in the frame header, and the frame type comprises: a service frame, a signaling frame and a frame not belonging to any frame; if the frame type is a service frame, sending the data packet to a downlink; if the frame type is a signaling frame, sending the signaling frame to a CPU of the satellite; if the frame type is not any frame, discarding the data packet; if not, judging whether the survival time of the data packet is 0, if so, discarding the data packet and continuing to receive the next data packet, if not, further reading a routing mark in the frame header and inquiring a corresponding route in a routing table corresponding to the current time;
(3) inquiring a corresponding satellite output port in a forwarding table according to the inquired route;
(4) judging the connection state of an inter-satellite link where a satellite output port is located according to the connection state of the inter-satellite link in a topology table periodically updated by the satellite, wherein the connection state comprises normal communication and abnormal communication; if the communication is normal, the survival time of the data packet is reduced by 1, the data packet is sent to the satellite output port, then the next data packet is continuously received, if the communication is abnormal, whether an unused new route exists in the routing table is judged, if yes, the new route is inquired again from the routing table, the step (3) is returned, and if not, the data packet is discarded.
Preferably, the corresponding route is queried, i.e. the next hop satellite address is queried.
Preferably, the routing table is solidified in EEPROM or FLASH of all satellite nodes in advance.
Compared with the prior art, the invention has the advantages that:
(1) the routing table is calculated in advance by a ground system control center and uploaded to all satellite nodes, and each node automatically executes the routing table, so that the routing table belongs to static routing, the calculation of a routing algorithm is prevented from occupying satellite resources, and topology information is prevented from synchronously occupying satellite network bandwidth among constellations;
(2) the routing table of the invention contains a plurality of routing options, and the satellite node can flexibly select the optimal route according to the link connection state when the data packet is routed, thereby bypassing the congested or failed link and having the attribute of dynamic route.
(3) The invention is a brand new routing method, which is suitable for a network such as LEO satellite constellation in which the positions of nodes periodically move and the connection between the nodes periodically changes along with the positions of the nodes.
Drawings
FIG. 1 is a schematic diagram of a low earth orbit satellite constellation;
FIG. 2 is a schematic diagram of a ground network for a constellation of low earth orbit satellites;
FIG. 3 is a schematic representation of the characteristics of a backstitch;
FIG. 4 is a topological representation of a typical 9 satellite node;
FIG. 5 is a schematic diagram of a single routing table format within a certain time slice, for example, in the case of satellite node 1;
FIG. 6 is a diagram of an exemplary routing configuration mapping table;
FIG. 7 is a diagram of an exemplary packet format;
FIG. 8 is a diagram illustrating the detection of a typical 9 satellite node;
fig. 9 is a schematic diagram of a processing flow of a satellite node for a data packet.
Detailed Description
The invention is described in further detail below with reference to the figures and specific embodiments.
The invention relates to a routing method for LEO satellite constellation, wherein (1) a routing table is set on the ground and is solidified in all satellite nodes in advance; in the routing table of each satellite node, a plurality of routes are available between the satellite and each other satellite; (2) after receiving the data packet, the satellite node firstly reads the frame header, judges whether the format of the data packet is wrong or not according to the frame header, if so, discards the data packet, if so, judges whether the destination satellite address in the frame header is the address of the satellite, if so, further judges the frame type in the frame header, and the frame type comprises: a service frame, a signaling frame and a frame not belonging to any frame; if the frame type is a service frame, sending the data packet to a downlink; if the frame type is a signaling frame, sending the signaling frame to a CPU of the satellite; if the frame type is not any frame, discarding the data packet; if not, judging whether the survival time of the data packet is 0, if so, discarding the data packet and continuing to receive the next data packet, if not, further reading a routing mark in the frame header and inquiring a corresponding route (namely a next hop satellite address) in a routing table corresponding to the current time; (3) inquiring a corresponding satellite output port in a forwarding table according to the inquired route; (4) judging the connection state of an inter-satellite link where a satellite output port is located according to the connection state of the inter-satellite link in a topology table periodically updated by the satellite, wherein the connection state comprises normal communication and abnormal communication; if the communication is normal, the survival time of the data packet is reduced by 1, the data packet is sent to the satellite output port, then the next data packet is continuously received, if the communication is abnormal, whether an unused new route exists in the routing table is judged, if yes, the new route is inquired again from the routing table, the step (3) is returned, and if not, the data packet is discarded.
For LEO satellites, the satellite orbit and constellation arrangement are determined, each satellite generally has 4 intersatellite links, and the whole network is in a mesh topology structure. The main characteristics of the satellite network and the restriction factors on the route design are as follows: (1) the satellite processor has limited computing capacity and storage resources; (2) the network topological structure changes dynamically, and the link switching is frequent; (3) the effective time of the route is short, the transmission time of the link is prolonged, and the error rate is high.
Therefore, the routing design of the satellite network cannot carry the routing technology widely used by the existing ground network, and no mature experience can be followed. The present invention aims to solve the above problems.
The invention relates to a routing method for an LEO satellite constellation, which preferably comprises the following steps:
(1) the routing table is set on the ground and is solidified in all the satellite nodes in advance; in the routing table of each satellite node, a plurality of routes are available between the satellite and each other satellite;
(2) after receiving the data packet, the satellite node firstly reads the frame header, judges whether the format of the data packet is wrong or not according to the frame header, if so, discards the data packet, if so, judges whether the destination satellite address in the frame header is the address of the satellite, if so, further judges the frame type in the frame header, and the frame type comprises: a service frame, a signaling frame and a frame not belonging to any frame; if the frame type is a service frame, sending the data packet to a downlink; if the frame type is a signaling frame, sending the signaling frame to a CPU of the satellite; if the frame type is not any frame, discarding the data packet; if not, judging whether the survival time of the data packet is 0, if so, discarding the data packet and continuing to receive the next data packet, if not, further reading a routing mark in the frame header and inquiring a corresponding route in a routing table corresponding to the current time;
(3) inquiring a corresponding satellite output port in a forwarding table according to the inquired route;
(4) judging the connection state of an inter-satellite link where a satellite output port is located according to the connection state of the inter-satellite link in a topology table periodically updated by the satellite, wherein the connection state comprises normal communication and abnormal communication; if the communication is normal, the survival time of the data packet is reduced by 1, the data packet is sent to the satellite output port, then the next data packet is continuously received, if the communication is abnormal, whether an unused new route exists in the routing table is judged, if yes, the new route is inquired again from the routing table, the step (3) is returned, and if not, the data packet is discarded.
And inquiring the corresponding route, namely inquiring the next hop satellite address.
The routing table is solidified in EEPROM or FLASH of all satellite nodes in advance.
Taking a constellation of low earth orbit communication satellites as an example, the constellation is composed of 54 satellites, and has 6 orbital planes, 9 satellites on each orbital plane, and the orbital height is between 600km and 2000km, and for a single satellite, there are 4 inter-satellite links (2 co-orbital links and 2 off-orbital links), as shown in fig. 1. The ground segment network includes a system control center, a gateway station, a measurement and control station, and other ground support networks, the system control center is a control center of the whole network and is responsible for operation and maintenance of the system, the gateway station is responsible for managing network services, and simultaneously, the satellite network is also connected with a ground public network and a mobile network, as shown in fig. 2.
The system control center is provided with a database which can collect, count and analyze the inter-satellite link state parameters of all the satellite nodes, including (but not limited to) the current data flow and the available margin of the communication link, the number of attempts of link call establishment, the link call establishment failure rate and the like. By using the link state parameters, the system control center can optimize and update the route from the source satellite node to the target satellite node.
Fig. 1 is also a topological diagram of inter-satellite links of a satellite network, wherein blue lines are inter-satellite links on the same orbit, and red lines are inter-satellite links on different orbits.
An on-orbit inter-satellite link refers to a link between adjacent satellites in the same orbital plane. The same orbital inter-satellite link remains connected at all times, considering that satellites in the same orbital plane can be considered relatively stationary.
The inter-iso-orbit inter-satellite link is a link between adjacent satellites connecting adjacent orbits, and has the following characteristics:
1) the connection is not fixed: as the satellite moves to a high latitude area, the relative speed between adjacent satellites in different orbits is increased, and the connection is difficult to maintain until 60 degrees north and south latitude, so that the disconnection of a link occurs. After leaving the area with 60 degrees north and south latitude, the connection is established again to form the periodic on-off characteristic.
2) Reverse slots have difficulty establishing links: because the relative motion speed of the inter-satellite link between the two opposite orbits (i.e. the satellites on both sides of the reverse slot) is greater, it is difficult to establish and maintain the inter-satellite link on both sides of the reverse slot.
3) The link delay is constantly changing: the distance between adjacent satellites in different orbits is changed along with the movement of the satellites, and when the satellites are closer to a polar region, the relative distance is shorter, and the link delay is also shorter.
FIG. 3 shows a characteristic diagram of a reverse slot, including inter-satellite link topology and shutdown features.
The low earth orbit constellation is a satellite network with the topological relation of links among satellites changing at any time, but the topological relation changes regularly and periodically and is predictable. Therefore, one period can be divided into N independent topology tables in time, so that the inter-satellite link topology relationship of the whole satellite network is fixed and invariable in each topology table. Each satellite correspondingly has N routing tables in one period and performs periodic switching according to the time when the inter-satellite link topology changes.
In the method of the invention, the topological table is preferably as follows:
FIG. 4 is a typical topology table of 9 satellite nodes, which records the number of inter-satellite links and the connection status of each satellite, and for each satellite, there are at most 4 valid inter-satellite links, "up" represents the inter-satellite links in the flight direction of the satellite, "down" represents the inter-satellite links in the opposite direction of the satellite flight,
"left" represents the left side inter-satellite link of the satellite and "right" represents the right side inter-satellite link of the satellite. The whole network satellite has the same topological table.
The topology table is one of the inputs to the computation of the routing table and does not need to be stored on the satellite.
In the method of the present invention, the preferred scheme of the routing table is as follows:
depending on the topology table and the particular routing algorithm, a routing table can be calculated. The calculation of the routing table is completed by the ground system control center, and is solidified in EEPROM or FLASH of all satellite nodes in advance, and is executed independently by each satellite node. N routing tables of each satellite in one period and N topological tables are in one-to-one correspondence mapping relation.
All satellite nodes have the exact same routing table.
Fig. 5 is a schematic diagram of a format of a single routing table within a certain time slice, taking the satellite node 1 as an example. The routing table contains a source satellite address, a destination satellite address, and a next hop satellite address. In this schematic diagram, the source satellite address is satellite 1; the target satellite addresses are satellite 2 to satellite 54 respectively; the next-hop satellite addresses represent 4 directions of the data packet output by the routing of the satellite 1 by using "up", "down", "left" and "right", and the next-hop satellite addresses corresponding to the 4 directions are used for replacement in actual application, for example, when the satellite 2 is above the satellite 1, the satellite 4 is below, the satellite 3 is on the left, and the satellite 5 is on the right in the topological table, the satellite 2, the satellite 4, the satellite 3 and the satellite 5 are respectively used for replacement in the drawing. When a certain heterotactic link of the satellite 1 is closed (i.e. a reverse slot) or a certain inter-satellite link is permanently failed, the corresponding next-hop satellite address is represented by "NULL". When the data packet arrives at the satellite 1, and the destination satellite address in the data packet is the satellite 1 itself, it indicates that the data packet is sent to the ground station or ground user terminal corresponding to the satellite 1, and the inter-satellite link of the satellite 1 is not taken, so that the routing table does not need to be queried.
In each routing table, a plurality of routes are available from the satellite 1 to each other satellite (namely, a plurality of route configurations including route 1, route 2 and route 3 … … route n exist), and the routes are obtained by calculation through different routing algorithms, such as a classical bellman-ford algorithm, a Dijkstra algorithm and the like, and the algorithms are not limited and can be flexibly customized. This has two major advantages: firstly, the service load can be more effectively balanced; and secondly, the satellite node is allowed to select different paths for routing according to the load or the service type of the satellite node, and the routing is realized through a routing mark in a data packet format.
In the method of the present invention, the preferred scheme of the route configuration mapping table is as follows:
fig. 6 is a mapping table of a typical routing configuration, which is stored in a satellite node storage and can be updated by a system control center to the satellite node. After receiving the data packet, the satellite node inquires the route mark in the data packet and selects a corresponding route for forwarding. The route mark in the figure is 4bits, 16 route configurations can be mapped at most, wherein "0001" represents that route 1 is used, "0010" represents that route 2 is used, "0011" represents that route 3 … … is used, and the like, and "0000" represents a random route, which represents that a packet can randomly use any one of route 1 to route n when being sent from a source end to a destination end. "FFFF" represents a default route, and represents that packets are sent from the source to the destination to be routed according to the priority order of route 1, route 2, and route 3 … ….
All satellite nodes have the same routing configuration mapping table.
In the method of the present invention, the preferred scheme of the forwarding table is as follows:
the forwarding table shows the corresponding relation between the address of the next-hop satellite and the inter-satellite link output from the satellite to the next-hop satellite, and the table is stored in the storage of the satellite node and determines which physical port of the satellite node (satellite-borne router) the data packet is sent out.
The forwarding tables of each satellite node are different.
In the method of the invention, a satellite time slot periodic table can be seen, and the preferred scheme is as follows:
and storing the visible stars of the ground station in the current and previous and next periods, storing the table in a satellite node storage, and acquiring the destination visible star address according to the time slot periodic table when the destination address of the data packet is the ground terminal. The position of the low earth orbit satellite relative to the ground station changes frequently, and the visible satellite periodic table also changes dynamically.
In the method of the present invention, the data packet format, the preferred scheme is as follows:
a typical packet consists of a header and a payload, and is formatted as shown in fig. 7.
1) Frame length: the range is calculated from the frame length, i.e. the length of the whole frame
2) Frame type: packet types such as voice, data, signaling, telemetry, remote, test, etc.
3) Destination address: the destination satellite address.
4) Source address: the source satellite address.
5) Routing mark: the route flag corresponds to a corresponding route.
6) Time to live, TTL: indicating the survival time, hop by 1.
7) Priority: the maximum can be defined as 0-15, 16 grades are totally, and the 0 grade is the highest.
8) Logical channel flag LCN: mapping of beam numbers, frequency numbers, slot numbers, etc. can be achieved.
9) Frame header checking: the error may be checked in a number of ways and discarded if checked.
10) Payload: the variable-length format is adopted, the bytes are 0-1500 bytes variable, various service data are borne, and the payload data are transparently forwarded on the satellite without being analyzed.
The routing interaction of the data packet needs the support of a routing table, a forwarding table and a visible satellite time slot periodic table, so that the complexity of the routing exchange on the satellite is reduced, the storage capacity of the routing table is reduced, the processing workload of a satellite router is reduced, the routing exchange of a low earth orbit satellite system is limited to the routing exchange between the satellites, and the satellite-ground link is shielded through a tunnel mechanism.
In the method of the present invention, the transmission process, the preferred scheme is as follows:
the route exchange process of the data packet comprises a data transmission process from the user terminal to the ground, a data transmission process from the ground to the user terminal and a data transmission process from the user terminal to the user terminal, and the specific processes are as follows:
1) transmission process from user terminal to ground data
The access star receives a data packet sent to the ground terminal by the user terminal, the source address is the user terminal address, the destination address is the ground terminal address, the data packet is packaged in a tunnel according to a tunnel mechanism, the source address of the packaged packet is the access star address, and the destination address is the ground station address.
The data packet is stored and forwarded among the satellites in a hop-by-hop routing mode, on each hop of satellite, the visible satellite of the target ground station at the current time is obtained according to the visible satellite periodic table and is used as the target satellite, the routing table is inquired, the next hop of satellite address is obtained, and the next hop of satellite address is sent to an inter-satellite link through a corresponding port according to the forwarding table. And through hop-by-hop routing, the data packet reaches a target satellite, the data packet is sent to a ground station according to a target ground station address in the packet header, the ground station carries out tunnel decapsulation, and the data packet is sent to a target ground terminal through the ground routing.
And inquiring the visible star periodic table hop by hop to obtain the visible star of the destination ground station, so that the timeliness of the visible star can be ensured.
2) Ground-to-user terminal data transmission process
The ground station receives a data packet of a user terminal sent by the ground terminal, the source address is the ground terminal address, the destination address is the user terminal address, the data packet is packaged in a tunnel according to a tunnel mechanism, the packaged packet source address is the ground station address, and the destination address is the access star address of the user terminal.
The data packet is stored and forwarded between the satellites in a hop-by-hop routing mode, a routing table is inquired on each hop of satellite, a next hop of satellite address is obtained according to a target satellite address, and then the next hop of satellite address is sent to an inter-satellite link through a corresponding port according to a forwarding table. And through hop-by-hop routing, the data packet reaches a target satellite, the data packet is sent to the target satellite according to a target ground station address in the packet header, the target satellite carries out tunnel decapsulation on the data packet, and the data packet is issued to a corresponding user terminal according to a target user terminal address.
3) User terminal-to-user terminal data transmission flow
The access star receives a data packet sent to a user terminal B by a user terminal A, the source address is the address of the user terminal A, the destination address is the address of the user terminal B, the data packet is packaged in a tunnel according to a tunnel mechanism, the source address of the packaged packet is the address of the access star of the user terminal A, and the destination address is the address of the access star of the user terminal B.
The data packet is stored and forwarded among the satellites in a hop-by-hop routing mode, on each hop of satellite, the visible satellite of the target ground station at the current time is obtained according to the visible satellite periodic table and is used as the target satellite, the routing table is inquired, the next hop of satellite address is obtained, and the next hop of satellite address is sent to an inter-satellite link through a corresponding port according to the forwarding table. And through hop-by-hop routing, the data packet reaches the destination satellite, the destination satellite carries out tunnel decapsulation on the data packet, and the data packet is issued to the corresponding user terminal according to the destination user terminal address.
And inquiring the visible star periodic table hop by hop to obtain the visible star of the destination ground station, so that the timeliness of the visible star can be ensured.
In the method of the present invention, the connection status is updated, and the preferred scheme is as follows:
in consideration of the periodicity of the constellation topology, the connection state between the satellites in the topology table in each time period is predictable, but in practical application, the actual connection condition of the inter-satellite link needs to be considered, the connection state includes abnormal phenomena such as communication interruption and communication congestion, the inter-satellite link periodically detects the other side between adjacent satellites to update the connection state of the inter-satellite link, the detection mechanism can use a Hello packet detection mechanism similar to an OSPF protocol, and can also use other handshaking mechanisms for wireless communication, so as to update the connection state of the inter-satellite link in real time.
Fig. 8 is a schematic diagram of a typical 9-satellite node detection, such as satellite 2 periodically handshaking with satellite 1, satellite 8, satellite 3, and satellite 5 to update the state of the four inter-satellite links of satellite 2.
In the method of the present invention, the routing strategy, the preferred scheme is specifically as follows:
the processing flow of the satellite node for the data packet is shown in fig. 9. When a satellite node receives a data packet, firstly reading a frame header, judging whether the format is wrong (such as length, identification bit, checksum and the like), if so, discarding the data packet, and continuously receiving the next data packet, if so, further judging whether a destination satellite address is the satellite, if so, further judging the frame type (such as judging whether the destination satellite address is a service frame sent to a downlink or a signaling frame received by the satellite), and carrying out corresponding operation processing according to different frame types (such as sending the data packet to a downlink module for processing if the destination satellite address is the service frame, sending the data packet to a CPU processor for processing a higher-layer protocol if the destination satellite address is the signaling frame, if not, discarding the data packet), continuously receiving the next data packet, and if not, further judging whether the survival time of the data packet is 0, if yes, discarding the data packet, and continuing to receive the next packet of data packet, if not, further reading the route mark, inquiring a corresponding route (namely a next hop satellite address) in a route table corresponding to the current time, then inquiring a corresponding output port in a forwarding table, judging the connection state of an inter-satellite link where the output port is located according to the inter-satellite link connection state periodically updated by the satellite, if the communication is normal, reducing the survival time of the data packet by 1, sending the data packet to the output port, then continuing to receive the next packet of data packet, and if the communication is abnormal, reselecting a new route. Reselecting a new route, for example, when the route flag is "0000" (random route), reselecting a route at random; when the route flag is "FFFF" (default route), a route one level lower in priority than the previous route is reselected in the priority order of route 1, route 2, and route 3 … ….
The routing table is calculated in advance by a ground system control center and uploaded to all satellite nodes, and each node automatically executes the routing table, so that the routing table belongs to static routing, the calculation of a routing algorithm is prevented from occupying satellite resources, and topology information is prevented from synchronously occupying satellite network bandwidth among constellations; the routing table of the invention contains a plurality of routing options, and the satellite node can flexibly select the optimal route according to the link connection state when the data packet is routed, thereby bypassing the congested or failed link and having the attribute of dynamic route.
The invention is a brand new routing method, which is suitable for a network such as LEO satellite constellation in which the positions of nodes periodically move and the connection between the nodes periodically changes along with the positions of the nodes.

Claims (3)

1. A routing method for a LEO satellite constellation, characterized by the steps of:
(1) the routing table is set on the ground and is solidified in all the satellite nodes in advance; in the routing table of each satellite node, a plurality of routes are available between the satellite and each other satellite;
(2) after receiving the data packet, the satellite node firstly reads the frame header, judges whether the format of the data packet is wrong or not according to the frame header, if so, discards the data packet, if so, judges whether the destination satellite address in the frame header is the address of the satellite, if so, further judges the frame type in the frame header, and the frame type comprises: a service frame, a signaling frame and a frame not belonging to any frame; if the frame type is a service frame, sending the data packet to a downlink; if the frame type is a signaling frame, sending the signaling frame to a CPU of the satellite; if the frame type is not any frame, discarding the data packet; if not, judging whether the survival time of the data packet is 0, if so, discarding the data packet and continuing to receive the next data packet, if not, further reading a routing mark in the frame header and inquiring a corresponding route in a routing table corresponding to the current time;
(3) inquiring a corresponding satellite output port in a forwarding table according to the inquired route;
(4) judging the connection state of an inter-satellite link where a satellite output port is located according to the connection state of the inter-satellite link in a topology table periodically updated by the satellite, wherein the connection state comprises normal communication and abnormal communication; if the communication is normal, the survival time of the data packet is reduced by 1, the data packet is sent to the satellite output port, then the next data packet is continuously received, if the communication is abnormal, whether an unused new route exists in the routing table is judged, if yes, the new route is inquired again from the routing table, the step (3) is returned, and if not, the data packet is discarded.
2. A routing method for a LEO satellite constellation according to claim 1, characterized in that: and inquiring the corresponding route, namely inquiring the next hop satellite address.
3. A routing method for a LEO satellite constellation according to claim 1, characterized in that: the routing table is solidified in EEPROM or FLASH of all satellite nodes in advance.
CN202110372132.7A 2021-04-07 2021-04-07 Routing method for LEO satellite constellation Pending CN113489525A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110372132.7A CN113489525A (en) 2021-04-07 2021-04-07 Routing method for LEO satellite constellation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110372132.7A CN113489525A (en) 2021-04-07 2021-04-07 Routing method for LEO satellite constellation

Publications (1)

Publication Number Publication Date
CN113489525A true CN113489525A (en) 2021-10-08

Family

ID=77932678

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110372132.7A Pending CN113489525A (en) 2021-04-07 2021-04-07 Routing method for LEO satellite constellation

Country Status (1)

Country Link
CN (1) CN113489525A (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113839705A (en) * 2021-10-13 2021-12-24 东方红卫星移动通信有限公司 Inter-satellite and feeder link data packet forwarding method based on interactive label
CN114024594A (en) * 2021-11-09 2022-02-08 北京中科晶上科技股份有限公司 Communication method and device of satellite communication system
CN114500314A (en) * 2021-12-30 2022-05-13 中国电信股份有限公司卫星通信分公司 Method for realizing satellite communication flow statistics according to beam numbers
CN114584200A (en) * 2022-03-02 2022-06-03 西安电子科技大学 Low-orbit satellite network routing method using relationship matrix and link monitoring
CN115442867A (en) * 2022-09-13 2022-12-06 陕西师范大学 On-satellite autonomous routing method and system using low-earth-orbit satellite constellation operation rule
CN117639883A (en) * 2022-08-19 2024-03-01 中国科学院微小卫星创新研究院 Universal data frame format suitable for space communication technology and application thereof
WO2024124173A1 (en) * 2022-12-09 2024-06-13 Cisco Technology, Inc. Communication routing between nodes in a leo satellite network

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012047880A2 (en) * 2010-10-04 2012-04-12 Telcordia Technologies, Inc. A method and system for determination of routes in leo satellite networks with bandwidth and priority awareness and adaptive rerouting
US9094856B1 (en) * 2014-02-25 2015-07-28 Intelligent Fusion Technology, Inc. Routing method for satellite communication network
CN111211828A (en) * 2019-12-23 2020-05-29 东方红卫星移动通信有限公司 Inter-satellite routing method and device for low earth orbit communication satellite constellation
CN111416657A (en) * 2020-03-19 2020-07-14 西安电子科技大学 Satellite network route updating maintenance system and maintenance method
CN112600606A (en) * 2020-12-08 2021-04-02 中国西安卫星测控中心 Method for quickly accessing inter-satellite link node

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012047880A2 (en) * 2010-10-04 2012-04-12 Telcordia Technologies, Inc. A method and system for determination of routes in leo satellite networks with bandwidth and priority awareness and adaptive rerouting
US9094856B1 (en) * 2014-02-25 2015-07-28 Intelligent Fusion Technology, Inc. Routing method for satellite communication network
CN111211828A (en) * 2019-12-23 2020-05-29 东方红卫星移动通信有限公司 Inter-satellite routing method and device for low earth orbit communication satellite constellation
CN111416657A (en) * 2020-03-19 2020-07-14 西安电子科技大学 Satellite network route updating maintenance system and maintenance method
CN112600606A (en) * 2020-12-08 2021-04-02 中国西安卫星测控中心 Method for quickly accessing inter-satellite link node

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
JING LI 等: "A routing algorithm satisfied ground station distribution constraint for satellite constellation network", 《2015 SCIENCE AND INFORMATION CONFERENCE (SAI)》 *
孙知信 等: "卫星网路由算法研究", 《小型微型计算机系统》 *
邢川 等: "基于动静结合方法的卫星网络路由方法研究", 《空间控制技术与应用》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113839705A (en) * 2021-10-13 2021-12-24 东方红卫星移动通信有限公司 Inter-satellite and feeder link data packet forwarding method based on interactive label
CN113839705B (en) * 2021-10-13 2024-02-02 中国星网网络应用有限公司 Inter-satellite and feeder link data packet forwarding method based on interactive labels
CN114024594A (en) * 2021-11-09 2022-02-08 北京中科晶上科技股份有限公司 Communication method and device of satellite communication system
CN114024594B (en) * 2021-11-09 2023-10-20 北京中科晶上科技股份有限公司 Communication method and device of satellite communication system
CN114500314A (en) * 2021-12-30 2022-05-13 中国电信股份有限公司卫星通信分公司 Method for realizing satellite communication flow statistics according to beam numbers
CN114584200A (en) * 2022-03-02 2022-06-03 西安电子科技大学 Low-orbit satellite network routing method using relationship matrix and link monitoring
CN117639883A (en) * 2022-08-19 2024-03-01 中国科学院微小卫星创新研究院 Universal data frame format suitable for space communication technology and application thereof
CN115442867A (en) * 2022-09-13 2022-12-06 陕西师范大学 On-satellite autonomous routing method and system using low-earth-orbit satellite constellation operation rule
WO2024124173A1 (en) * 2022-12-09 2024-06-13 Cisco Technology, Inc. Communication routing between nodes in a leo satellite network

Similar Documents

Publication Publication Date Title
CN113489525A (en) Routing method for LEO satellite constellation
CN111211828B (en) Inter-satellite routing method and device for low earth orbit communication satellite constellation
EP1192555B1 (en) An efficient internet service implementation for mesh satellite networks
CN110493130B (en) Dynamic and static hybrid routing method for heaven-earth integrated network
US7616599B2 (en) Label switched packet transfer base station
US11026231B2 (en) Maintaining and distributing state due to temporary failures in a shared bandwidth network
US20140334378A1 (en) Systems and methods for facilitating wireless network communication, satellite-based wireless network systems, and aircraft-based wireless network systems, and related methods
CN111294108B (en) Efficient routing method for orthogonal circular orbit configuration satellite constellation
CN113347678B (en) 5G constellation route partition control method
EP3340490B1 (en) Routing in a network constituted by satellites linked by two sets of rings in two different geographical orientations, each ring being composed of two ringlets transmitting in opposite directions.
CN111416657A (en) Satellite network route updating maintenance system and maintenance method
JPH1065733A (en) High-speed routing control system
Zhang et al. Aser: Scalable distributed routing protocol for leo satellite networks
CN114070771B (en) Low orbit constellation multicast routing method
CN114158106B (en) Distributed routing method, device and storage medium for satellite network
CN113965246A (en) Application layer route forwarding optimization method based on-satellite UPF
Yu et al. Connection architecture and protocols to support efficient handoffs over an ATM/B-ISDN personal communications network
KR102026641B1 (en) Communication system via the satellite communications network
CN114614883B (en) Dynamic different-orbit complex constellation inter-satellite link routing method
EP0772322A2 (en) System and methods of routing packets through a network with changing topology
He et al. A cross-domain aggregation routing based on lightweight OSPF protocol for the GEO satellite-ground integrated network
Lu et al. Quick routing response to link failure in low-earth orbit satellite networks
CN115412489B (en) Software-defined satellite network southbound interface control method
CN108040346A (en) The highly dynamically automatic relay method of abortive haul network
US20230137047A1 (en) Satellite communication system having primary and secondary neighborhood egress nodes

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20211008

RJ01 Rejection of invention patent application after publication