Emergency communication command method and system for centerless ad hoc network

Abstract

The invention relates to a centerless ad hoc network emergency communication command method and system. The method comprises the following steps: allocating communication frequencies, channel resources, power control parameters and routing strategies to all nodes in a network; generating an initial connection relation table between the nodes and an initial topological structure of the network according to the communication frequency and the channel resources; distributing a routing path leading to other nodes for each node and recording the routing path; collecting real-time communication load data of a link on a routing path, and calculating a link communication congestion degree; updating a node connection relation and a routing path according to the congestion degree; generating an emergency communication task model, determining task priorities, and distributing tasks to nodes meeting conditions; and the communication frequency, the channel resource and the routing path of the node are synchronously updated, and the node in the ad hoc network is started to execute the emergency communication task, so that the network performance and the task scheduling reliability are improved.

Description

Technical Field

[0001] The present invention relates to the field of wireless communication technologies, and more particularly, to a centerless ad-hoc network emergency communication command method and system. Background Art

[0002] In modern communication technologies, a centerless ad-hoc network is a form of wireless network that does not require fixed infrastructure support. Its nodes can automatically discover, connect, and dynamically maintain the network topology. Centerless ad-hoc networks are widely used in disaster relief, military communication, emergency command, and other scenarios, and have the characteristics of flexible deployment and strong adaptability. However, since this network operates with a distributed architecture and lacks centralized management, how to efficiently organize network resources, optimize communication links, and ensure the timeliness and reliability of task scheduling has always been a key challenge in this technical field.

[0003] In emergency communication scenarios, centerless ad-hoc networks need to face dynamic and changing network environments, limited node resources, and complex and diverse communication task requirements. Existing technologies usually rely on simple signal strength judgment or static topology generation methods to construct network structures. This approach is difficult to adapt to real-time load changes and task scheduling requirements in complex scenarios, and is prone to communication link congestion, uneven task distribution, and a decline in the overall network performance. In addition, for the allocation and execution of emergency tasks, existing methods are mostly based on single-dimensional priority evaluation, without fully considering the comprehensive evaluation of node resources, communication link status, and task requirements, resulting in insufficient task allocation efficiency and communication reliability. Summary of the Invention

[0004] The present invention provides a centerless ad-hoc network emergency communication command method and system, aiming to solve the problems of low efficiency in dynamically constructing network topologies, serious communication link congestion, and uneven distribution of emergency tasks in the prior art.

[0005] To achieve the above objective, the first aspect of the present invention provides a centerless ad-hoc network emergency communication command method, including the following steps:

[0006] Allocate communication frequencies, channel resources, power control parameters, and routing strategies for all nodes in the network;

[0007] Generate an initial connection relationship table between nodes under the condition of meeting the connection conditions according to the communication frequencies and channel resources of the nodes;

[0008] Form an initial topology structure of the network based on the initial connection relationship table between nodes;

[0009] Based on the network topology structure, allocate a routing path to each node leading to other nodes and record the routing information;

[0010] Collect load data for each link on the routing path and record the real-time communication load data of the link;

[0011] Calculate the communication congestion degree of each link based on the real-time communication load data of the routing link;

[0012] Reallocate the node connection relationships in the network according to the communication congestion degree of the link and update the routing path;

[0013] Regenerate the network topology based on the adjusted node connection relationships and allocate new routing paths;

[0014] Generate an emergency communication task model according to the network topology and the preset task requirements, and determine the task priorities;

[0015] Allocate specific tasks to eligible nodes according to the emergency communication task model and the task priorities;

[0016] Synchronously update the communication frequencies, channel resources and routing paths of the nodes based on the task allocation results;

[0017] Start each node in the ad hoc network to execute the emergency communication task according to the allocated tasks and the updated communication parameters.

[0018] Further, the method for generating the initial connection relationship table between nodes includes the following steps:

[0019] Each node periodically sends signal detection packets to other nodes within its coverage area and records the signal strength of the signal detection packets received from other nodes;

[0020] For the received signal detection packets, check whether there is a conflict in the channel resources between the sending node and the local node. If there is no conflict, record this node as a connectable node;

[0021] For the connectable nodes whose signal strength meets the preset threshold, further check whether their communication frequencies match the local node. If they match, continue to the next step;

[0022] For the connectable nodes with matching communication frequencies, calculate whether the signal strength difference value meets the power ratio constraint for node connection. If it meets, mark them as candidate connection nodes;

[0023] Based on the results of channel resource matching, communication frequency verification and power difference calculation, verify whether each candidate connection node meets the preset connection conditions one by one;

[0024] Record the nodes that meet all connection conditions as the connectable nodes of the local node, and form an initial connection relationship table including node identifiers, signal strengths, channel allocations and communication frequencies;

[0025] Perform a two-way verification operation on each node in the initial connection relationship table to make the marked connection relationship a two-way connection, and finally determine the valid connection relationship of the nodes.

[0026] Further, the specific formula for power difference calculation is:

[0027] ΔP ij =|P i -P j |

[0028] Among them, ΔP ij represents the power difference between node i and node j, P i represents the transmission signal power of node i, and P j represents the received signal power of node j;

[0029] The calculation formula for the power ratio constraint in connection condition verification is:

[0030]

[0031] Among them, R ij represents the ratio of the received signal power of node j to the transmission signal power of node i;

[0032] The determination rule for meeting the connection condition is:

[0033] When ΔP ij ≤ΔP max , the power difference between node i and node j meets the constraint condition, where ΔP max represents the preset maximum power difference threshold;

[0034] When R ij ≥R min and R ij ≤R max , the power ratio R ij meets the connection condition, where R min and R max are the preset minimum and maximum power ratio thresholds respectively.

[0035] Further, the method for forming the initial topology structure of the network based on the initial connection relationship table between nodes includes the following steps:

[0036] Extract the connection pair information of each node from the initial connection relationship table to form a set of node pairs {(i,j)}, where i and j are the node identifiers in the connection pair respectively;

