A task resource pool construction method for large-scale satellite clusters

Abstract

The application provides a task resource pool construction method for a large-scale satellite cluster, belongs to the technical field of aerospace, and is characterized in that, on the basis of abstractly and quantitatively representing required resources of a task and residual resources of each node, a node receiving a task request is taken as a center, communication is performed layer by layer outward, resource information of a participating node is collected, and when the total number of resources of the participating nodes meets the task demand, the search outward is stopped to complete the search of the task resource pool member nodes; the method can make the large-scale satellite cluster have the rapid response capability to deal with sudden tasks, strengthens the autonomous decision-making capability in orbit, and has a wide application prospect.

Description

Technical Field

[0001] This invention belongs to the field of aerospace technology, specifically, it relates to a method for constructing a mission resource pool for large-scale satellite constellations. Background Technology

[0002] Large-scale low Earth orbit satellite constellations possess all-weather, full-coverage characteristics, offering irreplaceable real-time response advantages in fields such as emergency rescue, environmental monitoring, and battlefield reconnaissance. They can rapidly complete observation missions of any target globally and achieve highly stable, low-latency global communication, demonstrating immense development and application potential. Internationally, constellation systems like Starlink have entered the large-scale deployment phase, with thousands of networked satellites launched to date; domestically, related plans are still in the research stage.

[0003] Currently, the operating modes of large-scale satellite constellations can be categorized into three types: space-to-ground network, space-to-ground network, and space-based network. For space-to-ground and space-to-ground network modes, the ground-based network required for operating large-scale satellite constellations places extremely high demands on the number and coverage of ground nodes. In contrast, for space-based network modes, users can achieve end-to-end connections directly through satellites and inter-satellite links, without heavily relying on ground network infrastructure, offering advantages such as independence, security, and resilience. Because space-based networks eliminate dependence on ground infrastructure, they are gradually becoming an important direction for technological evolution, leading to numerous studies, including this invention, on the autonomous execution of tasks by space-based networks.

[0004] Currently, mainstream large-scale satellite constellations possess a certain on-board processing capability. Each node not only has the ability to parse, store, and forward received data packets but can also perform a certain degree of independent computation. However, limited by size and cost, the on-board processing capacity of a single satellite is limited, generally equivalent to the computing level of ground-based embedded devices, making it difficult to complete complex computational tasks. To achieve on-orbit autonomous decision-making and execution for time-sensitive tasks such as emergency response and dynamic game theory, rapid computation of algorithms such as optimization scheduling is essential. The computation process of these algorithms often consumes significant computational and storage resources. One solution is to combine nodes with weaker processing capabilities into a resource pool, where resources are shared. This resource pool, as a whole, possesses higher processing capabilities. This method not only overcomes the performance bottleneck of a single satellite but also allows for the construction of dedicated task resource pools based on the characteristics of different missions. Summary of the Invention

[0005] This invention addresses the shortcomings of existing technologies by proposing a method for constructing a mission resource pool for large-scale satellite constellations, based on data packet communication mechanisms and constellation mesh topology. This method establishes a mission resource pool that matches mission requirements, ensuring that all resources within the pool meet those requirements. This approach enables satellite constellations to respond rapidly to unexpected missions, enhances on-orbit autonomous decision-making capabilities, and has broad application prospects.

[0006] This invention is achieved through the following technical solution:

[0007] A method for constructing a mission resource pool for large-scale satellite constellations: The method specifically includes the following steps:

[0008] Step 1: Initialize the search, starting from the central node satellite and extending outwards to the surrounding layers. Each of the communicable satellites sends a request data packet A;

[0009] Step 2: The node that receives the request packet responds by searching and checking the remaining resources, level. l Each star parses data packet A upon receiving it and allocates its remaining resources accordingly. and participation lower limit The comparison is performed, and a response data packet B is returned to the central node satellite.

[0010] Step 3: Integrate resources at the central node satellite;

[0011] Step 4: Determine whether to terminate at the central node satellite.

[0012] Step 5, at the central node satellite, for all N The coordinates and resource status of satellites participating in the construction of the mission resource pool are summarized, and nodes that meet the total resources required for the mission are selected from all response nodes to form the mission resource pool.

[0013] Furthermore, the information contained in the request data packet A is: the coordinates of the center node. Target node coordinates Nodes participate in building the lower limit of remaining resources and the types of resources required;

[0014] The response data packet B contains the following information: source node coordinates. Target node coordinates Remaining resources of nodes Whether or not it participates in the construction of the identifier T / F.

