Method, device, equipment, medium and program product for dynamic optimization of spatial networking

Abstract

The application discloses a dynamic optimization method and device for spatial networking, equipment, a medium and a program product, relates to the technical field of spatial networking, and comprises the following steps: generating a first service range of each node according to initial characteristics of the nodes, wherein the initial characteristics comprise initial loads and initial communication demands; dynamically adjusting the first service range of each node according to real-time characteristics of the nodes, obtaining a second service range of each node after dynamic adjustment, wherein the real-time characteristics comprise real-time loads and real-time communication demands; merging the second service ranges of the nodes to obtain a third service range of each node, and providing network services to network equipment in the third service range of each node by each node. The application improves the adaptability of a traditional spatial networking scheme.

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] Traditional spatial networking solutions employ static node deployment and service area allocation, making them incapable of adapting to dynamic node changes. For example, if nodes move or their loads change, continuing to use their original service areas can lead to service gaps, causing some nodes to lose coverage and impacting the effectiveness of the service area. Therefore, in scenarios where node locations and loads are relatively fixed, traditional spatial networking solutions fail to account for dynamic node changes, making them difficult to adapt to dynamic changes in the environment and demand.

[0003] The above content is only used to assist in understanding the technical solution of this application and does not constitute an admission that the above content is prior art. Summary of the Invention

[0004] The main purpose of this application is to provide an invention name, which aims 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] generating 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] Dynamically adjusting the first service range of each node according to real-time characteristics of each node to obtain a 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 using 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 the node n i , t represents the current time, t+1 represents the next time after 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] Detecting 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 included:

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

[0024] If the latest load and the latest communication requirement change, the third service range is taken 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 the nodes to obtain the second service range of each node after dynamic adjustment is performed to adjust the third service range of the target node.

[0025] In addition, to achieve the above object, the application further provides a dynamic optimization device for spatial networking, which comprises:

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

[0027] An adjusting module is configured to dynamically adjust the first service range of each node to obtain a second service range of each node after dynamic adjustment.

[0028] A merging module is configured to merge the second service range of each node to obtain a third service range of each node, and each node provides network service to network equipment within the third service range of each node.

[0029] In addition, to achieve the above object, the application further provides a dynamic optimization device for spatial networking, which comprises 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.

[0030] In addition, to achieve the above object, the application further provides a storage medium, which is a computer readable storage medium, and a computer program is stored on the storage medium, and the computer program is executed by a processor to implement the steps of the dynamic optimization method for spatial networking.

[0031] In addition, to achieve the above object, the application further provides a computer program product, which comprises a computer program, and the computer program is executed by a processor to implement the steps of the dynamic optimization method for spatial networking.

[0032] Compared with the static service area deployment of the existing technology, 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 resources are allocated on demand by dynamically adjusting the service areas, 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 following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0035] Figure 1 A flowchart illustrating a first embodiment of a dynamic optimization method for spatial networking according to the present application;

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

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

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

[0039] Figure 5 This is 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 explained 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 merely used to explain the technical solutions of the present application and are not intended to limit the present application.

[0042] It should be noted that the execution subject of this embodiment can be a dynamic optimization device for spatial networking (hereinafter referred to as the device), or a computing service device with data processing, network communication, and program execution functions, such as a tablet computer, personal computer, mobile phone, etc., or an electronic device or processor capable of implementing the above functions. The following uses 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 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 the dynamic boundary of the node's service area. Each node controls the size 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 and can join or exit a network. For example, in a space network, satellites, drones, space stations, etc. can all be considered as nodes. The initial characteristics refer to the initial load and initial communication requirements of the node; the initial load indicates the number of network device requests and data processing volume that the node needs to handle when it first joins the network; the initial communication demand indicates the frequency and data volume of the data exchanged between the node and other nodes. The first service range is the range of services that the 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 planar node, a two-dimensional planar 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 traditional planar network topologies, such as bus networks or ring networks, nodes are connected to a bus. For example, in a bus network, each computer node is connected to a bus, and these nodes primarily transmit data within this planar network structure. Their primary service range may be the data exchange range with adjacent nodes. Since planar nodes do not require altitude information, such as ground servers and base stations, their primary service range is circular.