[0037] According to the signal strength S ij and the link quality index Q ij of the node pair, calculate the connection weight between node i and node j, and the specific formula is:

[0038] W ij = αS ij + βQ ij

[0039] Wherein, W ij represents the connection weight, S ij represents the signal strength between nodes i and j, Q ij represents the link quality index, and α and β are weight coefficients;

[0040] According to the node pair set {(i, j)} and the calculated connection weight W ij , a weighted undirected graph G(V, E, W) including all nodes and edges is generated, where V represents the node set, E represents the connection edge set, and W represents the edge weight;

[0041] Execute the minimum spanning tree algorithm on the weighted undirected graph G(V, E, W), and select the edge set E′ with the minimum total weight between nodes as the core connection in the initial topology;

[0042] For the initially generated core connection E′, check whether the degree of each node meets the preset redundant connection requirement. If the connection degree of a certain node is lower than the requirement, select an edge from the edge set E\E′ according to the weight priority principle for supplementation until the redundancy condition is met;

[0043] Perform connectivity verification on the updated connection set E″ to make all nodes in the same connected subgraph;

[0044] Take the finally formed node set V and edge set E″ as the initial topology of the network.

[0045] Furthermore, the method for calculating the communication congestion degree of each link based on the real-time communication load data of the routing link includes the following steps:

[0046] Perform real-time monitoring on each routing link, and record the data traffic F ij passing through the link within a preset time window, where F ij represents the real-time communication traffic between nodes i and j;

[0047] Based on the maximum available bandwidth B ij of the link and the real-time data traffic F ij , calculate the bandwidth utilization rate of the link. The specific formula is:

[0048]

[0049] Wherein, U ij represents the bandwidth utilization rate of the link, and B ij is the predefined maximum bandwidth value of the link;

[0050] Send data packets of a fixed size over each link, and record the round-trip delay D of the data packet from node i to node j ij ;

[0051] Record the number of lost packets L through the nodes on the link ij , and calculate the congestion loss rate of the link. The specific formula is:

[0052]

[0053] where C ij represents the congestion loss rate of the link, L ij is the number of lost packets, and N ij is the total number of packets sent;

[0054] Combined with the bandwidth utilization U ij , the delay D ij and the congestion loss rate C ij , calculate the communication congestion degree of the link through a weighted formula. The specific formula is:

[0055] O ij =γ1U ij +γ2D ij +λ3C ij

[0056] where O ij represents the communication congestion degree of the link, and γ1, γ2, and γ3 are the weight coefficients of the bandwidth utilization, delay, and congestion loss rate respectively, and satisfy γ1 + γ2 + γ3 = 1;

[0057] Perform normalization processing on the communication congestion degree O ij of all links. The specific formula is:

[0058]

[0059] where O′ ij is the normalized communication congestion degree, and O min and O max are the minimum and maximum communication congestion degree values among all links respectively;

[0060] Record the node identifier, the normalized communication congestion degree, and other monitoring parameters of each link into the link congestion table as input data for subsequent network optimization.

[0061] Furthermore, the method for generating an emergency communication task model and determining task priorities based on the network topology and preset task requirements includes the following steps:

[0062] Extract the connection relationships, link bandwidths, communication delays, available computing resources, and available storage resources of each node from the network topology;

[0063] Define task requirements according to the emergency scenario, and determine the parameters of each task, including data volume, computing requirements, delay constraints, and task priority factors;

[0064] Divide the tasks into multiple task groups according to the relevance between tasks, and each task group contains several independent or related tasks;

[0065] For each task, calculate the task adaptability score of the node according to the available resources of the node and the task requirements. The specific formula is:

[0066]

[0067] Among them, A ik is the adaptability score of node i for task k, C i and S i are the computing resources and storage resources of node i, R k and V k are the computing requirements and data volume of task k, D ij is the delay of the task transmission link, T k is the delay constraint of the task;

[0068] For each task, combine the priority factor of the task requirements and the adaptability score to calculate the comprehensive priority of the task. The specific formula is:

[0069]

[0070] Among them, U k is the comprehensive priority of task k, and V is the set of all available nodes in the network;

[0071] Sort all tasks in descending order according to the comprehensive priority, and preferentially allocate high-priority tasks to the suitable nodes in the network;

[0072] Record the sorted tasks, their priorities, and the adaptability scores of tasks and nodes into the task model, and establish a collaboration graph between tasks according to the grouping situation, where each edge represents data or control dependencies between tasks;

[0073] Provide the emergency communication task model containing task allocation priorities, task-node adaptation relationships, and collaboration graphs to the subsequent communication command plan generation steps.

[0074] Furthermore, the method for generating the collaboration graph between tasks includes the following steps:

[0075] Regard each task as a node in a graph, where the node contains the computing requirements, data volume, and priority attributes of the task;

[0076] According to the task grouping results and task correlation calculations, add edges between task nodes, where the edge weight represents the correlation between tasks;

[0077] Use the shortest path algorithm to optimize the critical path in the collaboration graph;

[0078] Generate a task collaboration graph containing task nodes, task edges, and optimized paths as input data for subsequent task allocation.

[0079] Furthermore, the task grouping includes the following specific methods:

[0080] For every two tasks, calculate the correlation between tasks based on the communication data volume and task execution timing requirements of task dependencies;

[0081] According to the task correlation, use the hierarchical clustering algorithm to divide tasks into multiple task groups, where the correlation within the task group is high and the correlation between task groups is low.

[0082] To achieve the above object, the second aspect of the present invention provides a centerless ad hoc network emergency communication command system, including the following modules:

[0083] A node configuration module for allocating communication frequencies, channel resources, power control parameters, and routing strategies for all nodes in the network;

[0084] An initial connection generation module for generating an initial connection relationship table between nodes under the condition of meeting the connection conditions according to the communication frequencies and channel resources of the nodes;

[0085] A network topology construction module for forming an initial topology structure of the network based on the initial connection relationship table between nodes;

