Task resource pool construction method for large-scale satellite cluster

Abstract

The invention provides a task resource pool construction method for a large-scale satellite cluster, which belongs to the technical field of aerospace, and comprises the following steps of: on the basis of completing abstract quantitative representation of resources required by tasks and residual resources of each node, performing outward communication layer by layer by taking a node receiving a task request as a center, and collecting resource information of participated nodes; when the total number of participated node resources meets the task requirement, stopping searching to the outer layer, and completing the member node searching of the task resource pool; by means of the method, a large-scale satellite cluster can have the quick response capacity for dealing with sudden tasks, the on-orbit autonomous decision-making capacity is enhanced, and the wide application prospect is achieved.

Description

TECHNICAL FIELD

[0001] The application belongs to the technical field of aerospace, and in particular, relates to a task resource pool construction method for a large-scale satellite cluster. BACKGROUND

[0002] A large-scale satellite cluster in a low earth orbit has the characteristics of all-weather and full coverage, and has irreplaceable real-time response advantages in the fields of emergency rescue, environmental monitoring, battlefield reconnaissance, etc., can quickly complete observation tasks on any target in the world, realize high-stability and low-delay communication in a global range, etc., and has great development and application prospects. Abroad, represented by Starlink, the constellation system has entered the stage of large-scale deployment, and has launched thousands of networking satellites; domestic related plans are still in the research stage.

[0003] The working mode of the current large-scale satellite cluster can be divided into three categories: sky-ground network, sky-ground network, and space-based network. For the working mode of sky-ground network and sky-ground network, the ground network available for large-scale satellite cluster / constellation operation has very high demand for the number and construction range of ground nodes; and for the working mode based on space-based network, users can directly realize end-to-end connection through satellites and inter-satellite links, and are not very dependent on ground network facilities, and have the advantages of independence, security and invulnerability. Since the space-based network is independent of ground facilities, it has gradually become an important direction of technology evolution, and many researches on autonomous task execution of space-based network have appeared, including the present application.

[0004] The current mainstream large-scale satellite cluster has a certain on-board processing capability, each node has the ability to analyze, store and forward the received data packets, and can also independently perform a certain degree of calculation. However, due to its size, cost, etc., the on-board processing capability of a single satellite is limited, and is generally equivalent to the computing level of a ground embedded device, which is difficult to complete complex computing tasks. To realize on-orbit autonomous decision and execution of time-sensitive tasks such as emergency response and dynamic game, it is necessary to quickly solve optimization scheduling algorithms, and the solving process of these algorithms often needs to occupy a large amount of computing and storage resources. One solution is to combine each node with weak processing capability into a resource pool, and the resources in the pool are shared with each other, so that the resource pool as a whole has high processing capability. This method not only breaks through the performance bottleneck of a single satellite, but also can construct special task resource pools according to different task characteristics. SUMMARY

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

[0006] The present invention is achieved through the following technical solutions: A method for constructing a mission resource pool for a large-scale satellite cluster: the method specifically comprises the following steps: Step 1: Initialize the search, starting with the central node satellite and moving towards the surrounding layers. The communicable satellites send request data packets A respectively; Step 2: The node that receives the request packet responds to the search and checks the remaining resources, level l After receiving data packet A, each star analyzes it and allocates its remaining resources and participation threshold Compare and return the response data packet B to the central node satellite; 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, all N The coordinates and resource status of the satellites participating in the construction of the mission resource pool are summarized, and nodes that meet the total resource requirements of the mission are selected from all the response nodes to form the mission resource pool.

[0007] Furthermore, the information contained in the request data packet A is: the coordinates of the central node , target node coordinates , nodes participate in building the lower limit of remaining resources and the type of resources required; The information contained in the response data packet B is: source node coordinates , target node coordinates , node remaining resources , whether to participate in the construction of the identifier T / F.

[0008] Furthermore, define the hierarchy of each node relative to the central node for: (4) A single satellite node can communicate directly with at most four surrounding satellite nodes, which are adjacent nodes in the same orbit and nodes in adjacent orbits. l The total number of satellites is 4 l .