[0015] Furthermore, define the hierarchy of each node relative to the central node. for:

[0016] (4)

[0017] A single satellite node can directly communicate with at most four surrounding satellite nodes: adjacent nodes in the same orbit, nodes in adjacent orbits that are close to each other, and so on. l The total number of satellites in the layers is 4 l .

[0018] Further, in step 1,

[0019] initial ;when When this happens, a path must be constructed in advance from the central node satellite to the target satellite with the minimum number of forwardings to reduce the probability of communication failure; secondly, communication latency should be considered, and among path schemes with the same number of forwardings, the path with the shortest expected time should be selected.

[0020] Furthermore, in step 2,

[0021] own remaining resources Participation minimum Total resources required for the task All are represented in set form;

[0022] when ,Right now All elements of the set are greater than When the corresponding element is found, the node is considered to meet the conditions for participating in the construction; a response data packet B is returned to the central node satellite, in which the construction flag is T;

[0023] when If the node does not meet the conditions for participating in the construction, it returns a response data packet B to the central node satellite, with the construction flag being F.

[0024] Furthermore, in step 3,

[0025] Each time the central node satellite receives a response data packet B, it has received... l Number of data packets returned by the layer satellite ,initial And make the following judgment:

[0026] Record the current total resources in the pool as... ;

[0027] When the identifier is T, it indicates the total number of nodes in the current pool. ,initial ;

[0028] When the identifier is F, the above calculation is not performed.

[0029] Furthermore, in step 4,

[0030] like ,Right now All elements of the set are greater than When the corresponding element is found, it is assumed that the various resources in the pool have met the computing task requirements, and the search ends directly, proceeding to step 5, resource pool construction.

[0031] like Further judgment:

[0032] If the current layer does not respond completely, i.e. If so, the central node satellite continues to wait for data packet B returned by the remaining satellites in that layer, and then returns to step 3;

[0033] If the current layer has responded to all requests. Then the next level of search must be performed, returning to step 1 and letting , .

[0034] A system for constructing mission resource pools for large-scale satellite constellations:

[0035] The system includes an initialization module, a response module, an integration and judgment module, and a resource pool construction module;

[0036] The initialization module uses the central node satellite as the basis for the surrounding layers. Each of the communicable satellites sends a request data packet A;

[0037] The response module receives the request packet from the node and checks the remaining resources, hierarchy. l Each star parses data packet A upon receiving it and allocates its remaining resources accordingly. and participation lower limit The comparison is performed, and a response data packet B is returned to the central node satellite.

[0038] At the central node satellite, the integration and judgment module performs resource integration to determine whether to terminate the search.

[0039] The central node satellite uses the resource pool construction module to access all... N The coordinates and resource status of satellites participating in the construction of the mission resource pool are summarized, consensus is reached among the nodes, the mission resource pool is formed, and the mission is launched.

[0040] An electronic device includes a memory and a processor, the memory storing a computer program, the processor executing the computer program to implement the steps of the above method.

[0041] A computer-readable storage medium for storing computer instructions that, when executed by a processor, implement the steps of the above-described method.

[0042] Beneficial effects of the invention

[0043] Based on the abstract and quantitative representation of the resources required for the task and the remaining resources of each node, this invention communicates outward layer by layer with the node that receives the task request as the center, collects resource information of participating nodes, and stops searching outward when the total number of participating node resources meets the task requirements, thus completing the search of member nodes of the task resource pool.

[0044] The method of this invention can, under reasonable conditions, complete the construction of the mission resource pool for large-scale satellite constellations, ensuring that the total resources of each node meet the various resource requirements of the mission, and improving the ability of large-scale satellite constellations to autonomously complete missions.

[0045] This method has the following advantages:

[0046] (1) This method is simple and easy to implement. The construction process has a low number of communication forwardings, short time consumption, and small data packet size, and has good stability and reliability.

[0047] (2) The member satellite nodes searched by this method are concentrated around the central node, so the communication latency of each node is low and the reliability is high, which can achieve high task execution efficiency;

[0048] (3) The method can be modified or expanded according to the actual situation, such as changing the resource type required by the task, or continuing to search outwards to improve resource redundancy. Attached Figure Description

[0049] Figure 1 This is a schematic diagram of the topology of the present invention.

[0050] Figure 2 This is a flowchart of the method of the present invention.

[0051] Figure 3 for Layer search results.

[0052] Figure 4 for Layer search results.

[0053] Figure 5 Search for the final result for member nodes ( ). Detailed Implementation