[0051] In three-dimensional geographic space, for example, a space node in a satellite positioning system operates in three-dimensional space, and its position is represented by three-dimensional coordinates (x, y, z), where the z-axis represents altitude. As a space node, a satellite's service range is within three-dimensional space, providing positioning and communication services to devices within a certain three-dimensional area on the ground and in the air. Its primary three-dimensional service range may be a three-dimensional spatial range determined by factors such as the satellite's orbital altitude and signal coverage angle. Therefore, the primary service range of a 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 a 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 real-time characteristics refer to the characteristics of a node at the current moment, including real-time load and real-time communication demand. Real-time load reflects the actual workload or task volume a node is currently undertaking. For example, at a given moment, the number of user access requests a node is processing, the amount of data being processed, and so on represent its real-time load. Real-time load may change over time, for example, increasing and decreasing with alternating peaks and troughs in user access. Real-time communication demand represents the degree to which a node currently needs to communicate with other nodes. Communication demand also changes in real time based on factors such as network operating status and user operations. The second service range is the result of dynamically adjusting the first service range based on the node's real-time characteristics (real-time load and real-time communication demand). In other words, the new service range is obtained by modifying the initially determined service range based on the node's current operating status and communication demand. For example, if a node's real-time load increases, its service range will be expanded; if the direction of 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 no dynamic adjustment is made, when the real-time load of a certain node suddenly increases (e.g., a large number of users simultaneously request to access the service provided by the node), but the service range does not change, the node may be overloaded, the response speed may be slow or even paralyzed. If the service range is dynamically adjusted according to the real-time load and real-time communication demand, etc., the resources can be reasonably allocated, part of the tasks can be transferred to other nodes with lighter load or the coverage of the service can be adjusted, so as to avoid resource waste (e.g., a node has very low load but the service range is too large), and thus the utilization of network resources and the overall quality of network service can be improved.

[0056] In step S30, the second service ranges of the nodes are merged to obtain third service ranges of the nodes, and each node provides network service to network devices within the third service range of the node.

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

[0058] In an embodiment, step S30 includes steps A10-A20.

[0059] In step A10, it is detected whether the second service ranges of the nodes overlap.

[0060] The step of detecting whether the second service ranges of the nodes overlap includes:

[0061] The distance between two nodes is determined, and the sum of the radii of the second service ranges of the two nodes is determined.

[0062] According to the distance between the two nodes and the sum of the radii of the second service ranges of the two nodes, it is determined whether the second service ranges of the nodes overlap.

[0063] 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 is indicated 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 ranges of the two nodes is calculated; then the distance between the two nodes is compared to see whether it 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 means 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's important to note that the third service range is a new service range created by merging the overlapping portions of each node's second service range after discovering any overlap. This optimization aims to rationally plan a node's service area or objects, avoiding issues like resource misallocation and service conflicts that might arise from overlap.

[0067] In this embodiment, when 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 area of ​​the node is clearer, which effectively improves the adaptability of the traditional spatial networking solution.

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

[0069] Step B10, monitoring in real time the latest load and 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 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 is executed to obtain the dynamically adjusted second service range of each node, so as 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 an overlap, the target service ranges are 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 from 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, a first service range is first generated based on the initial characteristics of the nodes. This first service range is dynamically adjusted to obtain a second service range. The second service ranges are then merged to obtain a third service range. Finally, each node provides network services to network devices within its third service range. This shifts the allocation and management of network service areas from a static to a dynamic model. By dynamically adjusting service areas, resources are allocated on demand, effectively improving the adaptability of traditional spatial networking solutions.

[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 above and will not be described in detail. Step S10, the dynamic optimization method of the spatial network further includes steps D10 to D30:

[0079] Step D10, determining the coverage capability of the node based on 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 process per second is obtained based on the initial load of the node, and then the coverage capability of the node is determined based on the maximum number of network device tasks that the node can process per second. For example, when the maximum number of network device tasks that node A can process per second is 100 network devices, and the maximum number of network device tasks that node B can process 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 the node n i , t represents the current time, t+1 represents the next time after 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 demand 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 be referred to the above introduction and will not be described in detail later. Figure 2 , step S30, the dynamic optimization method of 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 3The large circle 100 on the left is the second service range of the first node, with a radius of 10 km; the small circle 200 on the left is the second service range of the second node, with a radius of 5 km; since the second service ranges of the first node and the second node overlap, that is, 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, so that the consistency and stability of the service are improved, thereby improving the adaptability of spatial networking.

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

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

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

[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 configured to merge the second service ranges of the nodes to obtain a third service range of each node, and provide network services to network devices within the third service range of each node through each node.

[0106] Optionally, the generating module 10 is further configured to determine the coverage capability of the node based on 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 whose second service ranges overlap, and a first radius and a second radius of the second service ranges 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 configured 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 will be 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 will be performed to adjust the third service range of the target node.

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

[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 the node n i , t represents the current time, t+1 represents the next time after the current time, and α and β are preset adjustment coefficients.

[0118] The dynamic optimization device for spatial networking provided in this application, using the dynamic optimization method for spatial networking in the above-mentioned embodiments, can address the technical problem of poor adaptability of traditional spatial networking solutions. Compared with the prior art, the beneficial effects of the dynamic optimization device for spatial networking provided in this application are the same as those of the dynamic optimization method for spatial networking provided in the above-mentioned embodiments, and the other technical features of the dynamic optimization device for spatial networking are the same as those disclosed in the above-mentioned embodiments and are not further described here.

[0119] The present application provides a dynamic optimization device for spatial networking, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to 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 spatial networking suitable for implementing the embodiments of the present application. The dynamic optimization device for spatial networking in the embodiments 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), in-vehicle terminals (e.g., in-vehicle navigation terminals), and fixed terminals such as digital TVs and desktop computers. Figure 5 The dynamic optimization device for spatial networking shown is merely an example and should not limit the functions and scope of use of the embodiments of the present application.

[0121] like Figure 5As shown, the dynamic optimization device for spatial networking may include a processing device 1001 (e.g., 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) 1002 or a program loaded from a storage device 1003 into a random access memory (RAM) 1004. Various programs and data required for the operation of the dynamic optimization device for spatial networking are also stored in RAM 1004. The processing device 1001, ROM 1002, and RAM 1004 are connected to each other via a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Typically, the following systems can be connected to the I / O interface 1006: an input device 1007 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; an output device 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 can allow the spatially networked dynamic optimization device to communicate with other devices wirelessly or by wire 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 of 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 processes described above with reference to the flowcharts can be implemented as computer software programs. For example, the embodiments disclosed in the present application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program comprising 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 via 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 spatial networking provided in this application, using the dynamic optimization method for spatial networking in the above-mentioned embodiment, can solve the technical problem of poor adaptability of traditional spatial networking solutions. Compared with the prior art, the beneficial effects of the dynamic optimization device for spatial networking provided in this application are the same as those of the dynamic optimization method for spatial networking provided in the above-mentioned embodiment, and the other technical features of the dynamic optimization device for spatial networking are the same as those disclosed in the method of the above-mentioned embodiment, and are not further described here.

[0124] It should be understood that the various parts disclosed in this application can be implemented using 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 description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

[0126] The present application provides a computer-readable storage medium having computer-readable program instructions (ie, a computer program) 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 this 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 thereof. 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), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In this embodiment, the computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction 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), etc., or any suitable combination thereof.

