Dynamic optimization method and device for space networking, equipment, medium and program product

Abstract

The invention discloses a dynamic optimization method and device for space networking, equipment, a medium and a program product, and relates to the technical field of space networking, and the method comprises the steps: generating a first service range of each node according to an initial feature of each node, the initial feature comprising an initial load and an initial communication demand; according to the real-time characteristics of each node, the first service range of each node is dynamically adjusted to obtain a second service range of each node after dynamic adjustment, and the real-time characteristics comprise a real-time load and a real-time communication demand; and combining the second service ranges of the nodes to obtain third service ranges of the nodes, and providing network services for network devices in the third service ranges of the nodes through the nodes. According to the invention, the adaptability of a traditional space networking scheme is improved.

Description

Technical Field

[0001] The present application relates to the field of space networking technology, and in particular to a dynamic optimization method for space networking, a dynamic optimization method for space networking, a dynamic optimization method for space networking, a storage medium and a computer program product. Background Art

[0002] In traditional spatial networking solutions, static node deployment and service area allocation are used, which makes it difficult to cope with dynamic changes in nodes. For example, when nodes move and loads change, if they continue to use their original service areas, service gaps may occur, causing some nodes to lose service coverage, affecting the effectiveness of the service area. Therefore, in scenarios where node locations and loads are relatively fixed, traditional spatial networking solutions do not take into account the dynamic changes of nodes, making it difficult to adapt to dynamic changes in the environment and demand.

[0003] The above contents are only used to assist in understanding the technical solution of the present application and do not constitute an admission that the above contents are prior art. Summary of the invention

[0004] The main purpose of this application is to provide an invention name, aiming to solve the technical problem of poor adaptability of traditional space networking solutions.

[0005] To achieve the above objectives, the present application proposes a method for dynamic optimization of spatial networking, the method comprising:

[0006] Generate a first service range of each node according to initial characteristics of each node, wherein the initial characteristics include an initial load and an initial communication demand;

[0007] According to the real-time characteristics of each node, dynamically adjust the first service range of each node to obtain the dynamically adjusted second service range of each node, wherein the real-time characteristics include real-time load and real-time communication demand;

[0008] The second service ranges of the nodes are combined to obtain a third service range of each node, and each node provides network services to network devices within the third service range of each node.

[0009] In one embodiment, the step of generating the first service range of each node according to the initial characteristics of each node includes:

[0010] Determine the coverage capability of the node based on the initial load;

[0011] Obtaining a radius of a first service range according to the coverage capability and the initial communication requirement;

[0012] A first service range of each node is generated according to the radius and preset rules.

[0013] In one embodiment, the radius of the first service range of each node is dynamically adjusted by the following formula:

[0014] r i (t+1)=r i (t)+α·ΔL i -β·ΔD i ;

[0015] Among them, r i (t+1) is the radius of the second service range to be determined, r i (t) represents the radius of the first service range, ΔL i Indicates the change in the number of load devices from the initial load of the node to the real-time load, ΔD i Indicates the change in communication demand data from the initial communication demand of the node to the real-time communication demand, i represents node n i , t represents the current time, t+1 represents the next time of the current time, and α and β are preset adjustment coefficients.

[0016] In one embodiment, the step of merging the second service ranges of the nodes to obtain the third service ranges of the nodes includes:

[0017] Detect whether the second service ranges of the nodes overlap;

[0018] If it is detected that the second service ranges of the nodes overlap, the overlapping second service ranges are merged to obtain the third service range of each node.

[0019] In one embodiment, the step of merging the second service ranges of the nodes to obtain the third service ranges of the nodes includes:

[0020] Determine a first node and a second node having overlapping second service ranges, and a first radius and a second radius of the second service ranges of the first node and the second node;

[0021] The maximum radius of the first radius and the second radius is used as the radius of the third service range, and the third service range is determined by the radius of the third service range.

