A centerless self-organizing network emergency communication command method and system

Abstract

The application relates to a centerless self-organizing network emergency communication command method and system, which comprises the following steps: allocating communication frequency, channel resource, power control parameter and routing strategy to all nodes in the network; generating an initial connection relationship table among the nodes and an initial topology structure of the network according to the communication frequency and the channel resource; allocating a routing path leading to other nodes to each node and recording; collecting real-time communication load data of a link on the routing path, and calculating link communication congestion degree; updating the node connection relationship and the routing path according to the congestion degree; generating an emergency communication task model, determining a task priority, and allocating the task to a node meeting the condition; synchronously updating the communication frequency, the channel resource and the routing path of the node, and starting the node in the self-organizing network to execute the emergency communication task, so that the network performance and the task scheduling reliability are improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of wireless communication, in particular to a centerless Ad-Hoc network emergency communication command method and system. BACKGROUND

[0002] In modern communication technology, centerless Ad-Hoc network is a form of wireless network without fixed infrastructure support, whose nodes can automatically discover, connect and dynamically maintain network topology. Centerless Ad-Hoc network is widely used in disaster relief, military communication, emergency command and other scenarios, and has the characteristics of flexible deployment and strong adaptability. However, since the network runs in a distributed architecture, it 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 the emergency communication scenario, the centerless Ad-Hoc network needs to face the dynamic and changing network environment, limited node resources and complex and diverse communication task requirements. The existing technology usually relies on simple signal strength judgment or static topology generation method to construct network structure, which is difficult to adapt to real-time load changes and task scheduling requirements in complex scenarios, and is easy to cause communication link congestion, uneven task allocation and decline of overall network performance. In addition, for the allocation and execution of emergency tasks, the existing method is based on single-dimensional priority evaluation, and does not fully combine the comprehensive evaluation of node resources, communication link state and task demand, resulting in insufficient task allocation efficiency and communication reliability. SUMMARY

[0004] The present application provides a centerless Ad-Hoc network emergency communication command method and system, which aims to solve the problems of low network topology dynamic construction efficiency, serious communication link congestion and uneven emergency task allocation in the prior art.

[0005] To achieve the above purpose, the first aspect of the present application provides a centerless Ad-Hoc network emergency communication command method, comprising the following steps:

[0006] allocating communication frequency, channel resource, power control parameter and routing strategy for all nodes in the network;

[0007] According to the communication frequency and channel resource of the node, an initial connection relationship table between nodes is generated under the condition of meeting the connection condition;

[0008] Based on the initial connection relationship table between nodes, the initial topology structure of the network is formed;

[0009] Based on the network topology structure, a routing path leading to other nodes is allocated for each node and the routing information is recorded;

[0010] The load data of each link on the routing path is collected, and the real-time communication load data of the link is recorded;

[0011] Based on the real-time communication load data of the routing link, the communication congestion degree of each link is calculated;

[0012] According to the communication congestion degree of the link, the node connection relationship in the network is re-allocated, and the routing path is updated;

[0013] Based on the adjusted node connection relationship, the network topology is regenerated, and a new routing path is allocated;

[0014] According to the network topology and the preset task demand, an emergency communication task model is generated, and the task priority is determined;

[0015] According to the emergency communication task model and the task priority, the specific task is allocated to the node meeting the condition;

[0016] Based on the task allocation result, the communication frequency, channel resource and routing path of the node are synchronously updated;

[0017] According to the allocated task and the updated communication parameter, each node in the ad hoc network is started to execute the emergency communication task.

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

[0019] Each node periodically sends a signal probe packet to other nodes within its coverage range, and records the signal strength of the received signal probe packet from other nodes;

[0020] For the received signal probe packet, check whether the channel resource between the sending node and the node conflicts, and if there is no conflict, record the node as a connectable node;

[0021] For the connectable node whose signal strength meets the preset threshold, further check whether its communication frequency matches the node, and if it matches, continue to the next step;

[0022] For the connectable node whose communication frequency matches, calculate whether the signal strength difference value meets the power ratio constraint of node connection, and if it meets, mark it as a candidate connection node;

[0023] Based on the results of channel resource matching, communication frequency verification and power difference calculation, the candidate connection nodes are verified one by one whether they meet the preset connection conditions;

[0024] The nodes meeting all the connection conditions are recorded as the connectable nodes of the node, and an initial connection relationship table containing node identification, signal strength, channel allocation and communication frequency is formed;

[0025] A bidirectional verification operation is performed on each node in the initial connection relationship table, so that the marked connection relationship is bidirectional connection, and finally the effective connection relationship of the node is determined.

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

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

[0028] Wherein, ΔP ij represents the power difference between node i and node j, P i represents the sending signal power of node i, P j represents the receiving signal power of node j.

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

[0030]

[0031] Wherein, R ij represents the ratio of the receiving signal power of node j to the sending signal power of node i.

[0032] The determination rule of the connection condition is:

[0033] When ΔP ij ≤ ΔP max , the power difference of node i and node j satisfies the constraint condition, wherein Δ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 satisfies the connection condition, wherein R min and R max are the preset minimum and maximum power ratio thresholds respectively.

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

[0036] Extract the connection pair information of each node from the initial connection relationship table to form a node pair set {(i,j)}, wherein i and j are 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, the connection weight between node i and node j is calculated, and the specific formula is:

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