[0009] Furthermore, in step 1, initial ;when When the communication is in progress, a path from the central node satellite to the target satellite with the minimum number of forwarding times must be constructed in advance to reduce the probability of communication failure. Secondly, considering the communication delay, among the path plans with the same number of forwarding times, the path with the shortest estimated time consumption is selected.

[0010] Furthermore, in step 2, Own remaining resources , participation minimum and total resources required for the task All are expressed 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 identifier is T; when When , it is considered that the node does not meet the conditions for participating in the construction, and returns a response data packet B to the central node satellite, in which the construction identifier is F.

[0011] Furthermore, 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 satellite ,initial ; and make the following judgment: The total resources in the current pool are recorded as ; When the identifier is T, the total number of nodes in the current pool ,initial ; When the identifier is F, the above calculation is not performed.

[0012] Furthermore, in step 4, like ,Right now All elements of the set are greater than When the corresponding element is found, it is considered that all types of resources in the pool have met the computing task requirements, and the search ends directly and enters step 5 of resource pool construction; like , further judge: If the current layer does not respond completely, , the central node satellite continues to wait for the data packet B returned by the remaining satellites in this layer, and then returns to step 3; If the current layer has fully responded, , then the next level search must be performed, return to step 1 and make 、 .

[0013] A task resource pool construction system for large-scale satellite cluster: The system comprises an initialization module, a response module, an integration judgment module and a resource pool construction module; The initialization module sends a request data packet A to the surrounding satellites of the central node satellite respectively; The response module receives the request packet and checks the remaining resources, and each satellite in the surrounding level After receiving the data packet A, the satellite analyzes the remaining resources l and the lower limit of participation, and returns an answer data packet B to the central node satellite; The central node satellite integrates the resources through the integration judgment module, and judges whether to terminate the search; The central node satellite collects the coordinates and resource conditions of all The satellites participating in the construction of the task resource pool, and reaches a consensus among the nodes to form a task resource pool and start the task. N An electronic device comprising 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.

[0014] A computer readable storage medium for storing computer instructions, the computer instructions being executed by a processor to implement the steps of the above method.

[0015] The present application has the following advantages The present application has the following advantages

[0016] The method of the present application can complete the construction of the task resource pool of large-scale satellite cluster under reasonable conditions, ensure that the total resources of each node meet the resource requirements of the task, and improve the ability of large-scale satellite cluster to complete the task independently.

[0017] The method of the present application can complete the construction of the task resource pool of large-scale satellite cluster under reasonable conditions, ensure that the total resources of each node meet the resource requirements of the task, and improve the ability of large-scale satellite cluster to complete the task independently.

[0018] The method has the following advantages: (1) The method is simple and easy to implement, has low communication forwarding frequency, short time consumption and small data packet size in the construction process, and has good stability and reliability; ​(2) The member satellite nodes searched by the method are concentrated around the center node, so that the communication delay of each node is low, the reliability is high, and high task execution efficiency can be achieved; (3) The method can be modified or expanded according to actual conditions, such as changing the resource type of the task demand, continuing to search outward to improve the resource redundancy, and the like. BRIEF DESCRIPTION OF DRAWINGS

[0019] Figure 1 The figure is a schematic diagram of the topology structure of the application.

[0020] Figure 2 The figure is a flow chart of the method of the application.

[0021] Figure 3 The figure is a layer search result.

[0022] Figure 4 The figure is a layer search result.

[0023] Figure 5 The figure is a member node search final result. ). DETAILED DESCRIPTION

[0024] The technical solutions in the embodiments of the application will be clearly and completely described below with reference to the drawings in the embodiments of the application. Obviously, the described embodiments are only part of the embodiments of the application, rather than all the embodiments of the application. Based on the embodiments in the application, all other embodiments obtained by those skilled in the art without creative labor fall within the protection scope of the application.