[0022] In one embodiment, after the step of merging the second service ranges of the nodes to obtain the third service ranges of the nodes, the following steps are performed:

[0023] Monitor in real time the latest load and the latest communication demand of the target node providing network services for the third service range;

[0024] If the latest load and the latest communication demand change, the third service range is used as the latest first service range, and the step of dynamically adjusting the first service range of each node according to the real-time characteristics of each node to obtain the dynamically adjusted second service range of each node is performed to adjust the third service range of the target node.

[0025] In addition, to achieve the above-mentioned purpose, the present application also proposes a dynamic optimization device for space networking, and the dynamic optimization device for space networking includes:

[0026] A generating module, configured to generate a first service range of each node according to initial characteristics of each node, wherein the initial characteristics include an initial load and an initial communication requirement;

[0027] An adjustment module, used to dynamically adjust the first service range of each node to obtain a second service range of each node after the dynamic adjustment;

[0028] The merging module is used to merge the second service ranges of the nodes to obtain the third service range of each node, and provide network services to the network devices within the third service range of each node through each node.

[0029] In addition, to achieve the above-mentioned purpose, the present application also proposes a dynamic optimization device for spatial networking, which includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, and the computer program is configured to implement the steps of the dynamic optimization method for spatial networking as described above.

[0030] In addition, to achieve the above-mentioned purpose, the present application also proposes a storage medium, which is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by the processor, the steps of the dynamic optimization method of spatial networking as described above are implemented.

[0031] In addition, to achieve the above-mentioned purpose, the present application also provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, it implements the steps of the dynamic optimization method of spatial networking as described above.

[0032] Compared with the static service area deployment of the prior art, the dynamic changes of nodes are not taken into account, which makes it difficult for traditional spatial networking solutions to adapt to the dynamic changes of the environment and needs. This application first generates a first service range based on the initial characteristics of the node, dynamically adjusts the first service range to obtain a second service range; then merges the second service range to obtain a third service range; finally, each node provides network services to the network devices within the third service range of each node. The allocation and management of network service areas are transformed from a static mode to a dynamic mode, and the on-demand allocation of resources is realized by dynamically adjusting the service area, which effectively improves the adaptability of traditional spatial networking solutions. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0034] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0035] Figure 1 A flowchart of the first embodiment of the dynamic optimization method for spatial networking provided by the present application;

[0036] Figure 2 A schematic diagram of a flow chart of a third embodiment of the dynamic optimization method for spatial networking of the present application;

[0037] Figure 3 A combined schematic diagram provided for the third embodiment of the dynamic optimization method for spatial networking of the present application;

[0038] Figure 4 A schematic diagram of the module structure of the dynamic optimization device for space networking of this application;

[0039] Figure 5 A schematic diagram of the device structure of the hardware operating environment involved in the dynamic optimization method of spatial networking in this application.

[0040] The purpose, features and advantages of this application will be further described in conjunction with the embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0041] It should be understood that the specific embodiments described herein are only used to explain the technical solutions of the present application and are not used to limit the present application.

[0042] It should be noted that the execution subject of this embodiment can be a dynamic optimization device of space networking (hereinafter referred to as the device), or a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or an electronic device, a processor, etc. that can realize the above functions. The following takes the device as an example to illustrate this embodiment and the following embodiments.

[0043] Based on this, the embodiment of the present application provides a dynamic optimization method for spatial networking, referring to Figure 1 , Figure 1 This is a flow chart of the first embodiment of the dynamic optimization method for spatial networking of the present application.

[0044] In this embodiment, the dynamic optimization method of the spatial networking includes steps S10 to S30:

[0045] Step S10, generating a first service range of each node according to initial characteristics of each node, wherein the initial characteristics include initial load and initial communication demand;

[0046] It should be noted that the first service range can also be called a buffer zone, which is a dynamic boundary of the node service area. Each node controls the size change of the service area coverage through the buffer zone. The buffer zone is equivalent to the expandable boundary of the service area.