[0054] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0055] Unless otherwise specified, the experimental methods used in the following examples are conventional methods. Unless otherwise specified, the materials, reagents, methods, and instruments used are all conventional materials, reagents, methods, and instruments in the art, and can be obtained commercially by those skilled in the art.

[0056] This invention considers the task type as a computational task, involving the computational and storage resources of nodes, and makes the following assumptions:

[0057] (1) The application targets are uniform Walker constellations with the same orbital altitude and similar resource capabilities of each node;

[0058] (2) Since the search method is essentially a process of sending and receiving data packets and comparing them, it is believed that the central node satellite has sufficient capability to complete the search of the member nodes of the mission resource pool;

[0059] (3) Communication between the satellite nodes involved is good;

[0060] (4) During the time consumed by searching for members of the mission resource pool, the satellite network topology can be approximately maintained as follows: Figure 1 The diagram shows a mesh structure. Due to limitations in inter-satellite distance and relative velocity, a single node can directly communicate with at most four surrounding satellite nodes: adjacent nodes in the same orbit, nodes in adjacent orbits that are close to each other, and nodes in adjacent orbits that are near each other.

[0061] (5) The number of satellite nodes required for this computing task is relatively small (no more than 50).

[0062] (6) For the computation task, it is assumed that the remaining resources of each node have been used. ( i (Referring to a specific node) Total resources required for the task Abstract quantitative representation of.

[0063] , Represented as a set as follows:

[0064] (1)

[0065] (2)

[0066] in C (CPU) represents the amount of computing resources. M (Memory) represents the amount of memory resources. D (Disk) represents the amount of storage resources.

[0067] In addition, each node may have some resources consumed by other tasks, leaving insufficient resources to support its participation in the resource pool construction. Therefore, for this task, a lower limit on the remaining resources for a node to participate in the construction is set. for:

[0068] (3)

[0069] Nodes in a large-scale satellite constellation exchange information via data packets. Data packets are the unit of data in inter-satellite communication, containing the address information of the sending and receiving nodes. The key structures are "destination IP address", "source IP address", and "payload data".

[0070] This invention relates to two types of data packets: a request data packet A sent from a central node to other nodes, and a response data packet B sent from other nodes to the central node.

[0071] The information contained in request packet A is: source (center) node coordinates. Target node coordinates Nodes participate in building the lower limit of remaining resources And the types of resources required, etc.

[0072] The response data packet B contains the following information: source node coordinates. Target (center) node coordinates Remaining resources of nodes Whether or not it participates in the construction of the identifier T / F, etc.

[0073] For ease of understanding, the coordinates of satellite nodes mapped to the mesh topology are used. x , y This serves as a communication address representation method. Based on this, the hierarchy of each node relative to the central node is defined as follows:

[0074] (4)

[0075] This is equivalent to the minimum number of forwards required for communication between the remaining nodes and the central node. It is easy to know that the first... l The total number of satellites in the layers is 4 l .

[0076] Let the central node satellite be The steps of the task resource pool member node search method designed in this invention are as follows:

[0077] Step 1, with Centered on the surrounding layers The communicable satellites each send data packet A, initially .

[0078] At that time, it is necessary to construct in advance by The path to the target satellite with the fewest forwardings is chosen to reduce the probability of communication failure. Secondly, considering communication latency, the path with the shortest expected time is selected among path schemes with the same number of forwardings.

[0079] Step 2, Hierarchy l Each star parses data packet A upon receiving it and allocates its remaining resources accordingly. and participation lower limit Comparison:

[0080] a) when ( All elements of the set are greater than When the corresponding element is selected, the node is considered to meet the conditions for participating in the construction. Return response packet B, where the build flag is T.

[0081] b) When At that time, it is considered that the node does not meet the conditions for participating in the construction. Return response packet B, where the build flag is F.

[0082] Step 3, Each response data packet B received indicates that... l Number of data packets returned by the layer satellite (initial Make the following judgment:

[0083] a) When the identifier is T, the total number of nodes in the current pool ,initial ;

[0084] The total resources in the current pool can be represented as:

[0085] (5)

[0086] b) When the identifier is F, the above calculation is not performed.

[0087] Step 4, at node The following judgment is made: Determine whether to terminate resource collection at the current layer;

[0088] By expanding the search scope layer by layer, the task resource pool is constructed by prioritizing the use of the nearest nodes with low communication latency.