[0086] A routing allocation module for allocating routing paths leading to other nodes for each node based on the network topology structure and recording routing information;

[0087] A load monitoring module for collecting load data for each link on the routing path and recording the real-time communication load data of the link;

[0088] A congestion degree calculation module for calculating the communication congestion degree of each link based on the real-time communication load data of the routing link;

[0089] A connection relationship adjustment module for reallocating the node connection relationship in the network according to the communication congestion degree of the link and updating the routing path;

[0090] A topology optimization module, which is used to regenerate the network topology based on the adjusted node connection relationship and allocate new routing paths;

[0091] A task modeling module, which is used to generate an emergency communication task model according to the network topology and preset task requirements, and determine the task priorities;

[0092] A task allocation module, which is used to allocate specific tasks to eligible nodes according to the emergency communication task model and task priorities;

[0093] A parameter synchronization module, which is used to synchronously update the communication frequencies, channel resources and routing paths of nodes based on the task allocation results;

[0094] A task execution module, which is used to start each node in the ad hoc network to execute the emergency communication task according to the allocated tasks and the updated communication parameters.

[0095] Furthermore, the network topology construction module includes:

[0096] A node pair extraction unit, which is used to extract the connection pair information of each node from the initial connection relationship table to form a node pair set, where each node pair consists of two node identifiers;

[0097] A weight calculation unit, which is used to calculate the connection weights between node pairs according to the signal strength and link quality index of the node pairs. The specific formula is:

[0098] W ij =αS ij +βQ ij

[0099] Among them, W ij represents the connection weight, S ij represents the signal strength between node i and node j, Q ij represents the link quality index, and α and β are weight coefficients;

[0100] A weighted graph generation unit, which is used to generate a weighted undirected graph containing all nodes and edges according to the node pair set and the calculated connection weights;

[0101] A minimum spanning tree generation unit, which is used to execute the minimum spanning tree algorithm on the weighted undirected graph and select the edge set with the minimum total weight between nodes as the core connection in the initial topology structure;

[0102] A redundant connection supplement unit, which is used to check whether the connection degree of each node meets the preset redundant connection requirements. If the connection degree of a certain node is lower than the requirement, edges are selected from the edge set according to the weight priority principle for supplementation until the redundancy condition is met;

[0103] A connectivity verification unit for performing connectivity verification on the updated connection set to ensure that all nodes are in the same connected subgraph;

[0104] A topology output unit for outputting the finally formed node set and edge set as the initial topology structure of the network.

[0105] Advantages of the present invention:

[0106] Compared with the prior art, a centerless ad-hoc network emergency communication command method and system provided by the present invention solve the problems of low efficiency in dynamically constructing network topology, serious congestion of communication links, and uneven distribution of emergency tasks through the following technical solutions: First, based on multi-dimensional conditions such as signal strength between nodes, channel resource matching, communication frequency verification, and power difference calculation, an initial connection relationship table between nodes is constructed, and the minimum spanning tree algorithm is combined with redundant connection optimization to generate an efficient and reliable initial topology structure of the network, improving the efficiency of dynamically constructing the network topology; Second, by collecting real-time communication load data of routing links, calculating the communication congestion degree in combination with multiple indicators such as bandwidth utilization rate, delay, and packet loss rate, and optimizing the node connection relationship and routing path with the standardized processing results, effectively alleviating the congestion problem of communication links; Finally, in the process of task allocation, by combining the priority factor of task requirements with the adaptability score of node resources, comprehensively considering the computing requirements, data volume, transmission delay, and node resource status of the task, using the grouping and collaborative graph modeling method to achieve precise and priority allocation of tasks, thus solving the problem of uneven distribution of emergency tasks and significantly improving the overall performance of the network and the reliability of task scheduling. Description of the Drawings

[0107] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings required for description in the embodiments will be briefly introduced below.

[0108] Figure 1 It is a schematic diagram of a centerless ad-hoc network emergency communication command method disclosed in an embodiment of the present invention.

[0109] Figure 2 It is a flowchart of generating a node connection relationship disclosed in an embodiment of the present invention.

[0110] Figure 3 It is a schematic diagram of generating a network topology disclosed in an embodiment of the present invention.

[0111] Figure 4 It is a flowchart of calculating communication congestion degree disclosed in an embodiment of the present invention.

[0112] Figure 5 It is a flowchart of generating an emergency communication task model disclosed in an embodiment of the present invention. Detailed Embodiments

[0113] In order to enable those skilled in the art to better understand the solution of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0114] According to the embodiments of the present invention, it should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. And although the logical order is shown in the following methods, in some cases, the steps shown or described can be executed in a different order than here.

[0115] As Figure 1 shown, the present invention provides a centerless ad hoc emergency communication command method, including the following steps:

[0116] Step S100: Allocate communication frequencies, channel resources, power control parameters, and routing strategies for all nodes in the network;

[0117] Step S200: Generate an initial connection relationship table between nodes under the condition of meeting the connection conditions according to the communication frequencies and channel resources of the nodes;

[0118] Step S300: Form an initial topology structure of the network based on the initial connection relationship table between nodes;

[0119] Step S400: Based on the network topology structure, allocate a routing path to each node leading to other nodes and record the routing information;

[0120] Step S500: Collect load data for each link on the routing path and record the real-time communication load data of the link;

[0121] Step S600: Calculate the communication congestion degree of each link based on the real-time communication load data of the routing link;

[0122] Step S700: Reallocate the node connection relationships in the network according to the communication congestion degree of the link and update the routing path;

[0123] Step S800: Based on the adjusted node connection relationships, regenerate the network topology and allocate new routing paths;

[0124] Step S900: Generate an emergency communication task model according to the network topology and preset task requirements, and determine the task priority;

[0125] Step S1000: According to the emergency communication task model and task priorities, allocate specific tasks to eligible nodes;

[0126] Step S1100: Based on the task allocation results, synchronously update the communication frequencies, channel resources, and routing paths of the nodes;