[0025] Unless otherwise specified, the experimental methods used in the following embodiments are conventional methods. Unless otherwise specified, the materials, reagents, methods and instruments used are conventional materials, reagents, methods and instruments in the art, which can be obtained by commercial channels by those skilled in the art.

[0026] The application considers that the task type is a computing task, involves the computing and storage resources of nodes, and makes the following assumptions: (1) The application object is a uniform Walker constellation with the same orbital altitude, and the resource capabilities of each node are similar; (2) Since the search method is essentially a data packet transmission and comparison process, it is considered that the center node satellite has sufficient ability to complete the task resource pool member node search; (3) The communication between each satellite node is good; (4) Within the time consumed by the task resource pool member search, the satellite network topology structure can be approximately maintained as Figure 1The mesh structure is shown. Under the constraints of inter-satellite distance and relative motion speed, a single node at most communicates with four surrounding satellite nodes, which are respectively the adjacent nodes in the same orbit and the adjacent nodes in the adjacent orbit. (5) The number of satellite nodes required for the calculation task is less (not more than 50); (6) For the calculation task, it is assumed that the remaining resources of each node have been completed i , the total resource demand of the task is represented by an abstract quantitative representation.

[0027] , which is expressed in the form of a set as follows: (1) (2) Among them C (CPU) represents the amount of computing resources, M (Memory) represents the amount of memory resources, D (Disk) represents the amount of storage resources.

[0028] In addition, each node may occupy a part of the resource due to the remaining task, and the remaining resource is insufficient to support its participation in the construction of the resource pool, so for this task, the lower limit of the remaining resource of the node participating in the construction is set as: (3) The nodes of the large-scale satellite cluster exchange information in the form of data packet transmission. The data packet is a data unit in inter-satellite communication transmission, which contains the address information of the sending node and the receiving node, and the key structure mainly includes "destination IP address", "source IP address" and "net data".

[0029] The present application relates to two kinds of data packets, which are respectively a request data packet A sent by the center node to the remaining nodes and a response data packet B sent by the remaining nodes to the center node.

[0030] The request data packet A contains the following information: source (center) node coordinates , target node coordinates , node participation construction remaining resource lower limit and demand resource type.

[0031] The response data packet B contains the following information: source node coordinates , target (center) node coordinates , node remaining resources , participation construction flag T / F, etc.

[0032] ​​​For ease of understanding, the coordinates of satellite nodes are mapped to the mesh topology structure. x 、 y As a communication address expression. On this basis, the hierarchy of each node relative to the central node is defined as: (4) It is equivalent to the minimum forwarding times of the communication between the other nodes and the central node. l The total number of satellites is 4 l .

[0033] Assume that the central node satellite is , the steps of the task resource pool member node search method designed by the present invention are as follows: Step 1, As the center, the surrounding levels are The communication satellites send data packets A respectively, initially .

[0034] When The path to the target satellite with the minimum number of forwarding times is selected to reduce the probability of communication failure; secondly, considering the communication delay, among the path plans with the same number of forwarding times, the path with the shortest expected time is selected.

[0035] Step 2, Hierarchy l After receiving data packet A, each star analyzes it and allocates its remaining resources and participation threshold For comparison: a) when ( All elements of the set are greater than corresponding element), the node is considered to meet the conditions for participating in the construction. Return a response packet B, where the construction identifier is T.

[0036] b) When , the node is considered not to meet the conditions for participating in the construction. Return a response packet B, where the construction identifier is F.

[0037] Step 3, Each time a response packet B is received, l Number of data packets returned by satellite (initial ). Make the following judgment: a) When the identifier is T, the total number of nodes in the current pool ,initial ; The total resources in the current pool can be expressed as: (5) b) When the identifier is F, the above calculation is not performed.

[0038] Step 4, at the node The following judgment is made at: whether to terminate resource collection of the current layer; By expanding the search range layer by layer, the task resource pool is built by giving priority to the nearest nodes with low communication latency.

