Ad hoc network scheduling method and device, and storage medium

Abstract

The invention relates to the field of ad hoc network scheduling, and discloses an ad hoc network scheduling method and device, and a storage medium. The method comprises the steps that a scheduling system receives an execution task and analyzes an initial address corresponding to the execution task, and the initial address is a networking address of the execution task in an ad hoc network; according to a preset distance analysis algorithm, calculating distances between the N self-organizing subsystems and the initial address to obtain a task distance set; extracting the minimum task distance in the task distance set; analyzing the system state of the self-organizing subsystem corresponding to the minimum task distance; when the system state is busy, re-extracting the minimum task distance in the task distance set; and when the system state is idle, sending the execution task to the self-organizing subsystem corresponding to the minimum task distance. In the embodiment of the invention, the task execution distance of the execution task in the plurality of ad hoc subsystems is calculated through the scheduling system, so that efficient scheduling in the ad hoc network is realized, and the networking scheduling transmission speed of ad hoc network communication is improved.

Description

Technical Field

[0001] The present invention relates to the field of self-organizing network scheduling, and in particular to a scheduling method, equipment and storage medium for a self-organizing network. Background Art

[0002] In the past few decades, due to the rapid development of society, various communication equipment has also developed rapidly, from the initial 3G network, 4G network, to the current 5G network, as well as Beidou satellite and Tiantong satellite, etc., more and more communication methods have developed, but whether it is 3G network, 4G network, or the current 5G network, base stations are required for communication, and Beidou satellite and Tiantong satellite communication are particularly resource-intensive, and there will be delays and packet loss, and they are generally used in emergency situations. In some special cases, such as geological disasters, forest fires and other communication interruptions, the base station network is paralyzed, and satellite communication is not suitable for such large-scale rescue, so there is a new communication method such as self-organizing network.

[0003] The communication method of the ad hoc network does not rely on base stations, nor does it need to connect to satellites. By adding ad hoc network modules to communication equipment, an ad hoc network group can be formed in an area. The size of the area depends on the signal distance of the ad hoc network module. All ad hoc network devices within this area can communicate, which is very convenient to use in some special situations where there is no base station signal or communication is interrupted. However, in the application of ad hoc networks in disaster relief scenarios, the personnel performing the tasks need to act separately. If the ad hoc network communication method is used to dispatch personnel, there will be signal transmission delays and jams during the dispatch transmission process, and the personnel may not be able to communicate clearly, resulting in insufficient efficiency. Summary of the invention

[0004] The main purpose of the present invention is to solve the technical problem of signal delay and jamming in the process of network scheduling and transmission in self-organizing network communication.

[0005] A first aspect of the present invention provides a scheduling method for an ad hoc network, wherein the scheduling method for an ad hoc network is applied to a scheduling system for an ad hoc network, wherein the scheduling system for the ad hoc network comprises: N ad hoc subsystems and a scheduling system, wherein N is a positive integer, and the scheduling method for the ad hoc network comprises:

[0006] The scheduling system receives the execution task and analyzes the initial address corresponding to the execution task, wherein the initial address is the networking address of the execution task in the ad hoc network;

[0007] According to a preset distance analysis algorithm, the distances between the N self-organizing subsystems and the initial address are calculated to obtain a task distance set;

[0008] Extracting the minimum task distance in the task distance set;

[0009] Analyze the system state of the self-organizing subsystem corresponding to the minimum task distance;

[0010] When the system status is busy, re-extracting the minimum task distance in the task distance set;

[0011] When the system state is idle, the execution task is sent to the self-organizing subsystem corresponding to the minimum task distance.

[0012] Optionally, in a first implementation of the first aspect of the present invention, the distances between the N self-organizing subsystems and the initial address are calculated according to a preset distance analysis algorithm to obtain a task distance set, which includes:

[0013] Based on the number of nodes corresponding to the N self-organizing subsystems, calculating the offset between the initial address and each node;

[0014] Calculate the network address corresponding to each node according to the offset corresponding to each node;

[0015] According to the initial address, a distance calculation is performed on the networking address corresponding to each node to obtain an execution distance set.

[0016] Optionally, in a second implementation of the first aspect of the present invention, the calculating, based on the number of nodes corresponding to the N self-organizing subsystems, the offset corresponding to each node of the initial address includes:

[0017] Determine whether the number of nodes corresponding to the N self-organizing subsystems is greater than 1;

[0018] When there is no node number greater than 1, the offset between the initial address and each node is calculated based on a preset first calculation formula;

[0019] When there is a node number greater than 1, the offset between the initial address and each node is calculated based on a preset second calculation formula.

[0020] Optionally, in a third implementation of the first aspect of the present invention, calculating the offset between the initial address and each node based on a preset first calculation formula includes:

[0021] C skip (d) = 1 + C m *(L m -d-1), where L m is the maximum node depth of the initial address to the nodes in the N self-organizing subsystems, C m is the maximum number of child nodes corresponding to the initial address, d is the node depth of the initial address to the nodes in the N self-organizing subsystems, C skip(d) is the offset of the initial address to the nodes in the N self-organizing subsystems.

[0022] Optionally, in a fourth implementation of the first aspect of the present invention, calculating the offset between the initial address and each node based on a preset second calculation formula includes:

[0023] C skip (d) = (1 + C m -R m -C m *R m Lm-d-1 ) / (1-R m ), L m is the maximum node depth of the initial address to the nodes in the N self-organizing subsystems, C m is the number of all child nodes corresponding to the initial address, d is the node depth of the initial address to the nodes in the N self-organizing subsystems, C skip (d) is the offset of the initial address to the nodes in the N self-organizing subsystems, R m is the total number of all nodes in N self-organizing subsystems.

[0024] Optionally, in a fifth implementation manner of the first aspect of the present invention, calculating the networking address corresponding to each node according to the offset corresponding to each node includes:

[0025] A i =A p +C skip (d)*R m +i,i∈[1,C m -R m ], where C m is the maximum number of child nodes corresponding to the initial address, d is the node depth of the initial address to the nodes in the N self-organizing subsystems, C skip (d) is the offset of the initial address to the nodes in the N self-organizing subsystems, R m is the total number of nodes in N self-organizing subsystems, i is the i-th node, A i is the networking address of the ith node, A p is the initial address.

[0026] Optionally, in a sixth implementation of the first aspect of the present invention, performing distance calculation on the networking address corresponding to each node according to the initial address to obtain the execution distance set includes:

[0027] N=A p +1+[(D-(A p +1) / C skip (d)]*C skip (d), D∈[A p, A p +C skip (d-1)]

[0028] Where [*] is the Gaussian rounding function, D is the execution address of the task in the ad hoc network, N is the execution distance, and A p is the initial address, C skip (d) is the offset of the initial address to the nodes in the N self-organizing subsystems, and d is the node depth of the initial address to the nodes in the N self-organizing subsystems.

[0029] Optionally, in a seventh implementation manner of the first aspect of the present invention, after sending the execution task to the self-organizing subsystem corresponding to the minimum task distance, the method further includes:

[0030] The self-organizing subsystem corresponding to the minimum task distance receives the execution task, and calls the node corresponding to the minimum task distance to execute the execution task.

[0031] A second aspect of the present invention provides a scheduling device for a self-organizing network, comprising: a memory and at least one processor, wherein instructions are stored in the memory, and the memory and the at least one processor are interconnected via a line; the at least one processor calls the instructions in the memory so that the scheduling device for the self-organizing network executes the above-mentioned scheduling method for the self-organizing network.

[0032] A third aspect of the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores instructions, which, when executed on a computer, enable the computer to execute the above-mentioned scheduling method for a self-organizing network.

[0033] In an embodiment of the present invention, by analyzing the starting address of the execution task, calculating the scheduling processing distance between the starting address and the self-organizing subsystem of the self-organizing network, using the scheduling processing distance to find the self-organizing subsystem closest to the starting address, the execution task is sent to the nearest self-organizing subsystem, and the task is processed by the nearest self-organizing subsystem, thereby achieving efficient scheduling within the self-organizing network, improving the transmission speed of the self-organizing network communication in the network scheduling, and overcoming the problem of signal delay and jamming caused by too long data processing time. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] Figure 1 A schematic diagram of an embodiment of a scheduling method for an ad hoc network in an embodiment of the present invention;

[0035] Figure 2 A schematic diagram of a specific embodiment of step 102 of the scheduling method for an ad hoc network in an embodiment of the present invention;

[0036] Figure 3A schematic diagram of a specific embodiment of step 1021 of the scheduling method for an ad hoc network in an embodiment of the present invention;