[0089] a) If ( All elements of the set are greater than If the corresponding elements are found, then the various resources in the pool have met the computing task requirements, the search ends directly, and we proceed to step 5;

[0090] b) If Further judgment:

[0091] If the current layer does not respond completely ,but Continue to wait for data packet B returned by the remaining satellites in this layer, and then return to step (3);

[0092] If the current layer has responded to all requests. Then the next level of search must be performed, returning to step (1) and letting , .

[0093] Step 5, in All N The coordinates and resource status of satellites participating in the construction of the mission resource pool are summarized, and consensus is reached among all nodes to select the total resources that meet the mission requirements from all responding nodes. The nodes form a task resource pool, which will jointly provide sufficient computing and storage resources for the computing task.

[0094] Thus, this invention completes the design of a method for constructing a mission resource pool for large-scale satellite constellations. Figure 2 The above search process is explained clearly and intuitively.

[0095] In this embodiment, verification is performed through numerical simulation. The numerical simulation problem, simulation design process, and simulation results are described below as an implementation method and technical evidence of this invention.

[0096] Establish a large-scale satellite constellation with the following parameters: a total of 2475 satellites, 45 orbital planes, an orbital inclination of 60°, an orbital altitude of 500km, a phase factor of 0, and the same resource limit for each satellite.

[0097] Let the coordinates be When the satellite (i.e., orbital plane number 13 and in-plane number 15) reached the mid-to-low latitudes, it received a computing task request.

[0098] After assessing and quantifying the task's resource requirements, the following information was obtained:

[0099] ;

[0100] The remaining computing and storage resources of each node are abstracted and quantified, and set as follows: Random numbers between;

[0101] The minimum resource capacity required for each node to participate in the construction is set to: .

[0102] Under the above conditions, in order to meet the resource requirements of the task, a corresponding task resource pool is established, and the application process of the task resource pool member node search method given in this invention is simulated by numerical simulation.

[0103] Numerical simulation results are as follows Figures 3-5 As shown, the process of searching member nodes layer by layer is illustrated. The solid circles represent satellite nodes added to the resource pool. The horizontal axis in the figure represents the orbital plane number, and the vertical axis represents the node's intraplane number. Figure 5 For the final search results, the number of satellites in the pool N The search depth is 19. l The total number of resources in the pool is 3, and the total number of resources in the pool is: This clearly meets the resource requirements of the task.

[0104] A system for constructing mission resource pools for large-scale satellite constellations:

[0105] The system includes an initialization module, a response module, an integration and judgment module, and a resource pool construction module;

[0106] The initialization module uses the central node satellite as the basis for the surrounding layers. Each of the communicable satellites sends a request data packet A;

[0107] The response module receives the request packet from the node and checks the remaining resources, hierarchy. l Each star parses data packet A upon receiving it and allocates its remaining resources accordingly. and participation lower limit The comparison is performed, and a response data packet B is returned to the central node satellite.

[0108] At the central node satellite, the integration and judgment module performs resource integration to determine whether to terminate the search.

[0109] The central node satellite uses the resource pool construction module to access all... N The coordinates and resource status of satellites participating in the construction of the mission resource pool are summarized, consensus is reached among the nodes, the mission resource pool is formed, and the mission is launched.

[0110] An electronic device includes a memory and a processor, the memory storing a computer program, the processor executing the computer program to implement the steps of the above method.

[0111] A computer-readable storage medium for storing computer instructions that, when executed by a processor, implement the steps of the above-described method.