[0039] wherein, W ij represents connection weight, S ij represents signal strength of node i and node j, Q ij represents 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) containing all nodes and edges is generated, wherein V represents a node set, E represents a connection edge set, and W represents the weight of the edge;

[0041] A minimum spanning tree algorithm is performed on the weighted undirected graph G(V,E,W), and the edge set E' with the minimum total weight between nodes is selected as the core connection in the initial topology structure;

[0042] For the initially generated core connection E', it is checked whether the degree of each node meets the pre-set redundant connection requirement. If the connection degree of a node is lower than the requirement, an edge is selected from the edge set E\E' according to the weight priority principle for supplement until the redundant degree condition is met;

[0043] The connectivity verification is performed on the updated connection set E'' so that all nodes are in the same connected subgraph;

[0044] The finally formed node set V and edge set E'' are taken as the initial topology structure of the network.

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

[0046] Each routing link is monitored in real time, and the data flow F ij passing through the link in a pre-set time window is recorded, wherein F ij represents real-time communication flow between node i and node j;

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

[0048]

[0049] wherein, U ij represents the bandwidth utilization rate of the link, and B ij is a pre-defined maximum bandwidth value of the link;

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

[0051] The number of packet losses L is recorded by the nodes on the link. ij The congestion loss rate of the link is calculated using the following formula:

[0052]

[0053] Among them, C ij L represents the congestion loss rate of the link. ij N represents the number of packets lost. ij The total number of packets sent;

[0054] Combined with bandwidth utilization U ij Delay D ij and congestion loss rate C ij The communication congestion level of the link is calculated using a weighted formula, specifically:

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

[0056] Among them, O ij The link represents the communication congestion level, where γ1, γ2, and γ3 are the weighting coefficients of bandwidth utilization, latency, and congestion loss rate, respectively, and satisfy γ1+γ2+γ3=1;

[0057] Communication congestion O across all links ij The standardization process is performed, and the specific formula is as follows:

[0058]

[0059] Among them, O′ ij For standardized communication congestion, O min and O max These are the minimum and maximum communication congestion values ​​among all links, respectively;

[0060] The node identifier, standardized communication congestion level, and other monitoring parameters of each link are recorded in the link congestion table as input data for subsequent network optimization.

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

[0062] Extract the connection relationship, link bandwidth, communication delay, available computing resources and available storage resources of each node from the topology of the network;

[0063] According to the task requirements defined by the emergency scene, the parameters of each task are determined, including data volume, computing demand, delay constraint, and task priority factor;

[0064] According to the relevance between tasks, the tasks are divided into multiple task groups, each task group containing several independent or related tasks;

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

[0066]

[0067] Wherein, A ik is the adaptability score of node i to 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 demand 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;

[0068] For each task, the comprehensive priority of the task is calculated by combining the priority factor and the adaptability score of the task requirements, and the specific formula is:

[0069]

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

[0071] According to the comprehensive priority, all tasks are sorted in descending order, and high-priority tasks are preferentially allocated to adaptive nodes in the network;

[0072] The sorted tasks, their priorities, and the adaptability scores of the tasks and nodes are recorded in the task model, and a collaboration graph is established according to the grouping, wherein each edge represents the data or control dependency between tasks;

[0073] The emergency communication task model containing task allocation priority, task node adaptability relationship and collaboration graph is provided to the subsequent communication command scheme generation step.

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

[0075] Each task is regarded as a node in a graph, and the node contains the computing requirement, data volume and priority attribute of the task;

[0076] According to the task grouping result and the task correlation calculation, edges between the task nodes are added, and the edge weight represents the correlation between the tasks;

[0077] The shortest path algorithm is used to optimize the critical path in the cooperation graph;

[0078] The task cooperation graph containing the task nodes, task edges and optimized paths is generated as the input data for subsequent task allocation.

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

[0080] For each two tasks, the correlation between the tasks is calculated based on the communication data volume of the task dependency and the task execution timing requirement;

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

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

[0083] The node configuration module is used to allocate communication frequency, channel resource, power control parameter and routing strategy for all nodes in the network;

[0084] The initial connection generation module is used to generate an initial connection relationship table between nodes according to the communication frequency and channel resource of the nodes under the condition of meeting the connection condition;

[0085] The network topology construction module is used to form the initial topology structure of the network based on the initial connection relationship table between the nodes;

[0086] The routing allocation module is used to allocate the routing path leading to other nodes for each node based on the network topology structure, and record the routing information;

[0087] The load monitoring module is used to collect the load data of each link on the routing path, and record the real-time communication load data of the link;

[0088] The congestion degree calculation module is used to calculate the communication congestion degree of each link based on the real-time communication load data of the routing link;

[0089] The connection relationship adjustment module is used to re-allocate the node connection relationship in the network according to the communication congestion degree of the link, and update the routing path;

[0090] a topology optimization module, configured to regenerate a network topology based on the adjusted node connection relationship and allocate a new routing path;

[0091] a task modeling module, configured to generate an emergency communication task model according to the network topology and a preset task requirement and determine a task priority;

[0092] a task allocation module, configured to allocate a specific task to a node meeting a condition according to the emergency communication task model and the task priority;