[0047] A node can be a computer, server, terminal device, etc., where a node is a node at a certain moment. A node can join or exit a network. For example, in a space network, a satellite, a drone, a space station, etc. can all be regarded as a node. The initial characteristics refer to the initial load and initial communication requirements of a node; the initial load indicates the number of network device requests and data processing volume that need to be processed when the node is first connected to the network; the initial communication demand indicates the frequency and amount of data exchanged between the node and other nodes. The first service range is the range of services that a node can provide. For example, if a node has a low initial load and its initial communication demand is mainly concentrated in a certain area, then its first service range may be this area and surrounding areas related to its communication needs.

[0048] In one embodiment, if the node is a plane node, a two-dimensional plane first service range is generated;

[0049] If the node is a spatial node, a first service range in three-dimensional space is generated.

[0050] It should be noted that in the traditional planar network topology, such as the nodes in a bus network or a ring network. Taking the bus network as an example, each computer node is connected to a bus, and these nodes mainly transmit data in this planar network structure. Their first service range may be the data interaction range between adjacent nodes. Since the plane nodes do not need height information, such as ground servers and base stations, the first service range is circular.

[0051] In three-dimensional geographic space, such as the space nodes in the satellite positioning system. Satellites operate in three-dimensional space, and their positions need to be represented by three-dimensional coordinates (x, y, z), where the z axis represents the height. As a space node, the satellite's service range is within three-dimensional space, for example, it provides positioning, communication and other services to devices within a certain three-dimensional area on the ground and in the air. Its first three-dimensional space service range may be a three-dimensional space range determined by factors such as the satellite's orbital height and signal coverage angle, so the first service range of the space node is spherical.

[0052] Step S20, dynamically adjusting the first service range of each node according to the real-time characteristics of each node to obtain the dynamically adjusted second service range of each node, wherein the real-time characteristics include real-time load and real-time communication demand;

[0053] It should be noted that the real-time characteristics are the characteristics of the node at the current moment, including real-time load and real-time communication demand; the real-time load reflects the actual workload or task volume undertaken by the node at the current moment. For example, at a certain moment, the number of user access requests being processed by the node, the amount of data being calculated, etc. are its real-time load. The real-time load may change over time, such as increasing or decreasing with the alternation of user access peaks and troughs. The real-time communication demand indicates the degree of demand for the node to communicate with other nodes at the current moment. The communication demand will also change in real time according to factors such as the operating status of the network and user operations. The second service range is the result obtained by dynamically adjusting the first service range according to the real-time characteristics of the node (real-time load and real-time communication demand). In other words, the new service range is obtained by changing the service range initially determined by the node, taking into account the current working status and communication demand of the node. For example, if the real-time load of a node increases, its service range will be increased; if the direction of the real-time communication demand changes, the direction or area of ​​the service range will also be adjusted accordingly.

[0054] It is understandable that since the real-time characteristics of each node will change according to the dynamic changes of the node, performing step S20 can avoid resource waste or service overload caused by a fixed service range, thereby improving the utilization of network resources and the overall quality of network services.

[0055] For example, if dynamic adjustment is not performed, when the real-time load of a node suddenly increases (such as a large number of users simultaneously requesting to access the services provided by the node), but the service range remains unchanged, the node service may be overloaded, the response speed may slow down, or even paralyzed. However, if the service range can be dynamically adjusted according to real-time characteristics such as real-time load and real-time communication requirements, resources can be reasonably allocated, some tasks can be transferred to other nodes with lighter loads, or the service coverage can be adjusted to avoid resource waste (such as a node with very low load but too large service range), thereby improving the utilization of network resources and the overall quality of network services.

[0056] Step S30: Merge the second service ranges of the nodes to obtain the third service range of the nodes, and provide network services to the network devices within the third service range of the nodes through the nodes.