[0127] Step S1200: According to the allocated tasks and updated communication parameters, start each node in the ad hoc network to execute the emergency communication tasks.

[0128] In this embodiment, as described in the above step S100, allocate communication frequencies, channel resources, power control parameters, and routing strategies to all nodes in the network, which specifically includes the following steps: First, according to the preset spectrum resource range and the number of channels, use a spectrum allocation algorithm to allocate a unique communication frequency and channel to each node to avoid channel conflicts; Second, according to the geographical location, energy state, and preset power limit of the nodes, dynamically allocate the transmission power and receiving sensitivity of the nodes to ensure that the signal quality within the communication coverage meets the requirements; Then, according to the overall communication requirements of the network, formulate an initial routing strategy, and use a distributed routing table generation algorithm to establish an initial routing table from each node to other nodes; Finally, store the allocated frequencies, channel resources, power control parameters, and routing strategies in the configuration files of each node to provide a basic configuration for subsequent steps.

[0129] In this embodiment, as described in the above step S200, according to the communication frequencies and channel resources of the nodes, generate an initial connection relationship table between the nodes when the connection conditions are met, as shown in Figure 2 , which specifically includes the following steps: First, each node periodically sends signal detection packets to other nodes within its coverage range and records the signal strength of the received signal detection packets; Then, check whether there is a conflict in the channel resources between the receiving node and the sending node. If there is no conflict, record this node as a connectable node; Next, for the connectable nodes whose signal strength meets the preset threshold, verify whether their communication frequencies match. If they match, further calculate the power difference between the nodes and verify whether it meets the preset power ratio constraint conditions; Finally, record all the nodes that meet the channel resource matching, communication frequency verification, and power ratio constraint conditions as the connectable nodes of this node, and perform a two-way verification operation to generate an initial connection relationship table including node identifiers, signal strengths, channel allocations, and communication frequencies, providing data support for subsequent topology construction.

[0130] The specific formula for power difference calculation is:

[0131] ΔP ij =|P i -P j |

[0132] Among them, ΔP ij represents the power difference between node i and node j, and P i represents the transmission signal power of node i, and P j represents the received signal power of node j;

[0133] The calculation formula for the power ratio constraint in the connection condition verification is:

[0134]

[0135] Among them, R ij represents the ratio of the received signal power of node j to the transmission signal power of node i;

[0136] The determination rule for meeting the connection condition is:

[0137] When ΔP ij ≤ΔP max , the power difference between node i and node j meets the constraint condition, where ΔP max represents the preset maximum power difference threshold;

[0138] When R ij ≥R min and R ij ≤R max , the power ratio R ij meets the connection condition, where R min and R max are the preset minimum and maximum power ratio thresholds respectively.

[0139] It can be understood that this technical solution accurately screens out node pairs that meet the preset connection conditions and generates an initial connection relationship table through multi-dimensional verification methods such as periodically sending signal detection packets, combined with channel resource matching verification, communication frequency matching verification, and power difference calculation. This solution realizes a comprehensive evaluation and screening of the effective connection relationships between nodes, avoids connection failures caused by channel conflicts or signal mismatches, and at the same time ensures the two-way consistency of the connection relationships, laying a foundation of high reliability and high precision for the subsequent network topology construction.

[0140] In this embodiment, as described in step S300 above, an initial topology structure of the network is formed based on the initial connection relationship table between nodes, as shown in Figure 3 , which specifically includes the following steps: First, extract the connection pair information of each node from the initial connection relationship table to form a set of node pairs {(i,j)}, where each node pair consists of two node identifiers; then, calculate the connection weight between node pairs according to the signal strength and link quality index of the node pairs, and the specific formula is:

[0141] W ij =αSij +βQ ij

[0142] Wherein, W ij represents the connection weight, S ij represents the signal strength between node i and node j, Q ij represents the link quality index, and α and β are weight coefficients;

[0143] Next, according to the calculated connection weights, a weighted undirected graph G(V, E, W) including all nodes and edges is generated; subsequently, the minimum spanning tree algorithm is executed on this weighted undirected graph, and the edge set with the minimum total weight between nodes is selected as the core connection of the initial topological structure; next, it is checked whether the connection degree of each node meets the preset redundant connection requirements, and if not, edges are selected from the edge set according to the connection weight priority principle for supplementation; finally, the connectivity verification of the updated edge set is performed to ensure that all nodes are in the same connected subgraph, and finally the initial topological structure of the network is generated. Through this solution, the dynamic and efficient construction from the initial connection relation table to the complete network topological structure is realized, which not only improves the efficiency of topology generation, but also enhances the reliability and adaptability of the network.

[0144] It should be noted that a "weighted undirected graph" is a graphical data structure, where the nodes represent various entities in the network, and the edges represent the connections between nodes, and each edge is assigned a weight value. This weight represents other important metrics such as the cost, quality of the connection, such as signal strength or link quality. In network design and analysis, weighted undirected graphs are used to simulate and optimize the connection relationships between nodes, and the weights help determine the optimal connection paths to achieve efficient and reliable network communication.

[0145] In this embodiment, as described in step S400 above, based on the network topological structure, a routing path leading to other nodes is assigned to each node and the routing information is recorded, which specifically includes the following steps: First, using the generated network topological structure, the neighbor node information of each node is extracted, and the routing table of the node is initialized; then, a distributed routing algorithm is adopted, and according to the connection weights and link quality indexes between nodes, the shortest path or the optimal path from the source node to the target node is calculated; next, the calculated path information, including the intermediate nodes, the total path weight and the link parameters, is updated to the routing table of the source node in sequence; finally, the routing tables of all nodes are synchronized to ensure that each node in the network has complete routing information.