[0093] a parameter synchronization module, configured to synchronize and update a communication frequency, a channel resource and a routing path of the node based on a task allocation result;

[0094] a task execution module, configured to start each node in the ad hoc network to execute an emergency communication task according to the allocated task and the updated communication parameter.

[0095] Further, the network topology construction module comprises:

[0096] a node pair extraction unit, configured to extract connection pair information of each node from the initial connection relationship table to form a node pair set, wherein each node pair is composed of two node identifiers;

[0097] a weight calculation unit, configured to calculate a connection weight between node pairs according to a signal strength and a link quality index of the node pairs, and a specific formula is as follows:

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

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

[0100] a weighted graph generation unit, configured to generate a weighted undirected graph containing all nodes and edges according to the node pair set and the calculated connection weight;

[0101] a minimum spanning tree generation unit, configured to execute a minimum spanning tree algorithm on the weighted undirected graph and select a minimum edge set between nodes as a core connection in an initial topology structure;

[0102] a redundant connection supplement unit, configured to check whether a connection degree of each node meets a preset redundant connection requirement, and if the connection degree of a certain node is lower than the requirement, select an edge from the edge set according to a weight priority principle to supplement until the redundant degree condition is met;

[0103] A connectivity verification unit is configured to perform connectivity verification on the updated connection set to ensure that all nodes are in the same connected subgraph.

[0104] A topology output unit is configured to output the finally formed node set and edge set as an initial topology of the network.

[0105] The present application has the following advantages:

[0106] Compared with the prior art, the centerless ad hoc network emergency communication command method and system provided by the present application solves the problems of low network topology dynamic construction efficiency, serious communication link congestion and uneven emergency task allocation by the following technical solutions: first, based on the multi-dimensional conditions of signal strength between nodes, channel resource matching, communication frequency verification and power difference calculation, an initial connection relationship table between nodes is constructed, and a minimum spanning tree algorithm is used in combination with redundant connection optimization to generate an efficient and reliable initial network topology, thereby improving the efficiency of dynamically constructing the network topology; second, by collecting real-time communication load data of the routing link, combining bandwidth utilization, delay and packet loss rate multi-index calculation of communication congestion, and using standardized processing results to optimize node connection relationship and routing path, the problem of communication link congestion is effectively alleviated; finally, in the task allocation process, by combining the priority factor of the task demand and the adaptability score of the node resource, the calculation demand, data volume, transmission delay and node resource state of the task are comprehensively considered, and the grouping and cooperation graph modeling method is used to realize the accurate priority allocation of the task, thereby solving the problem of uneven emergency task allocation and significantly improving the overall performance of the network and the reliability of task scheduling. BRIEF DESCRIPTION OF DRAWINGS

[0107] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed in the embodiment description will be briefly introduced as follows.

[0108] Figure 1 is a principle diagram of a centerless ad hoc network emergency communication command method disclosed by the embodiments of the present application.

[0109] Figure 2 is a node connection relationship generation flowchart disclosed by the embodiments of the present application.

[0110] Figure 3 is a network topology generation schematic diagram disclosed by the embodiments of the present application.

[0111] Figure 4 is a communication congestion calculation flowchart disclosed by the embodiments of the present application.

[0112] Figure 5 is an emergency communication task model generation flowchart disclosed by the embodiments of the present application. DETAILED DESCRIPTION

[0113] In order to better understand the technical scheme of the present application, the technical scheme in the embodiments of the present application will be described clearly and completely below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, but not all the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work should belong to the protection scope of the present application.

[0114] According to the embodiments of the present application, it should be noted that the steps shown in the flowchart of the drawings can be executed in a computer system such as a group of computer executable instructions, and although the logical order is shown in the following method, in some cases, the steps shown or described can be executed in an order different from here.

[0115] As shown in Figure 1 The present application provides a centerless ad hoc network emergency communication command method, comprising the following steps:

[0116] Step S100, allocating communication frequency, channel resource, power control parameter and routing strategy for all nodes in the network;

[0117] Step S200, generating an initial connection relationship table between nodes according to the communication frequency and channel resource of the nodes, under the condition that the connection condition is met;

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

[0119] Step S400, allocating a routing path to other nodes for each node and recording routing information based on the network topology structure;

[0120] Step S500, collecting load data on each link of the routing path and recording real-time communication load data of the link;

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

[0122] Step S700, re-distributing the node connection relationship in the network according to the communication congestion degree of the link and updating the routing path;

[0123] Step S800, regenerating the network topology based on the adjusted node connection relationship and allocating a new routing path;

[0124] Step S900, generating an emergency communication task model and determining the task priority according to the network topology and the preset task requirement;

[0125] Step S1000, according to the emergency communication task model and the task priority, assign a specific task to a node meeting the condition;

[0126] Step S1100, based on the task assignment result, synchronously update the communication frequency, channel resource and routing path of the node;

[0127] Step S1200, according to the assigned task and the updated communication parameter, start each node in the ad hoc network to perform the emergency communication task.