[0128] The 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 a dynamic optimization device for a spatial network, the dynamic optimization device for the spatial network: generates a first service range for each node based on initial characteristics of each node, wherein the initial characteristics include an initial load and an initial communication demand;

[0130] Dynamically adjusting the first service range of each node according to real-time characteristics of each node to obtain a 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 stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on the remote computer or server. In cases involving 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., through the Internet using an Internet service provider).

[0133] The flow charts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present application. In this regard, each box in the flow chart or block diagram can represent a module, program segment or a part of code, and the module, program segment or a part of 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 different order than 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 by a dedicated hardware-based system that performs the specified function or operation, or can be implemented by a combination of dedicated hardware and computer instructions.

[0134] The modules described in the embodiments of the present application may be implemented in software or hardware, wherein the name of a module does not necessarily limit the unit itself.

[0135] The computer-readable storage medium provided in this application is a computer-readable storage medium that stores computer-readable program instructions (i.e., a computer program) for executing the above-described dynamic optimization method for spatial networking. This computer-readable storage medium can address the technical issue of poor adaptability of conventional spatial networking solutions. Compared to the prior art, the beneficial effects of the computer-readable storage medium provided in this application are the same as those of the dynamic optimization method for spatial networking provided in the above-described embodiment, and are not further elaborated 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 in this application can solve the technical problem of poor adaptability of traditional spatial networking solutions. Compared with the existing technology, the beneficial effects of the computer program product provided in this application are the same as the beneficial effects of the dynamic optimization method of spatial networking provided in the above embodiment, and will not be repeated here.

[0138] The above description is only part of the embodiments of the present application and does not limit the patent scope of the present application. All equivalent structural transformations made by using the contents of the present application specification and drawings under the technical concept of the present application, or direct / indirect application 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: generating 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; Dynamically adjusting the first service range of each node according to real-time characteristics of each node to obtain a 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 merged to obtain the third service range of the nodes, and network services are provided to the network devices within the third service range of the nodes through the nodes, wherein the step of merging the second service ranges of the nodes to obtain the third service range of the nodes includes: detecting whether the second service ranges of the nodes overlap; if it is detected that the second service ranges of the nodes overlap, determining the first node and the second node whose second service ranges overlap, and the first radius and the second radius of the second service ranges of the first node and the second node; 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 by the radius of the third service range.

2. The dynamic optimization method for 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 dynamic optimization method for 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: ； in, is the radius of the second service range to be determined, represents the radius of the first service range, Indicates the change in the number of load devices from the initial load of the node to the real-time load, Indicates the change in communication demand data from the initial communication demand of the node to the real-time communication demand, Representation node , Indicates the current time, Indicates the next time after the current time. 、 is the preset adjustment factor.

4. The dynamic optimization method for 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 includes: monitoring in real time the latest load and 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 will be 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 will be performed to adjust the third service range of the target node.

5. A dynamic optimization device for spatial networking, characterized in that: The dynamic optimization device of the spatial networking includes: 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 demand; an adjustment module, configured to dynamically adjust the first service range of each node to obtain a dynamically adjusted second service range of each node; A 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; the merging module is also used to detect whether there is overlap in the second service ranges of each node; if it is detected that the second service ranges of each node overlap, the first node and the second node whose second service ranges overlap, as well as the first radius and the second radius of the second service ranges of the first node and the second node are determined; 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. A dynamic optimization device for spatial networking, characterized in that: The device includes: 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 dynamic optimization method for spatial networking according to any one of claims 1 to 4.

7. 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 according to any one of claims 1 to 4 are implemented.

8. 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 4 are implemented.

Images