A communication method and system based on wireless ad hoc network technology

Abstract

The application discloses a communication method and system based on a wireless self-organizing network technology, and belongs to the wireless communication technical field.The method comprises the following steps: acquiring multi-dimensional state information of a local node itself, and generating a node state beacon to be broadcasted; receiving a node state beacon from a neighbor node; calculating a link stability index connected to the neighbor node; calculating a transmission energy cost of the link; and calculating a path total safety performance score of each candidate path in the network.The application introduces multi-dimensional state information, so that the decision basis is more comprehensive, the relative motion trend of the node can be evaluated by calculating a motion speed vector, so that the stability of the link can be predicted, instead of being passively responded after the link is interrupted, and the problem of frequent changes of the network topology is effectively solved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of wireless communication, in particular to a communication method and system based on wireless ad hoc network technology. BACKGROUND

[0002] Wireless ad hoc networks have irreplaceable roles in special scenarios such as post-disaster emergency rescue, battlefield environment, mine communication, etc. due to their characteristics of not needing pre-set infrastructure and being able to be quickly deployed. In these scenarios, communication nodes are often in a state of continuous movement, and the environmental electromagnetic interference is complex and changeable.

[0003] Existing technologies, such as ad hoc network solutions based on on-demand routing protocols or proactive routing protocols, have significant performance bottlenecks when dealing with the coupled challenges of high-speed node movement and strong channel interference. When the node moving speed exceeds a certain threshold or the environmental channel interference intensity is higher than a certain threshold, such as 1.5 m / s and -75 dBm, it will cause frequent changes in network topology and a sharp increase in communication power consumption.

[0004] Under this double pressure, the existing technology produces an irreconcilable contradiction: the pursuit of high throughput requires stable long connections and high transmission power, but this directly leads to the vulnerability of the network topology and the surge of node energy consumption. This coupling effect ultimately triggers systemic risks: the frequent routing discovery and high power compensation carried out by the network to maintain the connection not only occupies a large amount of effective bandwidth, causing a sharp drop in actual data transmission rate, but also causes key nodes as the backbone of the network to fail due to premature energy depletion, ultimately causing local or even the entire network to be paralyzed within the expected task period.

[0005] The above information disclosed in the above background section is only used to strengthen the understanding of the background of the present disclosure, and therefore it can include information that does not constitute prior art known to those of ordinary skill in the art. SUMMARY

[0006] The present application aims to solve the network performance decline, high energy consumption and systemic paralysis risks of existing wireless ad hoc network technology in complex environments due to high-speed node movement and high-intensity channel interference.

[0007] The technical solution of the present application is: a communication method based on wireless ad hoc network technology, the specific steps comprising:

[0008] S1, obtaining the multi-dimensional state information of the local node itself, and generating a node state beacon for broadcast;

[0009] Among them, the multi-dimensional state information includes the position coordinates, motion speed vector, residual energy and local average channel interference intensity of the node;

[0010] S2, receiving the node state beacon from the neighbor node;

[0011] and based on the received node status beacon and historical communication with the neighbor node, maintaining a neighbor historical performance table;

[0012] S3, based on the node status beacon of the neighbor node and the neighbor historical performance table, calculating a link stability index connecting to the neighbor node;

[0013] S4, based on the node status beacon of the neighbor node and the multi-dimensional state information of the local node, calculating a transmission energy efficiency cost of the link;

[0014] S5, in response to receiving a data transmission request, based on the calculated link stability index and transmission energy efficiency cost, calculating a path total security performance score for each candidate path in the network, and selecting the path with the highest path total security performance score as the optimal security performance path;

[0015] S6, transmitting data along the optimal security performance path, and for each hop in the optimal security performance path, using the theoretical minimum transmission power determined according to step S4 to transmit data.

[0016] In this embodiment, the step of calculating the link stability index includes:

[0017] S31, based on the motion velocity vector of the local node, the motion velocity vector of the neighbor node, and the residual energy of the neighbor node, calculating an instantaneous link stability index;