[0039] a) If ( All elements of the set are greater than corresponding element), then all types of resources in the pool have met the computing task requirements, the search ends directly, and proceeds to step 5; b) If , further judge: If the current layer does not fully respond, ,but Continue to wait for data packets B returned by the remaining satellites in this layer, and then return to step (3); If the current layer has fully responded, , then we need to search the next level, return to step (1) and let 、 .

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

[0041] Thus, the present invention has completed the design of a method for constructing a mission resource pool for a large-scale satellite cluster. Figure 2 The above search process is clearly and intuitively expressed.

[0042] In the embodiment, the numerical simulation is used for verification. The numerical simulation problem, simulation design process and simulation results are described below as an implementation method and technical proof of the present invention.

[0043] A large-scale satellite cluster with the following parameters is established: the total number of satellites is 2475, the number of orbital planes is 45, the orbital inclination is 60°, the orbital altitude is 500km, the phase factor is 0, and the resource upper limit of each satellite is set to the same.

[0044] Let the coordinates be When the satellite (i.e. the orbit plane number is 13 and the in-plane number is 15) operating at middle-low latitude receives a request of a computing task.

[0045] After the evaluation and quantification of the task resource demand, the following information is obtained: ; The remaining resources of each node are abstractly quantified and set as a random number between ; The lower limit of the resource capacity of each node participating in the construction is set as .

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

[0047] The numerical simulation results are shown in Figures 3-5 , which shows the process of searching member nodes layer by layer, and the solid dots are satellite nodes joined in the resource pool, the horizontal coordinate in the figure represents the orbit plane number, and the vertical coordinate is the in-plane number of the node. Figure 5 The number of satellite nodes in the pool is N 19, the number of search layers is l 3, and the total resource in the pool is: , which obviously meets the task resource demand.

[0048] A task resource pool construction system for a large-scale satellite cluster: The system comprises an initialization module, a response module, an integration judgment module and a resource pool construction module. The initialization module sends a request data packet A to the communicable satellites in the surrounding layers of the central node satellite respectively. The response module checks the remaining resources of the nodes receiving the request packet, and the stars in the layers l perform analysis after receiving the data packet A, compare the remaining resources and the participation lower limit , and return an answer data packet B to the central node satellite. The central node satellite integrates the resources through the integration judgment module to determine whether to terminate the search. The central node satellite collects the coordinates and resource conditions of all N the satellites participating in the construction of the task resource pool through the resource pool construction module, reaches a consensus among the nodes, forms a task resource pool, and starts the task.

[0049] An electronic device includes a memory storing a computer program and a processor implementing the steps of the above method when executing the computer program.

[0050] A computer readable storage medium for storing computer instructions, which, when executed by a processor, implement the steps of the above method.

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

[0052] In the above embodiments, all or part of the embodiments can be implemented using software, hardware, firmware, or any combination thereof. When implemented using software, all or part of the embodiments can be implemented 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 the present 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 a wired connection such as a coaxial cable, optical fiber, digital subscriber line (DSL), or wireless connection such as infrared, wireless, or microwave. The computer-readable storage medium can be any available medium that can be accessed by a computer, 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 disc (SSD).

[0053] During implementation, each step of the above method can be completed by an integrated logic circuit of the hardware in the processor or by instructions in the form of software. The steps of the method disclosed in conjunction with the embodiments of the present application can be directly embodied as being executed by a hardware processor, or can be executed by a combination of hardware and software modules in the processor. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in conjunction with its hardware. To avoid repetition, it will not be described in detail here.

[0054] It should be noted that the processor in the embodiments of the present application can be an integrated circuit chip with signal processing capability. In the implementation process, each step of the method embodiments can be completed by integrated logic circuits or instructions in the form of software in the processor. The processor can be a general processor, a digital signal processor DSP, an application specific integrated circuit ASIC, a field programmable gate array FPGA or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The disclosed methods, steps and logic block diagrams in the embodiments of the present application can be implemented or executed. The general processor can be a microprocessor or the processor can be any conventional processor. The steps of the method disclosed in combination with the embodiments of the present application can be directly embodied as hardware code processor execution completion, or executed by hardware and software module combination in the code processor. The software module can be located in the random access memory, the flash memory, the read only memory, the programmable read only memory or the electrically erasable programmable memory, the register or other mature storage medium in the art. The storage medium is located in the memory, and the processor reads the information in the memory, and combines the hardware to complete the steps of the above method.