[0146] In this embodiment, as described in step S500 above, load data is collected for each link on the routing path and the real-time communication load data of the link is recorded, which specifically includes the following steps: First, a data collection module is deployed on each link to monitor the data traffic passing through the link in a preset time window in real time; Second, the current bandwidth utilization rate of the link, the communication delay between nodes, and the number of packet losses in data transmission are collected; Then, the collected link traffic data, communication delay, and number of packet losses are stored in the link status table; Finally, through the status synchronization mechanism between nodes in the network, the real-time load data of the link is summarized into the whole network status database.

[0147] In this embodiment, as described in step S600 above, based on the real-time communication load data of the routing link, the communication congestion degree of each link is calculated, as shown in Figure 4 , which specifically includes the following steps: First, according to the real-time data traffic F ij of the link and the maximum available bandwidth B ij , the bandwidth utilization rate U ij of the link is calculated. The formula is:

[0148]

[0149] where U ij represents the bandwidth utilization rate of the link, and B ij is the predefined maximum bandwidth value of the link;

[0150] Second, the round-trip delay D ij of the link is measured by sending a fixed-size data packet and recorded; Then, according to the number of packet losses L ij on the link and the total number of sent packets N ij , the congestion loss rate of the link is calculated:

[0151]

[0152] where C ij represents the congestion loss rate of the link, L ij is the number of packet losses, and N ij is the total number of sent packets;

[0153] Subsequently, combining the bandwidth utilization rate, delay, and congestion loss rate, a weighted formula is used to calculate the communication congestion degree:

[0154] O ij = γ1U ij + γ2D ij + λ3C ij

[0155] where O ijIt represents the communication congestion degree of the link. γ1, γ2, and γ3 are the weight coefficients of the bandwidth utilization rate, delay, and congestion loss rate respectively, and satisfy γ1 + γ2 + γ3 = 1;

[0156] Finally, standardize the calculated congestion degree and store the result in the link status table to provide a basis for subsequent network optimization. The specific formula for standardization is as follows:

[0157]

[0158] Among them, O′ ij is the standardized communication congestion degree, O min and O max are the minimum and maximum communication congestion degree values among all links respectively.

[0159] In this step, by combining the three key parameters of bandwidth utilization rate, delay, and congestion loss rate, a weighted formula is used to calculate the communication congestion degree, avoiding the limitations of single-dimensional congestion assessment. The use of traffic data within the time window and dynamic parameter monitoring realizes real-time performance, enhancing the ability to quickly respond to network changes. The standardization formula is used to unify the congestion degree range, facilitating direct comparison across links and adaptation of network optimization algorithms.

[0160] In this embodiment, as described in step S700 above, extract the standardized communication congestion degree and related link parameters of each link from the link status table; secondly, identify the high-congestion links whose communication congestion degree exceeds the preset threshold, and mark the corresponding node pairs in the network; then, based on the congestion degree distribution of the high-congestion links, preferentially select the node pairs adjacent to the low-congestion links, and re-adjust the node connection relationship according to the principle of the lowest communication cost; subsequently, update the neighbor table and connection relationship table of the affected nodes, and re-execute the routing path allocation algorithm to calculate the new optimal path; finally, synchronize the updated connection relationship and routing path, and write the result into the routing table of the node.

[0161] In this embodiment, as described in step S800 above, use the updated node connection relationship table to re-extract the node pair information and construct a new weighted undirected graph, where the edge weights are calculated from the signal strength and link quality index between nodes; secondly, based on the new weighted undirected graph, re-execute the minimum spanning tree algorithm to generate the core connection, and supplement the edge set according to the preset redundant connection requirements to ensure the reliability and connectivity of the topology; then, verify whether the generated network topology meets the requirements of full-network connectivity. If there are isolated nodes, preferentially select low-cost connections for supplementation; finally, based on the new network topology structure, re-run the distributed routing algorithm to allocate the routing path from each node to other nodes, and store the updated network topology and routing information in the routing table of the node.

[0162] In this embodiment, as described in the above step S900, an emergency communication task model is generated according to the network topology and preset task requirements, and the task priorities are determined. See Figure 5 , which specifically includes the following steps: First, extract information such as the connection relationship of nodes, link bandwidth, communication delay, computing resources, and storage resources of nodes from the network topology; Second, combine the task requirements defined in the emergency scenario to determine the parameters of each task, including data volume, computing requirements, delay constraints, and initial priority factors; Then, based on the relevance between tasks (such as the communication data volume and timing requirements on which tasks depend), divide the tasks into multiple task groups, and generate a collaboration graph for each group of tasks; Subsequently, for each task, use the resource information of the nodes and the task requirements to calculate the task adaptability score of the nodes. The specific formula is:

[0163]

[0164] where A ik is the adaptability score of node i for task k, C i and S i are the computing resources and storage resources of node i, R k and V k are the computing requirements and data volume of task k, D ij is the delay of the task transmission link, and T k is the delay constraint of the task;

[0165] Calculate the comprehensive priority of the task in combination with the task priority factor. The formula is:

[0166]

[0167] where U k is the comprehensive priority of task k, and V is the set of all available nodes in the network;

[0168] Finally, sort the tasks in descending order according to the comprehensive priority to generate an emergency communication task model including task allocation priorities and node adaptation relationships, providing a basis for task allocation.

[0169] The calculation of the priority in this step comprehensively considers the computing resources, storage resources, transmission delay of the nodes and task requirements, avoiding the deficiencies of single-dimensional calculation in traditional methods. In the task adaptability score formula, the adaptability degree of each node to the task is calculated through a unique adaptability score formula, and the node resource distribution is introduced in the priority calculation, improving the accuracy of task allocation; In the task collaboration modeling step, the relevance between tasks is represented as a collaboration graph, providing a theoretical basis for the distributed execution of complex emergency tasks; In addition, through the dual mechanisms of task grouping and comprehensive priority sorting, a global optimal task allocation strategy is realized.