[0018] S32, based on the packet delivery success rate, the energy state reliability, and the link stability historical variance in the neighbor historical performance table, calculating a link trust score;

[0019] S33, combining the instantaneous link stability index and the link trust score to generate a historical corrected link stability index.

[0020] In this embodiment, the step of maintaining the neighbor historical performance table includes:

[0021] S21, using a sliding window mechanism to count the acknowledgement frames received from the neighbor node within a preset time window, and updating the packet delivery success rate accordingly;

[0022] S22, comparing the new energy value in the node status beacon of the neighbor node with the historical record, and marking the energy state reliability as low when the energy change rate exceeds the preset upper limit of physical power consumption;

[0023] S23, storing a set of latest instantaneous link stability indexes calculated for the neighbor node, and calculating the variance of the set of indexes to generate the link stability historical variance.

[0024] In the embodiment, the step of calculating the transmission energy efficiency cost of the link comprises:

[0025] S41, estimating a channel gain between nodes based on the position coordinates of the local node and the position coordinates of the neighbor node;

[0026] S42, calculating a theoretical minimum transmission power based on a preset target received signal-to-noise ratio, a local average channel interference intensity contained in the neighbor node beacon, and the channel gain;

[0027] S43, combining the theoretical minimum transmission power, the channel gain, and the residual energy of the local node to calculate the transmission energy efficiency cost.

[0028] In the embodiment, the step of calculating the total security performance score of each candidate path in the network comprises:

[0029] S51, obtaining a minimum value of the historical corrected link stability index of all links in the candidate path;

[0030] S52, calculating a sum of the transmission energy efficiency costs of all links in the candidate path;

[0031] S53, weighting and combining the minimum value and the sum value based on a global strategy weight to generate the total security performance score of the path.

[0032] In the embodiment, the determination manner of the global strategy weight comprises one of the following: in response to receiving an issued instruction, setting the global strategy weight according to the instruction;

[0033] When there is no instruction, calculating an average value of the link trust scores of all neighbor nodes, and adaptively adjusting the global strategy weight according to the average value.

[0034] In the embodiment, the calculation of the instantaneous link stability index comprises:

[0035] S31a, performing exponential decay operation on the modulus value of the velocity vector difference between the local node and the neighbor node to obtain a velocity stability component;

[0036] S31b, normalizing the residual energy of the neighbor node to obtain an energy stability component;

[0037] S31c, performing weighted summation on the velocity stability component and the energy stability component to generate the instantaneous link stability index.

[0038] In the embodiment, the method for calculating the link trust score comprises:

[0039] S32a, performing exponential decay operation on the link stability history variance by using a preset jitter penalty factor to obtain a historical stability penalty term;

[0040] S32b, combining the package delivery success rate, energy state credibility and historical stability penalty term to generate a link trust score.

[0041] In the embodiment, a communication system based on wireless ad hoc network technology comprises:

[0042] A state broadcast module is configured to obtain multi-dimensional state information of the local node itself and generate a node state beacon for broadcast.

[0043] A history maintenance module is configured to receive a node state beacon from a neighbor node and maintain a neighbor history performance table based on historical interactions with the neighbor node.

[0044] A link evaluation module is configured to calculate a historical corrected link stability index of a link connected to the neighbor node and calculate a transmission energy cost of the link.

[0045] A routing decision module is configured to calculate a path total security performance score for each candidate path in the network in response to a data transmission request and select a path with the highest score as an optimal security performance path.

[0046] A transmission control module is configured to perform data transmission along the optimal security performance path and use the theoretical minimum transmission power determined by the link evaluation module to perform transmission for each hop in the path.

[0047] The present application provides a communication method and system based on wireless ad hoc network technology, which has the following improvements and advantages compared with the prior art:

[0048] (1) The traditional technology is based on a single decision. The present application introduces multi-dimensional state information, making the decision basis more comprehensive. By calculating the motion velocity vector, the relative motion trend of the node can be evaluated to predict the stability of the link, rather than being passive after the link is interrupted, effectively addressing the problem of frequent changes in network topology.