[0037] Figure 4 It is a schematic diagram of an embodiment of a scheduling device for a self-organizing network in an embodiment of the present invention. DETAILED DESCRIPTION

[0038] The embodiments of the present invention provide a scheduling method, a device and a storage medium for an ad hoc network.

[0039] The embodiments disclosed in the present invention will be described in more detail below with reference to the accompanying drawings. Although certain embodiments disclosed in the present invention are shown in the accompanying drawings, it should be understood that the present invention can be implemented in various forms and should not be construed as being limited to the embodiments described herein, which are instead provided for a more thorough and complete understanding of the present invention. It should be understood that the drawings and embodiments disclosed in the present invention are only for exemplary purposes and are not intended to limit the scope of protection disclosed in the present invention.

[0040] In the description of the embodiments disclosed in the present invention, the term "including" and similar terms should be understood as open inclusion, that is, "including but not limited to". The term "based on" should be understood as "based at least in part on". The term "one embodiment" or "the embodiment" should be understood as "at least one embodiment". The terms "first", "second", etc. may refer to different or the same objects. Other explicit and implicit definitions may also be included below.

[0041] For ease of understanding, the specific process of the embodiment of the present invention is described below. Figure 1 , an embodiment of a scheduling method for a self-organizing network in an embodiment of the present invention, the scheduling method for a self-organizing network is applied to a scheduling system for a self-organizing network, the scheduling system for the self-organizing network includes: N self-organizing subsystems, a scheduling system, wherein N is a positive integer, and the scheduling method for the self-organizing network includes:

[0042] 101. The scheduling system receives an execution task and analyzes an initial address corresponding to the execution task, wherein the initial address is a networking address of the execution task in the ad hoc network;

[0043] In this embodiment, the scheduling system receives an execution task, which may be an application scenario such as media data transmission, analysis data synchronization, and communication between personnel. The execution task has an initial address for initiation, and the initial address is a networking address constructed in a self-organizing network. The networking address may be a networking address constructed by a topology with the initial address as the starting point of a tree network, or it may be a networking address constructed by a scheduling system as the starting point of a tree network. The specific address may be set according to needs.

[0044] 102. Calculate the distances between the N self-organizing subsystems and the initial address according to a preset distance analysis algorithm to obtain a task distance set;

[0045] In this embodiment, during data transmission, there is at least one processing node inside the N self-organizing subsystems, and the distance between the processing node address inside the self-organizing subsystem and the initial address is calculated to obtain a task distance set of at least N task distances.

[0046] For details, please refer to Figure 2 , Figure 2 This is a specific embodiment of step 102 of the scheduling method for an ad hoc network in an embodiment of the present invention, and step 102 includes the following specific implementation methods:

[0047] 1021. Based on the number of nodes corresponding to the N self-organizing subsystems, calculate the offset between the initial address and each node;

[0048] 1022. Calculate the networking address corresponding to each node according to the offset corresponding to each node;

[0049] 1023. According to the initial address, perform distance calculation on the networking address corresponding to each node to obtain an execution distance set.

[0050] In steps 1021-1023, the data of each corresponding node in the N self-organizing subsystems are first summarized to obtain a topological network for data information processing in the N self-organizing subsystems. By analyzing the distance between the initial address and other nodes in the topological network, the offset corresponding to each node is obtained.

[0051] Based on the offset analysis, when the initial address is fixed, the relative addresses of other nodes in the ad hoc network to the initial address are analyzed. By analyzing the distance between the relative address and the initial address, the execution distance set is obtained.

[0052] Specifically, step 1022 includes the following specific implementation methods:

[0053] A i =A p +C skip (d)*(i-1)+1, i∈[1, R m ], where d is the node depth of the initial address to the nodes in the N self-organizing subsystems, C skip (d) is the offset of the initial address to the nodes in the N self-organizing subsystems, R m is the total number of nodes in N self-organizing subsystems, i is the i-th node, A i is the networking address of the ith node, A p is the initial address.

[0054] Ai is the networking address of the ith node, A i Refers to the networking address of a non-routing node, which is a node used to process data.

[0055] C m is the maximum number of child nodes corresponding to the initial address, that is, the sum of all child nodes existing at the initial address, R m It is the total number of nodes in the N self-organizing subsystems, that is, the maximum value of the processing nodes set in the N self-organizing subsystems.