[0170] Preferably, the method for generating a collaboration graph between tasks includes: regarding each task as a node in the graph, where the node contains the computing requirements, data volume, and priority attributes of the task; calculating and adding edges between task nodes according to the task grouping result and task relevance calculation, and the edge weight represents the relevance between tasks; optimizing the critical path in the collaboration graph using the shortest path algorithm; generating a task collaboration graph including task nodes, task edges, and optimized paths as the input data for subsequent task allocation.

[0171] Preferably, task grouping includes: for every two tasks, calculating the relevance between tasks based on the communication data volume of task dependencies and the requirements of task execution timing; according to the task relevance, using the hierarchical clustering algorithm to divide tasks into multiple task groups, with high relevance within the task group and low relevance between task groups.

[0172] In this embodiment, as described in step S1000 above, extract the highest-priority task from the task model according to the task allocation priority, and query the set of nodes with the highest scores in the task adaptability score; secondly, on the premise of meeting the task computing requirements, data volume, and latency constraints, preferentially allocate tasks to the nodes with the highest scores; then, for the associated tasks in the task group, according to the task dependency relationship in the collaboration graph, allocate tasks to adjacent adapted nodes, and allocate dedicated routing links for communication between tasks; subsequently, check the resource utilization rate and current task load of all nodes, and dynamically adjust the node allocation of low-priority tasks to ensure the resource requirements of high-priority tasks; finally, record the allocated tasks and node mappings in the allocation table, and synchronously update the node status.

[0173] In this embodiment, as described in step S1100 above, adjust the communication frequency and channel resource allocation of the nodes according to the task information of each node in the task allocation table to ensure that the allocated channels and frequencies meet the bandwidth and interference constraints of the tasks; update the routing table of the nodes according to the allocated task routing links, add routing paths related to the tasks, and remove invalid paths; broadcast the updated information such as the frequency, channel, and routing path of the nodes to the neighbor nodes directly connected to it to ensure the consistency of the local network; through the multi-hop synchronization mechanism between nodes, gradually update the connection relationship and routing status of the entire network; finally, perform an integrity check on the resource allocation results and routing tables of the entire network to ensure that the communication parameters and routing paths of all tasks are updated in place.

[0174] In this embodiment, as described in the above step S1200, each node loads the corresponding task data and communication parameters according to the allocation table, including frequency, channel resources, routing paths, etc.; the nodes start the computing, storage, and communication functions in sequence according to the task priorities, execute the specified task operations, and transmit necessary data or control information to other task nodes through the preset routing paths; monitor the execution status of the tasks in real time, including the completion of data transmission, the usage of node resources, and the link status, and record them in the task monitoring log; if problems such as link interruption or insufficient resources are detected during the task execution, trigger the dynamic adjustment mechanism to optimize the task parameters, routing, or resource allocation in real time; finally, after all tasks are completed, each node reports the task execution results and status back to the network management module to complete the closed-loop operation of the emergency communication task.

[0175] According to another aspect of the embodiments of the present application, a centerless ad-hoc network emergency communication command system is further provided, including the following modules:

[0176] A node configuration module, configured to allocate communication frequencies, channel resources, power control parameters, and routing strategies for all nodes in the network;

[0177] An initial connection generation module, configured to generate an initial connection relationship table between nodes under the condition of meeting the connection conditions according to the communication frequencies and channel resources of the nodes;

[0178] A network topology construction module, configured to form an initial topology structure of the network based on the initial connection relationship table between nodes;

[0179] A routing allocation module, configured to allocate routing paths leading to other nodes for each node based on the network topology structure and record the routing information;

[0180] A load monitoring module, configured to collect load data for each link on the routing path and record the real-time communication load data of the link;

[0181] A congestion degree calculation module, configured to calculate the communication congestion degree of each link based on the real-time communication load data of the routing link;

[0182] A connection relationship adjustment module, configured to reallocate the node connection relationships in the network according to the communication congestion degree of the links and update the routing paths;

[0183] A topology optimization module, configured to regenerate the network topology based on the adjusted node connection relationships and allocate new routing paths;

[0184] A task modeling module, configured to generate an emergency communication task model according to the network topology and preset task requirements and determine the task priorities;

[0185] A task allocation module, which is used to allocate specific tasks to eligible nodes according to the emergency communication task model and task priorities;

[0186] A parameter synchronization module, which is used to synchronously update the communication frequencies, channel resources and routing paths of nodes based on the task allocation results;

[0187] A task execution module, which is used to start each node in the ad hoc network to execute the emergency communication task according to the allocated tasks and the updated communication parameters.

[0188] Preferably, the network topology construction module includes:

[0189] A node pair extraction unit, which is used to extract the connection pair information of each node from the initial connection relation table to form a node pair set, where each node pair consists of two node identifiers;

[0190] A weight calculation unit, which is used to calculate the connection weight between node pairs according to the signal strength and link quality index of the node pairs. The specific formula is:

[0191] W ij =αS ij +βQ ij

[0192] Among them, W ij represents the connection weight, S ij represents the signal strength of node i and node j, Q ij represents the link quality index, and α and β are weight coefficients;

[0193] A weighted graph generation unit, which is used to generate a weighted undirected graph containing all nodes and edges according to the node pair set and the calculated connection weights;

[0194] A minimum spanning tree generation unit, which is used to execute the minimum spanning tree algorithm on the weighted undirected graph and select the edge set with the minimum total weight between nodes as the core connection in the initial topology structure;

[0195] A redundant connection supplement unit, which is used to check whether the connection degree of each node meets the preset redundant connection requirements. If the connection degree of a certain node is lower than the requirement, edges are selected from the edge set according to the weight priority principle for supplementation until the redundancy condition is met;

[0196] A connectivity verification unit, which is used to perform connectivity verification on the updated connection set to ensure that all nodes are in the same connected subgraph;

[0197] A topology output unit, which is used to output the finally formed node set and edge set as the initial topology structure of the network.

[0198] In the above embodiments of the present invention, the descriptions of the respective embodiments each have their own focuses. For the parts not detailed in a certain embodiment, reference may be made to the relevant descriptions of other embodiments.