[0049] (2) To address the problem of rapid increase in communication power consumption and premature depletion of energy of critical nodes, the present application designs a transmission energy cost index, which not only considers the theoretical minimum transmission power required to maintain communication, but also associates the remaining energy of the local node, making the energy cost one of the core factors for path selection, guiding the network to actively select more energy-efficient paths.

[0050] (3) The present application combines link stability and transmission energy cost through global strategy weights (alpha and beta) to generate a path total security performance score. This design provides an explicit trade-off mechanism. According to the patent description, the weights can be set by "command center instructions" or adjusted adaptively when there are no instructions.

[0051] (4) The present application adopts the calculated theoretical minimum transmission power at each hop of transmission. This is in sharp contrast to the traditional fixed high-power transmission mode, which ensures the fine use of energy from the implementation level, directly reduces the overall power consumption, and prolongs the network life cycle. BRIEF DESCRIPTION OF DRAWINGS

[0052] The present application will be further explained in conjunction with the accompanying drawings and embodiments:

[0053] Figure 1 is a flow chart of the system of the present application. DETAILED DESCRIPTION

[0054] In order to make the purpose, technical scheme and advantages of the present application more clear and explicit, the present application will be further explained in conjunction with specific embodiments.

[0055] Example 1:

[0056] Please refer to Figure 1 The present application provides a technical scheme of a communication method and system based on wireless ad hoc network technology: the specific steps include:

[0057] S1, obtaining the multi-dimensional state information of the local node itself, and generating a node state beacon for broadcast;

[0058] Among them, the multi-dimensional state information includes the position coordinates, motion velocity vector, residual energy and local average channel interference intensity of the node;

[0059] This S1 step is the sensing basis of the system, so that each node can efficiently distribute the basic data required for decision-making to the neighbors. The state sensing module in node i periodically obtains information and generates a state beacon containing the following contents: node ID, three-dimensional position coordinates P(x, y, z), motion velocity vector residual energy E rem , normalized to a dimensionless value between 0 and 1 (1 represents full energy, 0 represents energy depletion), and local average channel interference intensity

[0060] Through one broadcast, the key information of four dimensions of position, motion, energy and channel environment is efficiently distributed, providing real-time and comprehensive data input for subsequent link evaluation.

[0061] S2, receiving the node state beacon from the neighbor node;

[0062] and based on the received node state beacon and the historical communication with the neighbor node, maintaining a neighbor historical performance table;

[0063] The neighbor historical performance table includes the packet delivery success rate, energy state reliability and link stability historical variance.

[0064] This S2 step enables decision-making based on long-term performance rather than short-term transient state by maintaining historical data. Specifically, when node i receives the beacon of neighbor j, it updates the entry in its local NHPT, the neighbor history performance table, which contains: packet delivery success rate (PSR ij ), energy state credibility (CE j ), and link stability history variance

[0065] The historical performance evaluation mechanism for neighbor nodes is established, which can effectively identify and punish poorly performing links and nodes in history, improving the robustness and security of the network.

[0066] S3, based on the neighbor node state beacon and the neighbor history performance table, the link stability index connected to the neighbor node is calculated;

[0067] The instantaneous link stability index is calculated as a snapshot evaluation of the current state of the link. The link trust score (LTS ij ) is calculated as a reputation evaluation of the historical performance of the link.

[0068] The instantaneous link stability index and the link trust score are combined to generate the historical corrected link stability index

[0069] By multiplying the instantaneous state and the historical trust score for correction, a deep evaluation of the link quality is achieved, which can effectively avoid the false prosperity trap.

[0070] S4, based on the neighbor node state beacon and the multi-dimensional state information of the local node, the transmission energy cost of the link is calculated;

[0071] S4 step is used to quantify the cost of transmitting data through a certain link, considering both the transmission power and the remaining energy of itself.