[0128] In the embodiment, as described in the above step S100, the communication frequency, channel resource, power control parameter and routing strategy are assigned to all nodes in the network, which specifically includes the following steps: first, according to the preset spectrum resource range and channel number, a spectrum allocation algorithm is used to assign a unique communication frequency and channel to each node to avoid channel conflict; second, according to the geographical position, energy state and preset power limit of the node, the transmission power and receiving sensitivity of the node are dynamically assigned to ensure that the signal quality in the communication coverage range meets the requirements; third, according to the overall communication demand of the network, an initial routing strategy is formulated, and a distributed routing table generation algorithm is used to establish an initial routing table of each node to other nodes; finally, the assigned frequency, channel resource, power control parameter and routing strategy are stored in the configuration file of each node to provide basic configuration for the subsequent steps.

[0129] In the embodiment, as described in the above step S200, according to the communication frequency and channel resource of the node, an initial connection relationship table between nodes is generated under the condition of meeting the connection condition, as shown in Figure 2 , which specifically includes the following steps: first, each node periodically sends a signal probe packet to other nodes within its coverage range and records the signal strength of the received signal probe packet; then, it checks whether the channel resource between the receiving node and the sending node is in conflict, and if not, records the node as a connectable node; then, for the connectable node whose signal strength meets the preset threshold, it checks whether the communication frequency is matched, and if matched, it further calculates the power difference between the nodes to verify whether the preset power ratio constraint condition is met; finally, all nodes meeting the channel resource matching, communication frequency checking and power ratio constraint condition are recorded as the connectable nodes of the node, and a bidirectional verification operation is performed to generate an initial connection relationship table containing the node identifier, signal strength, channel allocation and communication frequency, which provides data support for subsequent topology construction.

[0130] The specific formula of the power difference calculation is:

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

[0132] wherein, ΔP ij represents the power difference between node i and node j, P i represents the transmitting signal power of node i, P j represents the receiving signal power of node j;

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

[0134]

[0135] wherein, R ij represents the ratio of the receiving signal power of node j to the transmitting signal power of node i;

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

[0137] When ΔP ij ≤ ΔP max , the power difference of node i and node j meets the constraint condition, wherein, Δ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, wherein, R min and R max are the preset minimum and maximum power ratio thresholds, respectively.

[0139] It can be understood that the technical scheme accurately selects the node pairs meeting the preset connection condition by periodically sending signal probe packets, and combines the multi-dimensional verification methods such as channel resource matching verification, communication frequency matching verification and power difference calculation, and generates an initial connection relationship table. The scheme realizes comprehensive evaluation and selection of the effective connection relationship between nodes, avoids connection failure caused by channel conflict or signal mismatch, and at the same time ensures the bidirectional consistency of the connection relationship, thereby laying a foundation of high reliability and high precision for subsequent network topology construction.

[0140] In the embodiment, as described in step S300, the 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, the connection pair information of each node is extracted from the initial connection relationship table to form a node pair set {(i, j)}, wherein each node pair is composed of two node identifiers; then, the connection weight between the node pairs is calculated according to the signal strength and the link quality index of the node pairs, and the specific formula is:

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

[0142] wherein, W ij denotes connection weight, S ij denotes signal strength of node i and node j, Q ij denotes link quality index, and a and β are weight coefficients.

[0143] Next, a weighted undirected graph G(V, E, W) containing all nodes and edges is generated according to the calculated connection weights; then, a minimum spanning tree algorithm is performed on the weighted undirected graph, and the edge set with the minimum total weight between nodes is selected as the core connection of the initial topology; next, it is checked whether the connection degree of each node meets the preset redundant connection requirement, if not, the edges are selected from the edge set according to the connection weight priority principle for supplement; finally, the connectivity of the updated edge set is verified to ensure that all nodes are in the same connected subgraph, and the initial topology of the network is finally generated. Through this scheme, the dynamic and efficient construction from the initial connection relationship table to the complete network topology 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 the "weighted undirected graph" is a graph data structure, in which the nodes represent various entities in the network, and the edges represent the connections between the nodes, each edge is assigned a weight value. This weight represents the cost, quality and other important metrics 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 relationship between nodes, and the weight helps to determine the optimal connection path to achieve efficient and reliable network communication.

[0145] In this embodiment, as described in step S400 above, the network topology structure is used to assign each node a routing path to other nodes and record the routing information, which specifically includes the following steps: first, using the generated network topology structure, the neighbor node information of each node is extracted, and the routing table of the node is initialized; then, using a distributed routing algorithm, the shortest path or optimal path from the source node to the target node is calculated according to the connection weight and link quality index between nodes; next, the calculated path information, including intermediate nodes, total weight of the path and link parameters, is updated into the routing table of the source node in turn; finally, the routing tables of all nodes are synchronized to ensure that each node in the network has complete routing information.

[0146] In the embodiment, as described in step S500, the real-time communication load data of each link on the routing path is collected and recorded, including the following steps: first, a data collection module is deployed on each link to monitor the data flow through the link in a preset time window; second, the current bandwidth utilization, communication delay between nodes and the number of lost packets in data transmission are collected; third, the collected link flow data, communication delay and number of lost packets are stored in a link state table; and finally, the real-time load data of the link is aggregated into a global state database through a state synchronization mechanism between nodes in the network.

[0147] In the embodiment, as described in step S600, based on the real-time communication load data of the routing link, the communication congestion degree of each link is calculated, see Figure 4 , including the following steps: first, the bandwidth utilization U ij of the link is calculated according to the real-time data flow F ij and the maximum available bandwidth B ij , and the formula is:

[0148]