[0057] It should be noted that the third service range is the range obtained by merging the second service ranges of each node. It is a service range determined by merging on the basis of the second service range. The third service range combines the adjusted service ranges of each node and is a more comprehensive and comprehensive node service range. For example, if there are multiple nodes, each node has its own second service range. These service ranges are merged according to the merging algorithm to form the third service range. After determining the third service range, the node provides network services to network devices within the third service range.

[0058] In one implementation, step S30 includes steps A10 to A20:

[0059] Step A10, detecting whether the second service ranges of the nodes overlap;

[0060] The step of detecting whether the second service ranges of the cutover points overlap comprises:

[0061] Determine a distance between two nodes and a sum of radii of second service ranges of the two nodes;

[0062] Determine whether the second service ranges of the nodes overlap according to the distance between the two nodes and the sum of the radii of the second service ranges of the two nodes;

[0063] If the distance between two nodes is smaller than the sum of the radii of the second service ranges of the two nodes, it indicates that the second service ranges of the two nodes overlap.

[0064] It should be noted that the real-time feature also includes the real-time geographic location information of the nodes, and the distance between the two nodes is calculated through the real-time geographic location information; the radius of the second service range of the two nodes is determined, and the sum of the radii of the second service range of the two nodes is calculated; then, it is compared whether the distance between the two nodes is less than the sum of the radii of the second service ranges of the two nodes; if the distance between the two nodes is less than the sum of the radii of the second service ranges of the two nodes, it indicates that there is overlap in the second service ranges of the two nodes.

[0065] Step A20: If it is detected that the second service ranges of the nodes overlap, the overlapping second service ranges are merged to obtain the third service range of each node.

[0066] It should be noted that the third service range is a new service range obtained by merging the overlapping parts after finding that the second service ranges of each node overlap. It is an optimized result, which aims to reasonably plan the service area or object of the node to avoid unreasonable resource allocation and service conflicts that may arise due to overlap.

[0067] In this embodiment, after the overlapping second service ranges are merged to obtain the third service range, resources can be more concentratedly and reasonably allocated to different service areas. After the merger, resources can be more optimally allocated according to the new third service range, and the service areas of the nodes are clearer, which effectively improves the adaptability of traditional spatial networking solutions.

[0068] In another embodiment, step S30 includes steps B10 to B20:

[0069] Step B10, monitoring in real time the latest load and the latest communication demand of the target node providing network services for the third service range;

[0070] It should be noted that the latest load and the latest communication demand of the target node providing network services for the third service range are monitored in real time. If the load or communication demand of the node changes again, the third service range is automatically adjusted to ensure the balance of network service coverage area and node communication load.

[0071] Step B20, if the latest load and the latest communication demand change, the third service range is used as the latest first service range, and the step of dynamically adjusting the first service range of each node according to the real-time characteristics of each node to obtain the dynamically adjusted second service range of each node is executed to adjust the third service range of the target node.

[0072] It should be noted that when the load and communication requirements of each node change, the third service range is used as the new first service range; according to the changed load and communication requirements, the third service range is adjusted to obtain the target service range; then, it is detected whether there is any overlap in the target service range. If there is any overlap, the target service range is merged to obtain the final service range; finally, the final service range is used to provide network services to the network equipment.

[0073] In one embodiment, the rules for adjusting and optimizing the service scope are:

[0074] r final =r merge +γ·ΔL total -δ·ΔD total ;

[0075] Among them, r final is the radius of the optimized service range; r merge is the radius of the third service range; ΔL total is the total load change of all nodes after merging, ΔD total is the change in communication demand of all nodes after merging, and γ and δ are optimization coefficients.

[0076] In this embodiment, real-time monitoring can promptly detect changes in nodes and accurately understand the load and communication needs of each node, so that service requests of network devices can be more quickly assigned to appropriate nodes for processing, and can better adapt to dynamic changes in the environment and needs.