[0072] S4 step establishes a quantitative model of link cost, enabling routing decisions to balance between stability and energy efficiency, thereby prolonging the life cycle of the entire network.

[0073] S5, in response to receiving a data transmission request, based on the calculated link stability index and transmission energy cost, the path total security performance score of each candidate path in the network is calculated, and the path with the highest path total security performance score is selected as the optimal security performance path.

[0074] S5 is the final routing decision step, which extends the single-link metric to the evaluation of the entire path and makes the optimal choice according to the policy weights. When the source node S needs to send data to the destination node D, a total score is calculated for all candidate paths, and the path with the highest score is selected.

[0075] S5 provides a flexible and powerful path selection framework, which enables the network to intelligently adapt to changes in tasks and environments by adjusting the policy weights.

[0076] S6, data transmission along the optimal security performance path, and for each hop in the optimal security performance path, the theoretical minimum transmission power determined in step S4 is used for data transmission.

[0077] S6 is the execution step of the decision, after the optimal path is selected, the data is forwarded with fine-grained power control. When the data packet is forwarded at each hop (from node i to node j), node i uses the estimated theoretical minimum transmission power to transmit signals. S6 realizes end-to-end energy saving, not only selects a path with high energy efficiency, but also uses appropriate transmission power at each hop, maximizing the endurance time of the node.

[0078] In this embodiment, the step of link stability index includes:

[0079] S31, based on the local node's motion speed vector, the neighbor node's motion speed vector, and the neighbor node's residual energy, calculate the instantaneous link stability index;

[0080] S32, based on the packet delivery success rate, energy state reliability, and link stability historical variance in the neighbor historical performance table, calculate the link trust score;

[0081] S33, combine the instantaneous link stability index and the link trust score to generate the historical corrected link stability index.

[0082] Generate the historical corrected link stability index

[0083] Formula:

[0084]

[0085] Formula meaning: by multiplying the dimensionless instantaneous value with the dimensionless trust degree, a comprehensive and dimensionless final stability index is obtained. The final score of a link with low historical reputation will be significantly lowered.

[0086] Historical corrected link stability index, which is the final, comprehensive stability evaluation value of the link from node i to node j.

[0087] Instantaneous link stability index, which represents the physical state evaluation of the link at the current time. It is mainly calculated according to the real-time acquired physical information, such as the relative speed between nodes, the residual energy of neighbor nodes, etc.

[0088] LTS ij : Link trust score.

[0089] In the embodiment, the step of maintaining the neighbor historical performance table comprises:

[0090] S21, using a sliding window mechanism, statistics the confirmation frame received from the neighbor node in the preset time window, and updating the packet delivery success rate accordingly;

[0091] The function of S21 step is to quantify and track the actual communication quality of the link. It is realized through a very direct and reliable mechanism:

[0092] The reception of the confirmation frame is the most basic feedback. When the node sends a data packet to the neighbor, if the confirmation frame returned by the neighbor can be successfully received, it is counted as a successful delivery; otherwise, it is a failure, which directly reflects whether the data can be successfully transmitted on the link.

[0093] The sliding window is used to ensure the timeliness of the data. It does not calculate the success rate of all time, but only focuses on the performance in the recent period of time. This makes the evaluation result more accurately reflect the real situation of the current and recent link, avoids being affected by the historical data that has been out of date, and thus makes a more timely response to the changes of the link quality.

[0094] The ultimate purpose of S21 step is to generate a dynamically updated value that can represent the reliability of the recent link, which is used for subsequent trust evaluation.

[0095] S22, comparing the new energy value in the node state beacon of the neighbor node with the historical record, and marking the energy state trust as low value when the energy change rate exceeds the preset physical power upper limit; The function of S22 step is to identify and mark the nodes with abnormal behavior or fraud, which serves as an energy trust verifier. The purpose of S22 step is to increase the security of the network, prevent data loss and network paralysis caused by selecting malicious or faulty nodes, and the preset physical power upper limit is 1.2 times the rated maximum power of the node.