[0149] wherein U ij represents the bandwidth utilization of the link, and B ij is the pre-defined 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, the congestion loss rate of the link is calculated according to the number of lost packets L ij and the total number of sent packets N ij :

[0151]

[0152] wherein 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 sent packets;

[0153] Subsequently, the bandwidth utilization, delay and congestion loss rate are combined to calculate the communication congestion degree using a weighted formula:

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

[0155] wherein O ijThe communication congestion degree of the link is represented, and γ1, γ2, and γ3 are weight coefficients of bandwidth utilization, delay, and congestion loss rate, respectively, and satisfy γ1+γ2+γ3=1;

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

[0157]

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

[0159] In this step, the communication congestion degree is calculated by combining the three key parameters of bandwidth utilization, delay, and congestion loss rate using a weighted formula, which avoids the limitations of single-dimensional congestion evaluation. Real-time performance is achieved by using traffic data within a time window and dynamic parameter monitoring, which enhances the ability to quickly respond to network changes. The standardization formula unifies the congestion degree range, which facilitates direct comparison across links and adaptation of network optimization algorithms.

[0160] In this embodiment, as described in step S700, the standardized communication congestion degree and related link parameters of each link are extracted from the link state table. Next, high-congestion links whose communication congestion degree exceeds a preset threshold are identified, and their corresponding node pairs in the network are marked. Then, based on the congestion degree distribution of the high-congestion links, node pairs adjacent to low-congestion links are preferentially selected, and the node connection relationship is re-adjusted according to the principle of the lowest communication cost. Subsequently, the neighbor table and connection relationship table of the affected nodes are updated, and the routing path allocation algorithm is re-executed to calculate new optimal paths. Finally, the updated connection relationship and routing paths are synchronized, and the results are written into the routing table of the nodes.

[0161] In this embodiment, as described in step S800, the node pair information is re-extracted using the updated node connection relationship table to construct a new weighted undirected graph, where the edge weight is calculated from the signal strength and link quality indicators between nodes. Next, based on the new weighted undirected graph, the minimum spanning tree algorithm is re-executed to generate core connections, and the edge set is supplemented according to the preset redundancy connection requirements to ensure the reliability and connectivity of the topology. Then, it is verified whether the generated network topology meets the full-network connectivity requirement, and if there are isolated nodes, low-cost connections are preferentially selected for supplementation. Finally, the distributed routing algorithm is re-run based on the new network topology structure to assign routing paths from each node to other nodes, and the updated network topology and routing information are stored in the routing table of the nodes.

[0162] In this embodiment, as described in step S900 above, the emergency communication task model is generated according to the network topology and the preset task requirements, and the task priority is determined, see Figure 5 , which specifically includes the following steps: first, the connection relationship of nodes, link bandwidth, communication delay, computing resources and storage resources of nodes and other information are extracted from the network topology; second, the task requirements are defined in combination with the emergency scene, the parameters of each task are determined, including data volume, computing requirement, delay constraint and initial priority factor; third, based on the correlation between tasks (such as communication data volume and timing requirements of task dependency), the tasks are divided into multiple task groups, and a collaboration graph is generated for each group of tasks; then, for each task, the task adaptability score of the node is calculated by using the resource information of the node and the task requirement, and the specific formula is:

[0163]

[0164] wherein, A ik is the adaptability score of node i to 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 requirement 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] The comprehensive priority of the task is calculated in combination with the task priority factor, and the formula is:

[0166]

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

[0168] Finally, the tasks are sorted in descending order according to the comprehensive priority, and an emergency communication task model containing task allocation priority and node adaptation relationship is generated, which provides a basis for task allocation.

[0169] The priority calculation of this step comprehensively considers the computing resources, storage resources, transmission delay and task requirements of the node, avoids the shortcomings of single-dimensional calculation in traditional methods, calculates the adaptation degree of each node to the task through a unique adaptability score formula in the task adaptability score formula, and introduces the node resource distribution in the priority calculation, thereby improving the accuracy of task allocation; in the task collaboration modeling step, the correlation between tasks is expressed as a collaboration graph, which provides a theoretical basis for distributed execution of complex emergency tasks; in addition, through the dual mechanisms of task grouping and comprehensive priority sorting, the global optimal allocation strategy of the task is realized.

[0170] Preferably, the method for generating the cooperation graph between tasks comprises: regarding each task as a node in the graph, the node containing the computing requirement, data volume and priority attribute of the task; adding edges between the task nodes according to the task grouping result and the task correlation calculation, the edge weight representing the correlation between the tasks; optimizing the critical path in the cooperation graph by using the shortest path algorithm; and generating the task cooperation graph containing the task nodes, task edges and optimized path as input data for subsequent task allocation.

[0171] Preferably, the task grouping comprises: calculating the correlation between each two tasks based on the communication data volume and the task execution timing requirement of the task dependency; and dividing the tasks into multiple task groups by using the hierarchical clustering algorithm according to the task correlation, the correlation being high within the task group and low between the task groups.