[0056] Specifically, step 1023 includes the following specific implementation methods:

[0057] N=A p +1+[(D-(A p +1) / C skip (d)]*C skip (d), D∈[A p , A p +C skip (d-1)]

[0058] Where [*] is the Gaussian rounding function, D is the execution address of the task in the ad hoc network, N is the execution distance, and A p is the initial address, C skip (d) is the offset of the initial address to the nodes in the N self-organizing subsystems, and d is the node depth of the initial address to the nodes in the N self-organizing subsystems.

[0059] D is the execution address of the execution task in the ad hoc network. The execution address traverses and detects all nodes in the N ad hoc subsystems to obtain the execution distance N corresponding to all nodes in the N ad hoc subsystems.

[0060] For further information, see Figure 3 , Figure 3 This is a specific embodiment of step 1021 of the scheduling method for an ad hoc network in an embodiment of the present invention, and step 1021 includes the following specific implementation methods:

[0061] 10211. Determine whether the number of nodes corresponding to the N self-organizing subsystems is greater than 1;

[0062] 10212. When the number of nodes does not exist and is greater than 1, the offset between the initial address and each node is calculated based on a preset first calculation formula;

[0063] 10213. When the number of nodes is greater than 1, the offset between the initial address and each node is calculated based on a preset second calculation formula.

[0064] In steps 10211-10213, it is first necessary to analyze whether one self-organizing subsystem of the N self-organizing subsystems that constitute the self-organizing network contains only one processing node, that is, to analyze whether the number of nodes corresponding to the N self-organizing subsystems is greater than 1. If so, it means that the N self-organizing subsystems are not all single processing nodes, and there is at least one self-organizing subsystem that contains at least two processing nodes.

[0065] When each of the N self-organizing subsystems has only one processing node, the preset first calculation formula is used to calculate the offset corresponding to the initial address and each node.

[0066] When at least one of the N self-organizing subsystems includes at least two processing nodes, the offset corresponding to the initial address and each node is calculated using a preset second calculation formula.

[0067] Specifically, step 10212 includes the following specific implementation methods:

[0068] C skip (d) = 1 + C m *(L m -d-1), where L m is the maximum node depth of the initial address to the nodes in the N self-organizing subsystems, C m is the maximum number of child nodes corresponding to the initial address, d is the node depth of the initial address to the nodes in the N self-organizing subsystems, C skip (d) is the offset of the initial address to the nodes in the N self-organizing subsystems.

[0069] The node depth is the length of the unique path from the root node to the node in the data topology network, that is, the level where the node is located (the root node is level 0). In the tree data structure, the depth of the root node is defined as 0, the depth of the child nodes of the root node (the first-level nodes) is 1, and so on. For the entire tree, the depth of the tree is the maximum depth of the tree endpoint nodes. The node depth is the length of the path from the root node to the current node, and the depth of the root node is 0.

[0070] Specifically, step 10213 includes the following specific implementation methods:

[0071] C skip (d) = (1 + C m -R m -C m *R m Lm-d-1 ) / (1-R m ), L m is the maximum node depth of the initial address to the nodes in the N self-organizing subsystems, C mis the number of all child nodes corresponding to the initial address, d is the node depth of the initial address to the nodes in the N self-organizing subsystems, C skip (d) is the offset of the initial address to the nodes in the N self-organizing subsystems, R m is the total number of all nodes in N self-organizing subsystems.

[0072] 103. Extracting the minimum task distance in the task distance set;

[0073] In this embodiment, the task distance set has a total of 7 task distances, {N1, N2, N3, N4, N5, N6, N7}, of which the smallest is the task distance of N6. N6 is extracted from the task distance set, and the task distance set becomes {N1, N2, N3, N4, N5, N7}.

[0074] 104. Analyze the system state of the self-organizing subsystem corresponding to the minimum task distance;

[0075] In this embodiment, the system state of the ad hoc subsystem corresponding to N6 is analyzed, and the node of the task distance of N6 may be located in the third ad hoc subsystem, that is, the system state of the third ad hoc subsystem is analyzed.

[0076] 105. When the system status is busy, re-extracting the minimum task distance in the task distance set;

[0077] In this embodiment, if the system status of the third self-organizing subsystem is busy, it is necessary to re-extract the task distance set {N1, N2, N3, N4, N5, N7}, the minimum task distance is N2, and then analyze the system status of the self-organizing subsystem corresponding to N2 in the loop to step 104.

[0078] 106. When the system state is idle, sending the execution task to the self-organizing subsystem corresponding to the minimum task distance.

[0079] In this embodiment, if the system state of the third self-organizing subsystem is idle, the execution task needs to be sent to the third self-organizing subsystem corresponding to the minimum task distance.

[0080] Furthermore, after step 106, the following specific implementation is also included:

[0081] 1061. The self-organizing subsystem corresponding to the minimum task distance receives the execution task, and calls the node corresponding to the minimum task distance to execute the execution task.

[0082] In step 1061, the self-organizing subsystem corresponding to the minimum task distance is assumed to be the 6th self-organizing subsystem. The 6th self-organizing subsystem receives the execution task. The execution node that has previously calculated the minimum task distance is the 2nd node of the 6th self-organizing subsystem. The 6th self-organizing subsystem calls the 2nd node to process some data transmission, personnel communication and other tasks in the execution task.

[0083] In an embodiment of the present invention, by analyzing the starting address of the execution task, calculating the scheduling processing distance between the starting address and the self-organizing subsystem of the self-organizing network, using the scheduling processing distance to find the self-organizing subsystem closest to the starting address, the execution task is sent to the nearest self-organizing subsystem, and the task is processed by the nearest self-organizing subsystem, thereby achieving efficient scheduling within the self-organizing network, improving the transmission speed of the self-organizing network communication in the network scheduling, and overcoming the problem of signal delay and jamming caused by too long data processing time.

[0084] Figure 4 : is a structural diagram of a scheduling device for a self-organizing network provided by an embodiment of the present invention. The scheduling device 400 for the self-organizing network may have relatively large differences due to different configurations or performances, and may include one or more processors (central processing units, CPU) 410 (for example, one or more processors) and a memory 420, and one or more storage media 430 (for example, one or more mass storage devices) storing application programs 433 or data 432. Among them, the memory 420 and the storage medium 430 can be short-term storage or permanent storage. The program stored in the storage medium 430 may include one or more modules (not shown in the figure), and each module may include a series of instruction operations in the scheduling device 400 of the self-organizing network. Furthermore, the processor 410 can be configured to communicate with the storage medium 430 to execute a series of instruction operations in the storage medium 430 on the scheduling device 400 of the self-organizing network.

[0085] The scheduling device 400 based on the ad hoc network may also include one or more power supplies 440, one or more wired or wireless network interfaces 450, one or more input and output interfaces 460, and / or one or more operating systems 431, such as Windows Serve, Mac OS X, Unix, Linux, FreeBSD, etc. It can be understood by those skilled in the art that Figure 4 The structure of the scheduling device of the self-organizing network shown does not constitute a limitation on the scheduling device based on the self-organizing network, and may include more or less components than shown in the figure, or combine certain components, or arrange the components differently.

[0086] The present invention also provides a computer-readable storage medium, which may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium. Instructions are stored in the computer-readable storage medium. When the instructions are executed on a computer, the computer executes the steps of the scheduling method for the self-organizing network.

[0087] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, 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 of the foregoing.

[0088] In addition, although each operation is described in a specific order, this should be understood as requiring such operation to be performed in the specific order shown or in a sequential order, or requiring that all illustrated operations should be performed to obtain desired results. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details are included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single implementation in combination. On the contrary, the various features described in the context of a single implementation can also be implemented in multiple implementations individually or in any suitable sub-combination mode.

[0089] Although the subject matter has been described in language specific to structural features and / or methodological logical actions, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or actions described above. On the contrary, the specific features and actions described above are merely example forms of implementing the claims.

Claims

1. A scheduling method for an ad hoc network, characterized in that: The scheduling method of the ad hoc network is applied to the scheduling system of the ad hoc network, and the scheduling system of the ad hoc network includes: N ad hoc subsystems and a scheduling system, wherein N is a positive integer, and the scheduling method of the ad hoc network includes: The scheduling system receives the execution task and analyzes the initial address corresponding to the execution task, wherein the initial address is the networking address of the execution task in the ad hoc network; According to a preset distance analysis algorithm, the distances between the N self-organizing subsystems and the initial address are calculated to obtain a task distance set; Extracting the minimum task distance in the task distance set; Analyze the system state of the self-organizing subsystem corresponding to the minimum task distance; When the system status is busy, re-extracting the minimum task distance in the task distance set; When the system state is idle, the execution task is sent to the self-organizing subsystem corresponding to the minimum task distance.

2. The scheduling method for an ad hoc network according to claim 1, characterized in that: The distances between the N self-organizing subsystems and the initial address are calculated according to a preset distance analysis algorithm to obtain a task distance set including: Based on the number of nodes corresponding to the N self-organizing subsystems, calculating the offset between the initial address and each node; Calculate the network address corresponding to each node according to the offset corresponding to each node; According to the initial address, a distance calculation is performed on the networking address corresponding to each node to obtain an execution distance set.

3. The scheduling method for an ad hoc network according to claim 2, characterized in that: The calculating, based on the number of nodes corresponding to the N self-organizing subsystems, of the offset corresponding to each node of the initial address comprises: Determine whether the number of nodes corresponding to the N self-organizing subsystems is greater than 1; When there is no node number greater than 1, the offset between the initial address and each node is calculated based on a preset first calculation formula; When there is a node number greater than 1, the offset between the initial address and each node is calculated based on a preset second calculation formula.

4. The scheduling method for an ad hoc network according to claim 3, characterized in that: The calculating, based on the preset first calculation formula, the offset corresponding to the initial address and each node comprises: C skip (d) = 1 + C m *(L m -d-1), where L m is the maximum node depth of the initial address to the nodes in the N self-organizing subsystems, C m is the maximum number of child nodes corresponding to the initial address, d is the node depth of the initial address to the nodes in the N self-organizing subsystems, C skip (d) is the offset of the initial address to the nodes in the N self-organizing subsystems.

5. The scheduling method for an ad hoc network according to claim 4, characterized in that: The calculating, based on the preset second calculation formula, the offset corresponding to each node of the initial address comprises: C skip (d) = (1 + C m -R m -C m *R m Lm-d-1 ) / (1-R m ), L m is the maximum node depth of the initial address to the nodes in the N self-organizing subsystems, C m is the number of all child nodes corresponding to the initial address, d is the node depth of the initial address to the nodes in the N self-organizing subsystems, C skip (d) is the offset of the initial address to the nodes in the N self-organizing subsystems, R m is the total number of nodes in the N self-organizing subsystems.

6. The scheduling method for an ad hoc network according to claim 2, characterized in that: The calculating, according to the offset corresponding to each node, the networking address corresponding to each node comprises: A i =A p +C skip (d)*R m +i,i∈[1,C m -R m ], where C m is the maximum number of child nodes corresponding to the initial address, d is the node depth of the initial address to the nodes in the N self-organizing subsystems, C skip (d) is the offset of the initial address to the nodes in the N self-organizing subsystems, R m is the total number of nodes in N self-organizing subsystems, i is the i-th node, A i is the networking address of the ith node, A p is the initial address.

7. The scheduling method for an ad hoc network according to claim 2, characterized in that: The distance calculation is performed on the networking address corresponding to each node according to the initial address to obtain the execution distance set, which includes: N=A p +1+[(D-(A p +1) / C skip (d)]*C skip (d),D∈[A p ,A p +C skip (d-1)] Where [*] is the Gaussian rounding function, D is the execution address of the task in the ad hoc network, N is the execution distance, and A p is the initial address, C skip (d) is the offset of the initial address to the nodes in the N self-organizing subsystems, and d is the node depth of the initial address to the nodes in the N self-organizing subsystems.

8. The scheduling method for an ad hoc network according to claim 1, characterized in that: After sending the execution task to the self-organizing subsystem corresponding to the minimum task distance, the method further includes: The self-organizing subsystem corresponding to the minimum task distance receives the execution task, and calls the node corresponding to the minimum task distance to execute the execution task.

9. A scheduling device for an ad hoc network, characterized in that: The scheduling device of the ad hoc network includes: a memory and at least one processor, the memory stores instructions, and the memory and the at least one processor are interconnected through a line; The at least one processor calls the instruction in the memory to enable the scheduling device of the ad hoc network to execute the scheduling method of the ad hoc network as described in any one of claims 1-8.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the scheduling method for an ad hoc network as described in any one of claims 1 to 8 is implemented.

Images