[0096] S23, store a set of latest, neighbor node computed instantaneous link stability indexes, and compute the variance of the set to generate a link stability history variance. The role of S23 is to measure and penalize the instability or jitter of a link; variance is a statistical measure of the dispersion of data. Low variance means that the stability scores are very close to each other, indicating that the link performance is very stable and consistent; high variance means that the scores are high and low, and the link is good and bad, showing severe jitter.

[0097] In wireless communication, a stable link is much more popular than a link with severe performance fluctuations, because it is more predictable and reliable. Therefore, by computing this link stability history variance, a penalty term can be applied to those high-variance, jittery links in subsequent link trust score calculations.

[0098] The ultimate goal is to improve the quality of the selected path, and to prefer those links that are consistently stable rather than speculative links with high average but severe fluctuations, so as to ensure smooth and reliable data transmission.

[0099] In this embodiment, the step of calculating the transmission energy efficiency cost of the link includes:

[0100] S41, based on the position coordinates of the local node and the position coordinates of the neighbor node, estimate the channel gain between the nodes; estimate the channel gain G ij : calculate the distance according to the node position, and then substitute it into the path loss model to estimate the result as a dimensionless linear gain value.

[0101] S42, based on the preset target received signal-to-noise ratio, the local average channel interference intensity contained in the neighbor node beacon, and the channel gain, calculate the theoretical minimum transmission power; calculate the theoretical minimum transmission power According to the link budget equation, combined with the target received signal-to-noise ratio SINR min , the local interference intensity broadcast by neighbor j and the channel gain G ij , the value is calculated. The physical unit of this value is power unit.

[0102] S43, combined with the theoretical minimum transmission power, the channel gain and the remaining energy of the local node, calculate the transmission energy efficiency cost.

[0103] Calculate the transmission energy efficiency cost TEC ij , wherein the time T pkt required to transmit a standard data packet is about 0.012 seconds.

[0104] Formula:

[0105] Where: Ptx_ij is the theoretical minimum transmission power (W) calculated in S42. pkt is the time required to transmit one standard data packet. ij The unit is joule. pkt is about 0.012 seconds, and the formula means that the cost is proportional to the required transmission power and inversely proportional to the residual energy of the local node. That is, the greater the required transmission power or the lower the own energy, the higher the cost of transmitting through the link. TEC ij represents the energy consumed by transmitting one data packet, and the unit is joule. TEC is a dimensionless cost coefficient.

[0106] In this embodiment, the step of calculating the path total security performance score for each candidate path in the network includes:

[0107] S51, obtain the minimum value of the historical corrected link stability index of all links in the candidate path; obtain the path minimum stability: extract the minimum value of LSI of all links k in the path as the overall stability representative of the path.

[0108] S52, calculate the sum of the transmission energy efficiency costs of all links in the candidate path;

[0109] add TEC k of all links k in the path as the total energy efficiency cost of the path.

[0110] S53, weight and combine the minimum value and the sum value based on the global strategy weight to generate the path total security performance score.

[0111] The weight combination formula is:

[0112]

[0113] Wherein, α and β are dimensionless global strategy weights, respectively representing the importance of path stability and the degree of punishment for energy consumption (such as β> α in the energy-saving scenario)

[0114] min(LSI adj_k ) is the bottleneck stability of the path, which is a dimensionless value.

[0115] ∑TEC k is the total energy cost (J) required to transmit one data packet through the entire path.

[0116] E rem_S is the current residual energy (J) of the source node S.

[0117] The second term (∑TEC k

[0118] / E rem_S ) is dimensionless, representing the proportion of transmission energy consumption in the remaining energy of the source node. The higher the proportion, the higher the cost.

[0119] In order to make the subtraction operation physically valid, the dimensions of the two terms must be the same. Therefore, the weight coefficient β cannot be dimensionless. The role of β is to convert the cost term into a dimensionless evaluation value. Both α and β are dimensionless global strategy weight coefficients, representing the degree of emphasis on path stability and energy consumption, respectively.