[0077] In this embodiment, the first service range is first generated according to the initial characteristics of the node, and the first service range is dynamically adjusted to obtain the second service range; the second service range is then merged to obtain the third service range; finally, each node provides network services to the network devices within the third service range of each node. The allocation and management of the network service area is transformed from a static mode to a dynamic mode, and the on-demand allocation of resources is achieved by dynamically adjusting the service area, which effectively improves the adaptability of the traditional spatial networking solution.

[0078] Based on the first embodiment of the present application, in the second embodiment of the present application, the same or similar contents as those in the first embodiment can be referred to the above description, and will not be described in detail later. Step S10, the dynamic optimization method of the spatial networking further includes steps D10 to D30:

[0079] Step D10, determining the coverage capability of the node according to the initial load;

[0080] It should be noted that in spatial networking, the coverage capability of a node refers to the range of services that the node can provide. The maximum number of network device tasks that the node can handle per second is obtained based on the node's initial load, and then the node's coverage capability is determined based on the maximum number of network device tasks that the node can handle per second. For example, when the maximum number of network device tasks that node A can handle per second is 100 network devices, and the maximum number of network device tasks that node B can handle per second is 50 network devices, then the coverage capability of node A is higher than that of node B.

[0081] Step D20, obtaining a radius of a first service range according to the coverage capability and the initial communication requirement;

[0082] It should be noted that the radius of the first service range is obtained according to the following formula:

[0083] r i =f(coverage capability, communication requirements);

[0084] Among them, r i is the radius of the first service range, where f is a function set according to the hardware parameters and load requirements of the node;

[0085] Step D30: Generate a first service range of each node according to the radius and preset rules.

[0086] It should be noted that if the node is a plane node, the preset rule is the area formula of a circle, and the first service range is a circle; if the node is a space node, the preset rule is the volume formula of a sphere, and the first service range is a sphere.

[0087] In this embodiment, the coverage capacity is determined based on the initial load, so that the node can plan the service range according to its actual carrying network equipment capacity, ensuring that the node meets the communication needs within this range. Each node has a clear service range, so that it can operate stably even when the environment and needs change dynamically.

[0088] In another embodiment, comprising:

[0089] The radius of the first service range of each node is dynamically adjusted by the following formula to obtain the radius of the second service range, so as to determine the second service range according to the radius of the second service range;

[0090] r i (t+1)=r i (t)+α·ΔL i -β·ΔD i ;

[0091] Among them, r i (t+1) is the radius of the second service range to be determined, ri (t) represents the radius of the first service range at the initial time step, ΔL i Indicates the change in the number of load devices from the initial load of the node to the real-time load, ΔD i Indicates the change in communication demand data from the initial communication demand of the node to the real-time communication demand, i represents node n i , t represents the current time, t+1 represents the next time of the current time, and α and β are preset adjustment coefficients.

[0092] It should be noted that, according to step D20, the radius of the first service range is determined, and the radius of the first service range is substituted into the formula.

[0093] In this embodiment, adjusting the service scope according to real-time characteristics can better adapt to environmental changes. The real-time characteristics of the node are constantly changing. By dynamically adjusting the service scope, it is possible to flexibly adapt to the changes in the node, whether it is the fault recovery of a single node (the node after fault recovery readjusts the service scope according to the real-time characteristics) or responding to sudden changes in the external environment (such as sudden high traffic demands or changes in the physical environment), it can maintain a relatively stable operating state.

[0094] Based on the first embodiment of the present application, in the second embodiment of the present application, the same or similar contents as those in the first embodiment can refer to the above introduction, and will not be repeated in the following. Figure 2 , step S30, the dynamic optimization method of the spatial networking further includes steps T10 to T20:

[0095] Step T10, determining a first node and a second node having overlapping second service ranges, and a first radius and a second radius of the second service ranges of the first node and the second node;

[0096] It should be noted that, according to the method in the second embodiment, the first radius and the second radius of the second service range of the first node and the second node are determined.

[0097] Step T20: Taking the maximum radius of the first radius and the second radius as the radius of the third service range, and determining the third service range according to the radius of the third service range.