[0172] In this embodiment, as described in the above step S1000, the highest priority task is extracted from the task model according to the task allocation priority, and the node set with the highest score in the task adaptability score is queried; secondly, the task is allocated to the node with the highest score under the premise of meeting the task computing requirement, data volume and delay constraint; then, for the correlated tasks in the task group, the task is allocated to the adjacent adaptive node according to the task dependency relationship in the cooperation graph, and a dedicated routing link is allocated for the communication between the tasks; subsequently, the resource utilization and the current task load of all nodes are checked, and the node allocation of the low priority task is dynamically adjusted to ensure the resource requirement of the high priority task; finally, the allocated task and node mapping record are recorded in the allocation table, and the node state is synchronously updated.

[0173] In this embodiment, as described in the above step S1100, the communication frequency and channel resource allocation of the node are adjusted according to the task information of each node in the task allocation table, to ensure that the allocated channel and frequency meet the bandwidth and interference constraint of the task; the routing table of the node is updated according to the allocated task routing link, the routing path related to the task is added, and the invalid path is removed; the frequency, channel, routing path and other update information of the node are broadcast to the neighbor nodes directly connected thereto, to ensure the consistency of the local network; the connection relationship and routing state of the whole network are gradually updated through the multi-hop synchronization mechanism between the nodes; finally, the integrity of the resource allocation result and the routing table of the whole network is checked, to ensure that the communication parameters and routing path of all tasks are updated in place.

[0174] In the embodiment, as described in step S1200, each node loads corresponding task data and communication parameters according to the distribution table, including frequency, channel resource, routing path, etc.; the node starts the calculation, storage and communication functions in turn according to the task priority, executes the specified task operation, and transmits necessary data or control information to other task nodes through the preset routing path; the execution state of the task is monitored in real time, including the data transmission completion, node resource usage and link state, and recorded in the task monitoring log; if a problem such as link interruption or resource shortage occurs in the task execution process, the dynamic adjustment mechanism is triggered to optimize the task parameters, routing or resource allocation in real time; finally, after all the tasks are completed, each node reports the task execution result and state back to the network management module, completing the closed-loop operation of the emergency communication task.

[0175] According to another aspect of the embodiment of the application, a centerless ad hoc network emergency communication command system is also provided, comprising the following modules:

[0176] A node configuration module is configured to allocate communication frequency, channel resource, power control parameter and routing strategy for all nodes in the network;

[0177] An initial connection generation module is configured to generate an initial connection relationship table between nodes according to the communication frequency and channel resource of the nodes under the condition that the connection condition is met;

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

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

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

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

[0182] A connection relationship adjustment module is configured to re-distribute the connection relationship of nodes in the network according to the communication congestion of the link, and update the routing path;

[0183] A topology optimization module is configured to regenerate the network topology based on the adjusted connection relationship of nodes, and allocate a new routing path;

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

[0185] The task allocation module is used to allocate specific tasks to eligible nodes based on the emergency communication task model and task priority.

[0186] 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.

[0187] The task execution module is used to initiate emergency communication tasks for each node in the ad hoc network according to the assigned tasks and updated communication parameters.

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

[0189] The node pair extraction unit is used to extract the 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.

[0190] The weight calculation unit is used to calculate the connection weight between node pairs based on the signal strength and link quality indicators of the node pairs. The specific formula is as follows:

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

[0192] Among them, W ij S represents the connection weight. ij Q represents the signal strength at node i and node j. ij This represents the link quality metric, where α and β are weighting coefficients;

[0193] The weighted graph generation unit is used to generate a weighted undirected graph containing all nodes and edges based on the set of node pairs and the calculated connection weights.

[0194] The minimum spanning tree generation unit is used to perform the minimum spanning tree algorithm on a weighted undirected graph, selecting the set of edges with the minimum total weight between nodes as the core connection in the initial topology.

[0195] 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 requirements, an edge is selected from the edge set according to the weight priority principle to supplement it until the redundancy condition is met.

[0196] The connectivity verification unit is used to perform connectivity verification on the updated set of connections to ensure that all nodes are in the same connected subgraph.

[0197] The topology output unit is used to output the final set of nodes and edges, which serves as the initial topology of the network.

[0198] In the above-mentioned embodiments of the present application, the description of each embodiment focuses on different aspects, and the parts not described in detail in a certain embodiment can be referred to the relevant description of other embodiments.

[0199] In several embodiments provided in the present application, it should be understood that the disclosed technology can be implemented in other ways. For example, the above-mentioned device embodiments are only schematic, and the division of the units can be a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units or modules shown or discussed can be indirect coupling or communication connection through some interfaces, units or modules, and can be electrical or other forms.

[0200] In addition, each functional unit in each embodiment of the present application can be integrated into a processing unit, or each unit can exist physically, or two or more units can be integrated into one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0201] When the integrated unit is realized 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 this understanding, the technical solutions of the present application essentially or the part that contributes to the prior art or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, and includes a plurality of 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 application. The aforementioned storage medium includes: a U disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a mobile hard disk, a magnetic disk or an optical disk, and various media that can store program codes.

[0202] The above-mentioned is only the preferred embodiment of the present application, and it should be pointed out that for ordinary skilled in the art, without departing from the principles of the present application, a number of improvements and refinements can be made, and these improvements and refinements should be considered as the protection scope of the present application.

Claims