[0120] V path : total security performance score of the path, which is the final quantitative score of a candidate path from the source node to the destination node. The higher the score, the better the overall performance of the path. The routing decision module will ultimately select the path with the highest V path score for data transmission.

[0121] α: stability strategy weight, dimensionless global strategy weight.

[0122] β: cost strategy weight, global strategy weight, used to convert the total cost in watts into a dimensionless value. The role of β is to convert the energy efficiency cost with physical units into a dimensionless evaluation value, so as to perform mathematical operations with the stability score which is also dimensionless. Increasing the value of β means that more emphasis will be placed on energy saving when selecting a path. In scenarios where the network needs to be sustained for a long time, the weight of β will be set higher.

[0123] By adjusting the values of α and β, the entire network can exhibit different behavioral preferences. For example, in a sudden rescue scenario, high α and low β can be set to prioritize smooth communication; in a long-term reconnaissance scenario, low α and high β can be set to prioritize node survival and network life cycle.

[0124] Path: candidate path, referring to a candidate communication path composed of multiple consecutive links from the source node to the destination node;

[0125] Historically corrected link stability index, which is the comprehensive stability score of the kth link in the path, a dimensionless evaluation value corrected by historical data;

[0126] Bottleneck stability of the path, this expression calculates the lowest value of LSI adj in all links in a complete path;

[0127] TEC k : transmission energy cost, which is the theoretical energy cost of sending a data packet once on the kth link.

[0128] ∑ k∈Path TEC k : Total transmission cost of a path, this expression calculates the total energy cost of all links in a complete path, which represents the complete energy cost of a data packet from source to destination.

[0129] The final path score is the weighted combination of the gain term of bottleneck stability and the penalty term of total energy cost. By adjusting α and β, the trade-off between stability and energy efficiency can be made.

[0130] In this embodiment, the determination of the global policy weight comprises one of the following: in response to receiving the issued instruction, setting the global policy weight according to the instruction;

[0131] When there is no instruction, calculating the average value of the link trust score of all neighbor nodes, and adaptively adjusting the global policy weight according to the average value.

[0132] In this embodiment, the calculation of the instantaneous link stability index comprises:

[0133] S31a, performing exponential decay operation on the modulus value of the speed vector difference between the local node and the neighbor node to obtain a speed stability component;

[0134] S31b, normalizing the residual energy of the neighbor node to obtain an energy stability component;

[0135] S31c, performing weighted summation on the speed stability component and the energy stability component to generate the instantaneous link stability index.

[0136] Formula:

[0137]

[0138] Parameter and dimension description:

[0139] The speed vector of node i and j, with the unit of m / s.

[0140] The residual energy of node j, which is a value from 0 to 100, so is a dimensionless value from 0 to 1.

[0141] w v ,w e : Dimensionless system-level configurable weight coefficient.

[0142] λ v : Decay factor of speed difference. To ensure that the parameter of the exponential term is dimensionless, the dimension of λ v must be the inverse of the speed dimension, i.e. s / m.

[0143] Formula meaning: This index comprehensively evaluates the relative motion of the node and the energy reserve of the neighbor node, and the result is a dimensionless evaluation value.

[0144] In this embodiment, the method for calculating the link trust score comprises:

[0145] S32a, the link stability history variance is subjected to exponential decay operation with a preset jitter penalty factor to obtain a history stability penalty term;

[0146] S32b, the packet delivery success rate, the energy state credibility and the history stability penalty term are combined to generate the link trust score.

[0147] Formula:

[0148]

[0149] Parameter and dimension explanation:

[0150] PSR ij : packet delivery success rate, a dimensionless ratio value between 0 and 1.

[0151] CE j : energy state credibility, a dimensionless indicator, for example, 1 represents credibility and 0.1 represents uncredibility.

[0152] The history variance of is dimensionless, so its variance is also dimensionless.