[0112] The memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. Non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate synchronous DRAM (DDR SDRAM), enhanced synchronous DRAM (ESDRAM), synchronous linked DRAM (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory of the methods described in this invention is intended to include, but is not limited to, these and any other suitable types of memory.

[0113] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired means such as coaxial cable, optical fiber, digital subscriber line, DSL, or wireless means such as infrared, wireless, microwave, etc. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium such as a floppy disk, hard disk, magnetic tape; an optical medium such as a high-density digital video disc, DVD; or a semiconductor medium such as a solid-state disk, SSD, etc.

[0114] In implementation, each step of the above method can be completed by integrated logic circuits in the processor's hardware or by instructions in software. The steps of the method disclosed in the embodiments of this application can be directly implemented by a hardware processor, or by a combination of hardware and software modules in the processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method. To avoid repetition, detailed descriptions are omitted here.

[0115] It should be noted that the processor in the embodiments of this application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method embodiments can be completed by the integrated logic circuits in the processor's hardware or by instructions in software form. The processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly embodied as execution by a hardware decoding processor, or as execution by a combination of hardware and software modules in the decoding processor. The software modules can be located in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above methods.

[0116] The above provides a detailed description of the method for constructing a mission resource pool for a large-scale satellite constellation proposed in this invention, and elucidates the principles and implementation methods of this invention. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of this invention. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this invention. Therefore, the content of this specification should not be construed as a limitation of this invention.

Claims

1. A method for constructing a mission resource pool for large-scale satellite constellations, characterized in that: The method specifically includes the following steps: Step 1: Initialize the search, starting from the central node satellite and extending outwards to the surrounding layers. Each of the communicable satellites sends a request data packet A; Step 2: The node that receives the request packet responds by searching and checking the remaining resources, level. l Each star parses data packet A upon receiving it and allocates its remaining resources accordingly. and participation lower limit The comparison is performed, and a response data packet B is returned to the central node satellite. In step 2, Remaining resources Participation minimum Total resources required for the task All are represented in set form; when ,Right now All elements of the set are greater than When the corresponding element is found, the node is considered to meet the conditions for participating in the construction; a response data packet B is returned to the central node satellite, in which the construction flag is T; when If the node does not meet the conditions for participating in the construction, it returns a response data packet B to the central node satellite, in which the construction flag is F; Step 3: Integrate resources at the central node satellite; Step 4: Determine whether to terminate at the central node satellite. Step 5, at the central node satellite, for all N The coordinates and resource status of satellites participating in the construction of the mission resource pool are summarized, and nodes that meet the total resources required for the mission are selected from all response nodes to form the mission resource pool.

2. The task resource pool construction method according to claim 1, characterized in that: The request data packet A contains the following information: coordinates of the center node. Target node coordinates Nodes participate in building the lower limit of remaining resources and the types of resources required; The response data packet B contains the following information: source node coordinates. Target node coordinates Remaining resources of nodes Whether or not it participates in the construction of the identifier T / F.

3. The task resource pool construction method according to claim 2, characterized in that: Define the hierarchy of each node relative to the central node. for: (4) A single satellite node can directly communicate with at most four surrounding satellite nodes: adjacent nodes in the same orbit, nodes in adjacent orbits that are close to each other, and so on. l The total number of satellites in the layers is 4 l .

4. The task resource pool construction method according to claim 3, characterized in that: In step 1, initial ;when When this happens, a path must be constructed in advance from the central node satellite to the target satellite with the minimum number of forwardings to reduce the probability of communication failure; secondly, communication latency should be considered, and among path schemes with the same number of forwardings, the path with the shortest expected time should be selected.

5. The task resource pool construction method according to claim 4, characterized in that: In step 3, Each time the central node satellite receives a response data packet B, it has received... l Number of data packets returned by the layer satellite ,initial And make the following judgment: Record the current total resources in the pool as... ; When the identifier is T, it indicates the total number of nodes in the current pool. ,initial ; When the identifier is F, the above calculation is not performed.

6. The task resource pool construction method according to claim 5, characterized in that: In step 4, like ,Right now All elements of the set are greater than When the corresponding element is found, it is assumed that the various resources in the pool have met the computing task requirements, and the search ends directly, proceeding to step 5, resource pool construction. like Further judgment: If the current layer does not respond completely, i.e. If so, the central node satellite continues to wait for data packet B returned by the remaining satellites in that layer, and then returns to step 3; If the current layer has responded to all requests. Then the next level of search must be performed, returning to step 1 and letting , .

7. A system for executing the method for constructing a mission resource pool for a large-scale satellite constellation according to any one of claims 1 to 6, characterized in that: The system includes an initialization module, a response module, an integration and judgment module, and a resource pool construction module; The initialization module uses the central node satellite as the basis for the surrounding layers. Each of the communicable satellites sends a request data packet A; The response module receives the request packet from the node and checks the remaining resources, hierarchy. l Each star parses data packet A upon receiving it and allocates its remaining resources accordingly. and participation lower limit The comparison is performed, and a response data packet B is returned to the central node satellite. At the central node satellite, the integration and judgment module performs resource integration to determine whether to terminate the search. The central node satellite uses the resource pool construction module to access all... N The coordinates and resource status of satellites participating in the construction of the mission resource pool are summarized, consensus is reached among the nodes, the mission resource pool is formed, and the mission is launched.

8. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 6.

9. A computer-readable storage medium for storing computer instructions, characterized in that, When the computer instructions are executed by the processor, they implement the steps of the method according to any one of claims 1 to 6.

Images