[0098] It should be noted that the first radius and the second radius are compared to determine the maximum radius, which is used as the radius of the third service range. For example, if the first radius is 10 km and the second radius is 5 km, the maximum radius is 10 km.

[0099] like Figure 3, the large circle 100 on the left is the second service range of the first node, with a radius of 10km; the small circle 200 on the left is the second service range of the second node, with a radius of 5km; since the second service ranges of the first node and the second node overlap, i.e., the intersection of the large circle 100 and the small circle 200, Figure 3 The shaded part in the middle, therefore, the overlapping second service ranges need to be merged, and the merged large circle 300 is the third service range; comparing the first radius and the second radius, if the first radius of the first node is larger, the first radius is used as the radius of the third service range, thereby determining the third service range 300.

[0100] In this embodiment, by comparing the second service range radii of the two nodes and taking the maximum radius as the combined radius to obtain the third service range, repeated configuration of resources can be avoided, the complex management of multiple different service ranges can be reduced, and signal interference or service conflicts that may occur between the two nodes in the overlapping area can be avoided. The consistency and stability of the service are improved, thereby improving the adaptability of the spatial networking.

[0101] It should be noted that the above examples are only used to understand the present application and do not constitute a limitation on the dynamic optimization method of spatial networking of the present application. More simple transformations based on this technical concept are all within the scope of protection of the present application.

[0102] This application also provides a dynamic optimization device for space networking, please refer to Figure 4 , the dynamic optimization device of the space network includes:

[0103] A generating module 10, configured to generate a first service range of each node according to initial characteristics of each node, wherein the initial characteristics include an initial load and an initial communication requirement;

[0104] An adjustment module 20, configured to dynamically adjust the first service range of each node to obtain a dynamically adjusted second service range of each node;

[0105] The merging module 30 is used to merge the second service ranges of the nodes to obtain the third service range of each node, and provide network services to the network devices within the third service range of each node through each node.

[0106] Optionally, the generating module 10 is further used to determine the coverage capability of the node according to the initial load;

[0107] Obtaining a radius of a first service range according to the coverage capability and the initial communication requirement;

[0108] A first service range of each node is generated according to the radius and preset rules.

[0109] Optionally, the merging module 30 is further configured to detect whether the second service ranges of the nodes overlap;

[0110] If it is detected that the second service ranges of the nodes overlap, the overlapping second service ranges are merged to obtain the third service range of each node.

[0111] Optionally, the merging module 30 is further configured to determine a first node and a second node in which the second service range overlaps, and a first radius and a second radius of the second service range of the first node and the second node;

[0112] The maximum radius of the first radius and the second radius is used as the radius of the third service range, and the third service range is determined by the radius of the third service range.

[0113] Optionally, the merging module 30 is further used to monitor in real time the latest load and the latest communication demand of the target node providing network services for the third service range;

[0114] If the latest load and the latest communication demand change, the third service range is used as the latest first service range, and the step of dynamically adjusting the first service range of each node according to the real-time characteristics of each node to obtain the dynamically adjusted second service range of each node is performed to adjust the third service range of the target node.

[0115] The dynamic optimization device of the spatial networking comprises:

[0116] r i (t+1)=r i (t)+α·ΔL i -β·ΔD i ;

[0117] Among them, r i (t+1) is the radius of the second service range to be determined, r i (t) represents the radius of the first service range, ΔL i Indicates the change in the number of load devices from the initial load of the node to the real-time load, ΔD i Indicates the change in communication demand data from the initial communication demand of the node to the real-time communication demand, i represents node n i , t represents the current time, t+1 represents the next time of the current time, and α and β are preset adjustment coefficients.