[0199] In several embodiments provided by the present application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are merely illustrative. For example, the division of the units can be a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed couplings or direct couplings or communication connections to each other can be through some interfaces. The indirect couplings or communication connections of the units or modules can be in electrical or other forms.

[0200] In addition, in each embodiment of the present invention, the functional units can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

[0201] If the above-mentioned integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or all or part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in each embodiment of the present invention. The foregoing storage medium includes: various media such as USB flash drives, read-only memories (ROMs), random access memories (RAMs), mobile hard disks, magnetic disks, or optical discs that can store program codes.

[0202] The above are only the preferred embodiments of the present invention. It should be noted that for those of ordinary skill in the art, without departing from the principle of the present invention, several improvements and refinements can still be made, and these improvements and refinements should also be regarded as the protection scope of the present invention.

Claims

1. A method for commanding emergency communications in a centerless ad hoc network, characterized in that: The steps include: Allocate communication frequencies, channel resources, power control parameters and routing strategies to all nodes in the network; According to the communication frequency and channel resources of the nodes, an initial connection relationship table between the nodes is generated when the connection conditions are met; Based on the initial connection relationship table between nodes, the initial topological structure of the network is formed; Based on the network topology, each node is assigned a routing path to other nodes and the routing information is recorded; Collect load data for each link on the routing path and record the real-time communication load data of the link; Based on the real-time communication load data of the routing links, the communication congestion of each link is calculated; According to the communication congestion of the link, the node connection relationship in the network is reallocated and the routing path is updated; Based on the adjusted node connection relationship, the network topology is regenerated and a new routing path is allocated; Generate emergency communication task model and determine task priority according to network topology and preset task requirements; According to the emergency communication task model and task priority, specific tasks are assigned to qualified nodes; Based on the task allocation results, the communication frequency, channel resources and routing paths of the nodes are synchronously updated; According to the assigned tasks and updated communication parameters, each node in the ad hoc network is started to perform emergency communication tasks.

2. The centerless ad hoc network emergency communication command method according to claim 1, characterized in that: The method for generating an initial connection relationship table between nodes comprises the following steps: Each node periodically sends signal detection packets to other nodes within its coverage area and records the signal strength of the signal detection packets received from other nodes; For the received signal detection packet, check whether the channel resources between the sending node and the current node conflict. If there is no conflict, record the node as a connectable node. For connectable nodes whose signal strength meets the preset threshold, further check whether their communication frequency matches that of this node. If they match, proceed to the next step; For connectable nodes with matching communication frequencies, calculate whether the signal strength difference value meets the power ratio constraint of node connection. If so, mark it as a candidate connection node. Based on the results of channel resource matching, communication frequency verification and power difference calculation, the candidate connection nodes are verified one by one to see whether they meet the preset connection conditions; Record the nodes that meet all connection conditions as connectable nodes of this node, and form an initial connection relationship table including node identification, signal strength, channel allocation and communication frequency; A bidirectional verification operation is performed on each node in the initial connection relationship table to make the marked connection relationship a bidirectional connection, and finally determine the valid connection relationship of the node.

3. The centerless ad hoc network emergency communication command method according to claim 2, characterized in that: The specific formula for power differential calculation is: ΔP ij =|P i -P j | Among them, ΔP ij represents the power difference between node i and node j, P i represents the transmission signal power of node i, P j represents the signal power received by node j; The calculation formula for the power ratio constraint in connection condition verification is: Among them, R ij It represents the ratio of the signal power received by node j to the signal power sent by node i; The rules for determining whether the connection conditions are met are: When ΔP ij ≤ΔP max When , the power difference between node i and node j satisfies the constraint condition, where ΔP max Indicates the preset maximum power difference threshold; When R ij ≥R min And R ij ≤R max When the power ratio R ij Satisfy the connection condition, where R min and R max are the preset minimum and maximum power ratio thresholds respectively.

4. The centerless ad hoc network emergency communication command method according to claim 1, characterized in that: Based on the initial connection relationship table between nodes, the method for forming the initial topological structure of the network includes the following steps: Extract the connection pair information of each node from the initial connection relationship table to form a node pair set {(i, j)}, where i and j are the node identifiers in the connection pair respectively; According to the signal strength S of the node pair ij and link quality indicator Q ij , calculate the connection weight between node i and node j, the specific formula is: IN ij =αS ij +βQ ij Among them, W ij represents the connection weight, S ij represents the signal strength between node i and node j, Q ij represents the link quality index, α and β are weight coefficients; According to the node pair set {(i,j)} and the calculated connection weight W ij , generate a weighted undirected graph G(V,E,W) containing all nodes and edges, where V represents the node set, E represents the connecting edge set, and W represents the edge weight; Execute the minimum spanning tree algorithm on the weighted undirected graph G(V,E,W) and select the edge set E′ with the smallest total weight between nodes as the core connection in the initial topology structure; For the initially generated core connection E′, check whether the degree of each node meets the preset redundant connection requirements. If the connection degree of a node is lower than the requirement, select edges from the edge set E\E′ according to the weight priority principle to supplement until the redundancy condition is met; Perform connectivity verification on the updated connection set E″ to ensure that all nodes are in the same connected subgraph; The final node set V and edge set E″ are used as the initial topological structure of the network.