1. A decentralized self-organizing network emergency communication command method, characterized in that, Includes the following steps: Allocate communication frequencies, channel resources, power control parameters, and routing policies to all nodes in the network; Based on the communication frequency and channel resources of the nodes, an initial connection relationship table between the nodes is generated under the condition that the connection conditions are met. Based on the initial connection table between nodes, the initial network topology is formed; Based on the network topology, each node is assigned a routing path to other nodes and the routing information is recorded. Load data is collected for each link on the routing path, and the real-time communication load data of the link is recorded. Based on real-time communication load data of routing links, calculate the communication congestion of each link; Based on the communication congestion of the links, the connection relationships between nodes in the network are reallocated, and the routing paths are updated; Based on the adjusted node connection relationships, the network topology is regenerated and new routing paths are assigned; Based on the network topology and pre-defined task requirements, an emergency communication task model is generated, and task priorities are determined. Based on the emergency communication task model and task priority, specific tasks are assigned to eligible nodes; Based on the task allocation results, the communication frequency, channel resources and routing paths of the nodes are updated synchronously. According to the assigned tasks and updated communication parameters, each node in the ad hoc network is activated to perform emergency communication tasks. The method for generating the initial connection table between nodes includes 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 probe packet, check whether there is a conflict between the channel resources of the sending node and this node. If there is no conflict, record the node as a connectable node. For connectable nodes whose signal strength meets the preset threshold, further verify whether their communication frequency matches that of this node. If they match, proceed to the next step. For nodes that can be connected with matching communication frequencies, calculate whether the signal strength difference value satisfies the power ratio constraint for node connection. If it does, mark it as a candidate connection node. Based on the results of channel resource matching, communication frequency verification, and power differential calculation, each candidate connection node is verified to see if it meets the preset connection conditions. Record nodes that meet all connection conditions as connectable nodes of this node, and form an initial connection relationship table containing node identifier, signal strength, channel allocation and communication frequency; Perform bidirectional verification on each node in the initial connection table to make the marked connection a bidirectional connection, and finally determine the valid connection relationship of the node.

2. The decentralized self-organizing network emergency communication command method as described in claim 1, characterized in that, The specific formula for calculating power differential is as follows: ΔP ij =|P i -P j | Where, ΔP ij P represents the power difference between node i and node j. i P represents the transmitted signal power of node i. j This indicates the signal power received by node j; The formula for calculating the power ratio constraint in the connection condition verification is as follows: Among them, R ij This represents the ratio of the signal power received by node j to the signal power transmitted by node i. The rules for determining whether the connection conditions are met are as follows: When ΔP ij ≤ΔP max At that time, the power difference between node i and node j satisfies the constraint condition, where ΔP max This indicates the preset maximum power differential threshold. When R ij ≥R min And R ij ≤R max At that time, the power ratio R ij The connection condition is satisfied, where R min and R max These are the preset minimum and maximum power ratio thresholds, respectively.