[0055] The above describes in detail the method for constructing a task resource pool for a large-scale satellite cluster according to the present application, and the principle and implementation of the present application are described. The above description of the embodiments is only used to help understand the method of the present application and its core idea. Meanwhile, for those skilled in the art, according to the idea of the present application, the specific implementation and application range will be changed. In summary, the content of the specification should not be understood as a limitation of the present application.

Claims

1. A method for constructing a mission resource pool for a large-scale satellite cluster, characterized by: The method specifically comprises the following steps: Step 1: Initialize the search, starting with the central node satellite and moving towards the surrounding layers. The communicable satellites send request data packets A respectively; Step 2: The node that receives the request packet responds to the search and checks the remaining resources, level l After receiving data packet A, each star analyzes it and allocates its remaining resources and participation threshold Compare and return the response data packet B to the central node satellite; 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, all N The coordinates and resource status of the satellites participating in the construction of the mission resource pool are summarized, and nodes that meet the total resource requirements of the mission are selected from all the response nodes to form the mission resource pool.

2. The search method according to claim 1, wherein: The information contained in the request data packet A is: the coordinates of the central node , target node coordinates , nodes participate in building the lower limit of remaining resources and the type of resources required; The information contained in the response data packet B is: source node coordinates , target node coordinates , node remaining resources , whether to participate in the construction of the identifier T / F.

3. The search method according to claim 2, wherein: Define the hierarchy of each node relative to the central node for: (4) A single satellite node can communicate directly with at most four surrounding satellite nodes, which are adjacent nodes in the same orbit and nodes in adjacent orbits. l The total number of satellites is 4 l .

4. The search method according to claim 3, wherein: In step 1, initial ;when When the communication is in progress, a path from the central node satellite to the target satellite with the minimum number of forwarding times must be constructed in advance to reduce the probability of communication failure. Secondly, considering the communication delay, among the path plans with the same number of forwarding times, the path with the shortest estimated time consumption is selected.

5. The search method according to claim 4, characterized in that: In step 2, Own remaining resources , participation minimum and total resources required for the task All are expressed 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 identifier is T; when When , it is considered that the node does not meet the conditions for participating in the construction, and returns a response data packet B to the central node satellite, in which the construction identifier is F.

6. The search method according to claim 5, 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 satellite ,initial ; and make the following judgment: The total resources in the current pool are recorded as ; When the identifier is T, the total number of nodes in the current pool ,initial ; When the identifier is F, the above calculation is not performed.

7. The search method according to claim 6, 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 considered that all types of resources in the pool have met the computing task requirements, and the search ends directly and enters step 5 of resource pool construction; like , further judge: If the current layer does not respond completely, , the central node satellite continues to wait for the data packet B returned by the remaining satellites in this layer, and then returns to step 3; If the current layer has fully responded, , then the next level search must be performed, return to step 1 and make 、 .

8. A system for executing the method for constructing a large-scale satellite cluster task resource pool according to any one of claims 1 to 7, characterized in that: The system includes an initialization module, a response module, an integration judgment module and a resource pool construction module; The initialization module starts with the central node satellite and sends the satellite to the surrounding layers. The communicable satellites send request data packets A respectively; The response module receives the node of the request packet and checks the remaining resources, level l After receiving data packet A, each star analyzes it and allocates its remaining resources and participation threshold Compare and return the response data packet B to the central node satellite; The central node satellite integrates resources through the integration judgment module to determine whether to terminate the search; The central node satellite uses the resource pool building module to N The coordinates and resource status of the satellites participating in the construction of the mission resource pool are summarized, and a consensus is reached among the nodes to form a mission resource pool and start the mission.

9. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium for storing computer instructions, characterized in that: When the computer instructions are executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images