[0118] The dynamic optimization device for spatial networking provided by the present application adopts the dynamic optimization method for spatial networking in the above-mentioned embodiment, which can solve the technical problem of poor adaptability of the traditional spatial networking solution. Compared with the prior art, the beneficial effects of the dynamic optimization device for spatial networking provided by the present application are the same as the beneficial effects of the dynamic optimization method for spatial networking provided by the above-mentioned embodiment, and the other technical features in the dynamic optimization device for spatial networking are the same as the features disclosed in the above-mentioned embodiment method, which will not be described in detail here.

[0119] The present application provides a dynamic optimization device for spatial networking, and the dynamic optimization device for spatial networking includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the dynamic optimization method for spatial networking in the first embodiment described above.

[0120] Reference below Figure 5 , which shows a schematic diagram of the structure of a dynamic optimization device for space networking suitable for implementing the embodiment of the present application. The dynamic optimization device for space networking in the embodiment of the present application may include but is not limited to mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 5 The dynamic optimization device for spatial networking shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0121] like Figure 5As shown, the dynamic optimization device of the spatial network may include a processing device 1001 (such as a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: Read Only Memory) 1002 or a program loaded from a storage device 1003 to a random access memory (RAM: Random Access Memory) 1004. In RAM1004, various programs and data required for the operation of the dynamic optimization device of the spatial network are also stored. The processing device 1001, ROM1002 and RAM1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems may be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 1003 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 1009. The communication device 1009 may allow the spatially networked dynamic optimization device to communicate wirelessly or wired with other devices to exchange data. Although the figure shows a spatially networked dynamic optimization device with various systems, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems may be implemented or have instead.

[0122] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0123] The dynamic optimization device for space networking provided by the present application adopts the dynamic optimization method for space networking in the above embodiment, which can solve the technical problem of poor adaptability of traditional space networking solutions. Compared with the prior art, the beneficial effects of the dynamic optimization device for space networking provided by the present application are the same as the beneficial effects of the dynamic optimization method for space networking provided by the above embodiment, and other technical features in the dynamic optimization device for space networking are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.

[0124] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0125] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0126] The present application provides a computer-readable storage medium having computer-readable program instructions (ie, computer programs) stored thereon, and the computer-readable program instructions are used to execute the dynamic optimization method of spatial networking in the above-mentioned embodiment.

[0127] The computer-readable storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems or devices, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM: Random Access Memory), a read-only memory (ROM: Read Only Memory), an erasable programmable read-only memory (EPROM: Erasable Programmable Read Only Memory or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM: CD-Read Only Memory), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency: Radio Frequency), etc., or any suitable combination of the above.

[0128] The above-mentioned computer-readable storage medium may be included in the dynamic optimization device of the spatial network; or it may exist independently without being assembled into the dynamic optimization device of the spatial network.

[0129] The computer-readable storage medium carries one or more programs. When the one or more programs are executed by the dynamic optimization device of the space network, the dynamic optimization device of the space network: generates a first service range of each node according to the initial characteristics of each node, wherein the initial characteristics include an initial load and an initial communication demand;

[0130] According to the real-time characteristics of each node, dynamically adjust the first service range of each node to obtain the dynamically adjusted second service range of each node, wherein the real-time characteristics include real-time load and real-time communication demand;

[0131] The second service ranges of the nodes are combined to obtain a third service range of each node, and each node provides network services to network devices within the third service range of each node.

[0132] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0133] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a sequence different from that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0134] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0135] The readable storage medium provided in this application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned dynamic optimization method for spatial networking, and can solve the technical problem of poor adaptability of traditional spatial networking solutions. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided in this application are the same as the beneficial effects of the dynamic optimization method for spatial networking provided in the above-mentioned embodiment, and will not be repeated here.

[0136] The present application also provides a computer program product, including a computer program, which implements the steps of the dynamic optimization method of spatial networking as described above when executed by a processor.

[0137] The computer program product provided by this application can solve the technical problem of poor adaptability of traditional spatial networking solutions. Compared with the prior art, the beneficial effects of the computer program product provided by this application are the same as the beneficial effects of the dynamic optimization method of spatial networking provided by the above embodiment, which will not be repeated here.