3. The decentralized self-organizing network emergency communication command method as described in claim 1, characterized in that, The method for forming the initial network topology based on the initial connection table between nodes 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. Based on the signal strength S of the node pair ij Link quality metric Q ij The connection weight between node i and node j is calculated using the following formula: IN ij =αS ij +βQ ij Among them, W ij S represents the connection weight. ij Q represents the signal strength at node i and node j. ij This represents the link quality metric, where α and β are weighting coefficients; Based on the set of node pairs {(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 set of nodes, E represents the set of connecting edges, and W represents the weight of the edges; Perform 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; For the initially generated core connection E′, check whether the degree of each node meets the preset redundancy connection requirements. If the degree of a node is lower than the requirement, select an edge from the edge set E\E′ according to the weight priority principle to supplement it 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 set of nodes V and the set of edges E″ are used as the initial topology of the network.

4. The decentralized self-organizing network emergency communication command method as described in claim 1, characterized in that, The method for calculating the communication congestion of each link based on real-time communication load data of routing links includes the following steps: Real-time monitoring of each routing link is performed, and the data traffic F passing through the link within a preset time window is recorded. ij , where F ij This represents the real-time communication traffic between node i and node j; Based on the maximum available bandwidth B of the link ij and real-time data traffic F ij The bandwidth utilization of the link is calculated using the following formula: Among them, U ij B represents the bandwidth utilization of the link. ij The maximum bandwidth value for the predefined link; For each link, send a fixed-size data packet and record the round-trip delay D of the data packet from node i to node j. ij ; The number of packet losses L is recorded by the nodes on the link. ij The congestion loss rate of the link is calculated using the following formula: Among them, C ij L represents the congestion loss rate of the link. ij N represents the number of packets lost. ij The total number of packets sent; Combined with bandwidth utilization U ij Delay D ij and congestion loss rate C ij The communication congestion level of the link is calculated using a weighted formula, specifically: O ij =γ1U ij +γ2D ij +λ3C ij Among them, O ij The link represents the communication congestion level, where γ1, γ2, and γ3 are the weighting coefficients of bandwidth utilization, latency, and congestion loss rate, respectively, and satisfy γ1+γ2+γ3=1; Communication congestion O across all links ij The standardization process is performed, and the specific formula is as follows: Among them, O′ ij For standardized communication congestion, O min and O max These are the minimum and maximum communication congestion values ​​among all links, respectively; The node identifier, standardized communication congestion level, and other monitoring parameters of each link are recorded in the link congestion table as input data for subsequent network optimization.

5. The decentralized self-organizing network emergency communication command method as described in claim 1, characterized in that, The method for generating emergency communication task models and determining task priorities based on network topology and pre-defined task requirements includes the following steps: Extract the connection relationships, link bandwidth, communication latency, available computing resources, and available storage resources of each node from the network topology. Define task requirements based on the emergency scenario, and determine the parameters for each task, including data volume, computational requirements, latency constraints, and task priority factors. Based on the correlation between tasks, tasks are divided into multiple task groups, each containing several independent or related tasks; For each task, a task suitability score is calculated based on the node's available resources and task requirements. The specific formula is as follows: Among them, A ik C is the fitness score for node i to task k. i and S i R represents the computing and storage resources of node i. k and V k Given the computational requirements and data volume for task k, D ij T represents the latency of the task transmission link. k For task latency constraints; For each task, the overall priority is calculated by combining the priority factor of the task requirements and the suitability score. The specific formula is as follows: Among them, U k Let V be the overall priority of task k, and V be the set of all available nodes in the network. All tasks are sorted in descending order based on overall priority, and high-priority tasks are assigned to suitable nodes in the network first. The sorted tasks and their priorities, as well as the suitability scores between tasks and nodes, are recorded in the task model. A collaboration graph between tasks is then established based on the grouping situation, where each edge represents a data or control dependency between tasks. The emergency communication task model, which includes task allocation priorities, task node adaptation relationships, and collaboration diagrams, will be provided to the subsequent communication command scheme generation steps.

6. The decentralized self-organizing network emergency communication command method as described in claim 5, characterized in that, The method for generating a collaboration graph between tasks includes the following steps: Each task is viewed as a node in a graph, and the node contains the task's computational requirements, data volume, and priority attributes. Based on the task grouping results and task correlation calculations, edges are added between task nodes, and the edge weights represent the correlation between tasks. The shortest path algorithm is used to optimize the critical path in the collaboration graph; Generate a task collaboration graph containing task nodes, task edges, and optimized paths, which will serve as input data for subsequent task allocation.

7. The decentralized self-organizing network emergency communication command method as described in claim 5, characterized in that, Task grouping includes the following specific methods: For each pair of tasks, the correlation between tasks is calculated based on the amount of communication data that the tasks depend on and the timing requirements of task execution. Based on task relevance, a hierarchical clustering algorithm is used to divide tasks into multiple task groups. The task groups have high internal relevance and low inter-task group relevance.

8. A decentralized self-organizing network emergency communication command system, characterized in that, Includes the following modules: The node configuration module is used to allocate communication frequencies, channel resources, power control parameters, and routing policies to all nodes in the network. The initial connection generation module is used to generate an initial connection relationship table between nodes based on the communication frequency and channel resources of the nodes, provided that the connection conditions are met. The network topology building module is used to form the initial network topology based on the initial connection relationship table between nodes; The routing allocation module is used to assign routing paths to other nodes for each node based on the network topology and to 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. The congestion calculation module is used to calculate the communication congestion of each link based on real-time communication load data of the routing links. The connection relationship adjustment module is used to reallocate the connection relationships of nodes in the network and update the routing paths based on the communication congestion of the links. The topology optimization module is used to regenerate the network topology and allocate new routing paths based on the adjusted node connectivity. The task modeling module is used to generate emergency communication task models and determine task priorities based on network topology and preset task requirements. The task allocation module is used to allocate specific tasks to eligible nodes based on 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. The method for generating the initial connection table between nodes includes 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 probe packet, check whether there is a conflict between the channel resources of the sending node and this node. If there is no conflict, record the node as a connectable node. For connectable nodes whose signal strength meets the preset threshold, further verify whether their communication frequency matches that of this node. If they match, proceed to the next step. For nodes that can be connected with matching communication frequencies, calculate whether the signal strength difference value satisfies the power ratio constraint for node connection. If it does, mark it as a candidate connection node. Based on the results of channel resource matching, communication frequency verification, and power differential calculation, each candidate connection node is verified to see if it meets the preset connection conditions. Record nodes that meet all connection conditions as connectable nodes of this node, and form an initial connection relationship table containing node identifier, signal strength, channel allocation and communication frequency; Perform bidirectional verification on each node in the initial connection table to make the marked connection a bidirectional connection, and finally determine the valid connection relationship of the node.

9. The decentralized self-organizing network emergency communication command system as described in claim 8, characterized in that, The network topology construction module includes: The node pair extraction unit is used to extract the 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 node pairs based on the signal strength and link quality indicators of the node pairs. The specific formula is as follows: IN ij =αS ij +βQ ij Among them, W ij S represents the connection weight. ij Q represents the signal strength at node i and node j. ij This represents the link quality metric, where α and β are weighting coefficients; The weighted graph generation unit is used to generate a weighted undirected graph containing all nodes and edges based on the set of node pairs and the calculated connection weights. The minimum spanning tree generation unit is used to perform the minimum spanning tree algorithm on a weighted undirected graph, selecting the set of edges with the minimum total weight between nodes as the core connection in the initial topology. 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 requirements, an edge is selected from the edge set according to the weight priority principle to supplement it until the redundancy condition is met. The connectivity verification unit is used to perform connectivity verification on the updated set of connections to ensure that all nodes are in the same connected subgraph. The topology output unit is used to output the final set of nodes and edges, which serves as the initial topology of the network.

Images