[0153] λ s : jitter penalty factor, to ensure that the exponential term parameter is dimensionless, λ s must also be a dimensionless system-level configurable parameter.

[0154] Formula meaning: This score comprehensively considers the history transmission success rate, the history data authenticity and the history performance stability.

[0155] In this embodiment, a communication system based on wireless ad hoc network technology comprises:

[0156] A state broadcast module is configured to obtain multi-dimensional state information of a local node itself, and generate a node state beacon for broadcast.

[0157] A history maintenance module is configured to receive a node state beacon from a neighbor node, and maintain a neighbor history performance table based on history interaction with the neighbor node.

[0158] a link evaluation module configured to calculate a history-corrected link stability index of a link connected to a neighbor node and to calculate a transmission energy cost of the link;

[0159] a route decision module configured to calculate a path total safety performance score for each candidate path in the network in response to a data transmission request and to select a path with the highest score as an optimal safety performance path;

[0160] a transmission control module configured to perform data transmission along the optimal safety performance path and to perform transmission with the theoretical minimum transmission power determined by the link evaluation module for each hop in the path.

[0161] The embodiment aims to solve the contradiction between high throughput and high energy consumption

[0162] The present application decouples the inevitable link between throughput and high energy consumption by introducing two concepts: transmission energy cost and theoretical minimum transmission power.

[0163] Calculating the theoretical minimum transmission power: Before selecting a path, the method of the present application calculates the theoretical minimum transmission power required for successful data transmission for each candidate link according to the preset target received signal-to-noise ratio, channel gain and environmental interference intensity in step S42. This completely abandons the mode of blindly using high power to ensure connection in the traditional method.

[0164] Introducing transmission energy cost: It is not enough to only calculate the minimum power. The present application further defines the transmission energy cost in step S43. This cost is directly proportional to the transmission power, and more importantly, it is inversely proportional to the remaining energy of the local node. This means that the less the remaining energy of a node, the higher the cost of transmitting data through it.

[0165] Punishing high energy consumption paths in decision-making: In the final path selection formula V path = α ·

[0166] min(LSI adj_k )- β · ( ∑TEC k / E rem_S ), the total transmission energy cost ∑TEC exists as a penalty term. High energy consumption paths will result in a lower final score, thus being suppressed in the decision-making stage.

[0167] This design enables the network to automatically avoid paths that require high power compensation or pass through low energy nodes when selecting paths, solving the problems of energy consumption surge and premature depletion of energy of key nodes.

[0168] It should be noted that the above examples are only used to illustrate the technical solutions of the present application but not limit the present application. Although the present application is described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solutions of the present application can be modified or equivalently replaced, without departing from the spirit and scope of the technical solutions of the present application, which should be covered in the scope of the claims of the present application.

Claims

1. A communication method based on wireless ad hoc network technology, characterized by, The specific steps include: S1, obtaining the multi-dimensional state information of the local node itself, generating a node state beacon and broadcasting it; The multi-dimensional state information includes the position coordinates, motion velocity vector, residual energy and local average channel interference intensity of the node; S2, receiving the node state beacon from the neighbor node; Based on the received node state beacon and the historical communication with the neighbor node, a neighbor historical performance table is maintained; The neighbor historical performance table includes the packet delivery success rate, energy state reliability and link stability historical variance; S3, based on the node state beacon of the neighbor node and the neighbor historical performance table, a link stability index connecting to the neighbor node is calculated; S4, based on the node state beacon of the neighbor node and the multi-dimensional state information of the local node, the transmission energy efficiency cost of the link is calculated; S5, based on the calculated link stability index and transmission energy efficiency cost, the total safety performance score of each candidate path in the network is calculated, and the path with the highest total safety performance score is selected as the optimal safety performance path; S6, data transmission is carried out along the optimal safety performance path, and the theoretical minimum transmission power is used for data transmission at each hop in the optimal safety performance path.