[0138] The above descriptions are only some embodiments of the present application, and are not intended to limit the patent scope of the present application. All equivalent structural changes made using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect applications in other related technical fields are included in the patent protection scope of the present application.

Claims

1. A dynamic optimization method for spatial networking, characterized in that: The dynamic optimization method of the spatial networking includes: Generate a first service range of each node according to initial characteristics of each node, wherein the initial characteristics include an initial load and an initial communication demand; According to the real-time characteristics of each node, dynamically adjust the first service range of each node to obtain the dynamically adjusted second service range of each node, wherein the real-time characteristics include real-time load and real-time communication demand; The second service ranges of the nodes are combined to obtain a third service range of each node, and each node provides network services to network devices within the third service range of each node.

2. The method for dynamic optimization of spatial networking according to claim 1, characterized in that: The step of generating the first service range of each node according to the initial characteristics of each node includes: Determine the coverage capability of the node based on the initial load; Obtaining a radius of a first service range according to the coverage capability and the initial communication requirement; A first service range of each node is generated according to the radius and preset rules.

3. The method for dynamic optimization of spatial networking according to claim 1, characterized in that: The radius of the first service range of each node is dynamically adjusted using the following formula: r i (t+1)=r i (t)+α·ΔL i -β·ΔD i ; Among them, r i (t+1) is the radius of the second service range to be determined, r i (t) represents the radius of the first service range, ΔL i Indicates the change in the number of load devices from the initial load of the node to the real-time load, ΔD i Indicates the change in communication demand data from the initial communication demand of the node to the real-time communication demand, i represents node n i , t represents the current time, t+1 represents the next time of the current time, and α and β are preset adjustment coefficients.

4. The method for dynamic optimization of spatial networking according to claim 1, characterized in that: The step of merging the second service ranges of the nodes to obtain the third service range of the nodes includes: Detect whether the second service ranges of the nodes overlap; If it is detected that the second service ranges of the nodes overlap, the overlapping second service ranges are merged to obtain the third service range of each node.

5. The method for dynamic optimization of spatial networking according to claim 1, characterized in that: The step of merging the second service ranges of the nodes to obtain the third service range of the nodes includes: Determine a first node and a second node having overlapping second service ranges, and a first radius and a second radius of the second service ranges of the first node and the second node; The maximum radius of the first radius and the second radius is used as the radius of the third service range, and the third service range is determined by the radius of the third service range.

6. The method for dynamic optimization of spatial networking according to claim 1, characterized in that: After the step of merging the second service ranges of the nodes to obtain the third service ranges of the nodes, the method further comprises: Monitor in real time the latest load and the latest communication demand of the target node providing network services for the third service range; If the latest load and the latest communication demand change, the third service range is used as the latest first service range, and the step of dynamically adjusting the first service range of each node according to the real-time characteristics of each node to obtain the dynamically adjusted second service range of each node is performed to adjust the third service range of the target node.

7. A dynamic optimization device for space networking, characterized in that: The dynamic optimization device of the spatial networking comprises: A generating module, configured to generate a first service range of each node according to initial characteristics of each node, wherein the initial characteristics include an initial load and an initial communication requirement; An adjustment module, used to dynamically adjust the first service range of each node to obtain a second service range of each node after the dynamic adjustment; The merging module is used to merge the second service ranges of the nodes to obtain the third service range of each node, and provide network services to the network devices within the third service range of each node through each node.

8. A dynamic optimization device for space networking, characterized in that: The device comprises: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the computer program is configured to implement the steps of the method for dynamic optimization of spatial networking as described in any one of claims 1 to 6.

9. A storage medium, characterized in that: The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, the steps of the dynamic optimization method of spatial networking as described in any one of claims 1 to 6 are implemented.

10. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the steps of the method for dynamic optimization of spatial networking according to any one of claims 1 to 6 are implemented.

Images