5. The method for commanding emergency communication in a centerless ad hoc network as claimed in claim 1, characterized in that: The method for calculating the communication congestion of each link based on the real-time communication load data of the routing link comprises the following steps: Monitor each routing link in real time and record the data flow F passing through the link within the preset time window ij , where F ij represents the real-time communication flow between node i and node j; Based on the maximum available bandwidth B of the link ij and real-time data traffic F ij , calculate the bandwidth utilization of the link, the specific formula is: Among them, U ij Indicates the bandwidth utilization of the link, B ij is the predefined maximum link bandwidth value; Send a fixed-size data packet to each link and record the round-trip delay D of the data packet from node i to node j ij ; The nodes on the link record the number of lost packets L ij , calculate the congestion loss rate of the link, the specific formula is: Among them, C ij Represents the congestion loss rate of the link, L ij is the number of packet loss, N ij is the total number of packets sent; Combined with bandwidth utilization U ij , delay D ij and congestion loss rate C ij , the communication congestion of the link is calculated by a weighted formula, the specific formula is: O ij =γ1U ij +γ2D ij +λ3C ij Among them, O ij represents the communication congestion of the link, γ1, γ2, and γ3 are the weight coefficients of bandwidth utilization, delay, and congestion loss rate, respectively, and satisfy γ1+γ2+γ3=1; The traffic congestion of all links is O ij Standardization is performed, and the specific formula is: Among them, O i ' j is the normalized communication congestion, O min and O max are the minimum and maximum communication congestion values ​​among all links respectively; The node identification, standardized communication congestion and other monitoring parameters of each link are recorded in the link congestion table as input data for subsequent network optimization.

6. The centerless ad hoc network emergency communication command method according to claim 1, characterized in that: The method for generating an emergency communication task model and determining task priorities based on network topology and preset task requirements includes the following steps: Extract the connection relationship, link bandwidth, communication delay, available computing resources and available storage resources of each node from the network topology; Define task requirements based on emergency scenarios and determine the parameters of each task, including data volume, computing requirements, latency constraints, and task priority factors; According to the correlation between tasks, the tasks are divided into multiple task groups, each of which contains several independent or related tasks; For each task, the task suitability score of the node is calculated based on the available resources and task requirements of the node. The specific formula is: Among them, A ik is the suitability score of node i for task k, C i and S i is the computing resources and storage resources of node i, R k and V k is the computational requirement and data volume of task k, D ij is the delay of the task transmission link, T k The delay constraint of the task; For each task, the priority factor and adaptability score of the task requirements are combined to calculate the comprehensive priority of the task. The specific formula is: Among them, U k is the comprehensive priority of task k, V is the set of all available nodes in the network; Sort all tasks in descending order according to their comprehensive priority, and assign high-priority tasks to adapter nodes in the network first; The sorted tasks and their priorities, as well as the adaptability scores between tasks and nodes, are recorded in the task model, and a collaboration graph between tasks is established based on the grouping, where each edge represents the data or control dependency between tasks. The emergency communication task model including task allocation priority, task node adaptation relationship and collaboration diagram is provided to the subsequent communication command plan generation step.

7. The method for commanding emergency communication in a centerless ad hoc network as claimed in claim 6, characterized in that: The method for generating a collaboration diagram between tasks includes the following steps: Each task is considered as a node in the graph, which contains the task's computing requirements, data volume, and priority attributes; According to the task grouping results and task relevance calculation, add edges between task nodes, and the edge weights represent the relevance between tasks; Use the shortest path algorithm to optimize the critical path in the collaboration graph; Generate a task collaboration graph containing task nodes, task edges and optimized paths as input data for subsequent task allocation.

8. The centerless ad hoc network emergency communication command method according to claim 6, characterized in that: Task grouping includes the following specific methods: For every two tasks, the correlation between the tasks is calculated based on the communication data volume and task execution timing requirements of the tasks; According to the task relevance, a hierarchical clustering algorithm is used to divide the tasks into multiple task groups, with high relevance within the task group and low relevance between task groups.

9. A centerless self-organizing network emergency communication command system, characterized in that: Includes the following modules: Node configuration module, used to allocate communication frequency, channel resources, power control parameters and routing strategies to all nodes in the network; An initial connection generation module, used to generate an initial connection relationship table between nodes when connection conditions are met according to the communication frequency and channel resources of the nodes; A network topology building module is used to form an initial topology structure of the network based on an initial connection relationship table between nodes; A routing distribution module is used to distribute routing paths to other nodes for each node based on the network topology and record routing information; The load monitoring module is used to collect load data for each link on the routing path and record the real-time communication load data of the link; A congestion calculation module, used to calculate the communication congestion of each link based on the real-time communication load data of the routing link; A connection relationship adjustment module is used to reallocate the node connection relationship in the network and update the routing path according to the communication congestion of the link; A topology optimization module is used to regenerate the network topology and assign new routing paths based on the adjusted node connection relationship; The task modeling module is used to generate an emergency communication task model and determine the task priority according to the network topology and preset task requirements; The task allocation module is used to allocate specific tasks to eligible nodes according to the emergency communication task model and task priority; The parameter synchronization module is used to synchronize and update the communication frequency, channel resources and routing path of the nodes based on the task allocation results; The task execution module is used to start each node in the ad hoc network to perform emergency communication tasks according to the assigned tasks and updated communication parameters.

10. The centerless self-organizing network emergency communication command system according to claim 9, characterized in that: The network topology building module includes: A node pair extraction unit, used to extract connection pair information of each node from the initial connection relationship table to form a node pair set, wherein each node pair consists of two node identifiers; The weight calculation unit is used to calculate the connection weight between the node pairs according to the signal strength and link quality index of the node pairs. The specific formula is: IN ij =αS ij +βQ ij Among them, W ij represents the connection weight, S ij represents the signal strength between node i and node j, Q ij represents the link quality index, α and β are weight coefficients; A weighted graph generation unit, used for generating a weighted undirected graph including all nodes and edges according to the node pair set and the calculated connection weights; A minimum spanning tree generation unit is used to execute the minimum spanning tree algorithm on the weighted undirected graph and select the edge set with the minimum total weight between nodes as the core connection in the initial topological structure; The redundant connection supplement unit is used to check whether the connectivity of each node meets the preset redundant connection requirements. If the connectivity of a node is lower than the requirement, edges are selected from the edge set according to the weight priority principle for supplementation until the redundancy condition is met; A connectivity verification unit, used to perform connectivity verification on the updated connection set to ensure that all nodes are in the same connected subgraph; The topology output unit is used to output the final node set and edge set as the initial topology structure of the network.

Images