2. The communication method based on the wireless ad hoc network technology according to claim 1, characterized in that, The calculation process of the link stability index includes: S31, based on the motion velocity vector of the local node, the motion velocity vector of the neighbor node and the residual energy of the neighbor node, an instantaneous link stability index is calculated; S32, based on the packet delivery success rate, energy state reliability and link stability historical variance in the neighbor historical performance table, a link trust score is calculated; S33, the instantaneous link stability index and the link trust score are combined to generate a historical corrected link stability index.

3. The communication method based on the wireless ad hoc network technology according to claim 2, characterized in that, The steps of maintaining the neighbor historical performance table include: S21, using a sliding window mechanism, the acknowledgement frame received from the neighbor node within a preset time window is counted, and the packet delivery success rate is updated accordingly; S22, the energy change rate based on the new energy value in the node state beacon of the neighbor node and the historical record is calculated, and when the energy change rate exceeds the preset upper limit of physical power consumption, the energy state reliability is marked as low; S23, a group of latest instantaneous link stability indexes calculated for the neighbor node are stored, and the variance of the group of indexes is calculated to generate the link stability historical variance.

4. The communication method based on the wireless ad hoc network technology according to claim 1, characterized in that, The steps of calculating the transmission energy efficiency cost of the link include: S41, based on the position coordinates of the local node and the position coordinates of the neighbor node, the channel gain between the nodes is estimated; S42, based on the preset target received signal-to-noise ratio, the local average channel interference intensity contained in the neighbor node beacon and the channel gain, the theoretical minimum transmission power is calculated; S43, the transmission energy efficiency cost is calculated by combining the theoretical minimum transmission power, the channel gain and the residual energy of the local node.

5. The communication method based on the wireless ad hoc network technology according to claim 2, characterized in that, The steps of calculating the total safety performance score of each candidate path in the network include: S51, the minimum value of the historical corrected link stability index of all links in the candidate path is obtained; S52, the sum of the transmission energy efficiency costs of all links in the candidate path is calculated; S53, the minimum value and the sum value are combined by weighting to generate a path total security performance score.

6. The communication method based on the wireless ad hoc network technology according to claim 5, characterized in that, The determination manner of the global policy weight comprises the following: setting the global policy weight according to the received instruction; When there is no instruction, the average value of the link trust degree scores of all neighbor nodes is calculated, and the global policy weight is adaptively adjusted according to the average value.

7. The communication method based on the wireless ad hoc network technology according to claim 2, characterized in that, The specific steps of calculating the instantaneous link stability index comprise the following: S31a, the modulus value of the velocity vector difference between the local node and the neighbor node is calculated, and exponential decay operation is performed on the modulus value to obtain a velocity stability component; S31b, the residual energy of the neighbor node is normalized to obtain an energy stability component; S31c, the velocity stability component and the energy stability component are combined by weighting to generate the instantaneous link stability index.

8. The communication method based on the wireless ad hoc network technology according to claim 2, characterized in that, The specific steps of calculating the link trust degree score comprise the following: S32a, exponential decay operation is performed on the link stability history variance by using a preset jitter penalty factor to obtain a history stability penalty term; S32b, the packet delivery success rate, the energy state credibility and the history stability penalty term are combined to generate the link trust degree score.

9. A communication system based on wireless ad hoc networking technology, applied to the communication method based on wireless ad hoc networking technology in any one of claims 1-8, characterized in that, Comprise: A state broadcast module, configured to acquire multi-dimensional state information of the local node itself, and generate a node state beacon for broadcast; A history maintenance module, configured to receive the node state beacon from the neighbor node, and maintain a neighbor history performance table based on the historical interaction with the neighbor node; A link evaluation module, configured to calculate the history corrected link stability index of the link connected to the neighbor node, and calculate the transmission energy efficiency cost of the link; A routing decision module, configured to calculate the path total security performance score for each candidate path in the network in response to a data sending request, and select the path with the highest score as the optimal security performance path; A transmission control module, configured to perform data transmission along the optimal security performance path, and perform transmission by using the theoretical minimum transmission power determined by the link evaluation module for each hop in the path.

Images