Wireless ad hoc network safety communication method based on dynamic trust management

Abstract

The invention discloses a wireless ad hoc network secure communication method based on dynamic trust management, which comprises the following steps: setting initial trust values for all nodes, and detecting node interaction behaviors in real time; evaluating and dynamically adjusting a trust value according to a node interaction behavior; the source node communicates with the target node and interacts trust values of the nodes; in combination with a dynamic source routing protocol DSR, trust values of all nodes in the current path and a path average trust value are calculated; selecting a path meeting the dual trust threshold as a secure communication path; if the trust value of a certain node in the path is continuously lower than the threshold for three times, marking the node as a malicious node and adding the node into a blacklist for isolation; and if the trust value of the malicious node rises to be above the threshold value and lasts for 2 cycles, recovering the communication authority of the malicious node. According to the invention, the trust value can be adjusted according to the node interaction behavior, the secure communication path is screened, the malicious nodes are isolated, and the overall security of the network is improved.

Description

Technical Field

[0001] The present invention relates to the secure communication technology of a wireless ad hoc network (WANET), and particularly to a secure communication method for a wireless ad hoc network based on dynamic trust management. Background Art

[0002] An ad-hoc network is a wireless communication network without a central infrastructure and with the ability to adapt to dynamic topologies, which is widely used in scenarios such as the Internet of Things (IoT), vehicular ad hoc networks (VANET), and unmanned aerial vehicle swarms (UAV Swarm). In an ad-hoc network, each node is both a communication terminal and acts as a routing and forwarding role, relying on distributed protocols to autonomously establish and maintain the network. However, due to the lack of a fixed infrastructure and centralized management, the network faces serious security threats. In particular, attacks by malicious nodes may lead to data loss, communication interruption, and privacy leakage. First, malicious nodes disrupt communication by discarding or tampering with data, and traditional routing protocols (such as the dynamic source routing protocol DSR) lack effective identification mechanisms. Second, existing trust models (such as blockchain-based solutions) are highly complex, difficult to adapt to dynamic network environments, and have a lag in trust updates. Third, traditional routing algorithms do not combine real-time trust values, resulting in malicious nodes being easily selected into the communication path, leading to data leakage or interruption.

[0003] Therefore, there is an urgent need for a lightweight and dynamic trust management method that can dynamically evaluate trust values by combining real-time interaction data of nodes on the premise of low computational and storage overheads, and is closely combined with the routing selection mechanism to ensure high security and high reliability of the communication path. Summary of the Invention

[0004] The purpose of the present invention is to solve the above deficiencies in the prior art, and provide a secure communication method for a wireless ad hoc network based on dynamic trust management, which can adjust trust values according to node interaction behaviors, screen secure communication paths, isolate malicious nodes, and improve the overall security of the network.

[0005] A secure communication method for a wireless ad hoc network based on dynamic trust management performs the following steps to perform trust management on each node in the network, so as to adjust the network nodes for secure communication in real time, including the following steps:

[0006] S1 Trust initialization: Set initial trust values for all nodes and detect node interaction behaviors in real time;

[0007] S2 Dynamic adjustment of trust values: Evaluate and dynamically adjust trust values according to node interaction behaviors;

[0008] S3 Security path screening based on DSR: When the source node communicates with the destination node, the trust values of each node are exchanged; combined with the Dynamic Source Routing Protocol (DSR), the trust values of all nodes in the current path and the average path trust value are calculated; the path that meets the double trust threshold is selected as the secure communication path.

[0009] S4 Malicious node isolation: If the trust value of a certain node in the path is lower than the threshold for three consecutive times, it is marked as a malicious node and added to the blacklist for isolation; if the trust value of the malicious node rises above the threshold and lasts for 2 cycles, its communication permission is restored.

[0010] The initial value is set to 0.5.

[0011] The interaction behaviors include, but are not limited to, the packet forwarding success rate, end-to-end delay, packet loss rate, and repeated packet sending frequency; among them, the end-to-end delay and packet loss rate are negative interactions; among them, the packet forwarding success rate and repeated packet sending frequency are positive interactions.

[0012] If a negative interaction occurs, the trust value decreases and is ensured to be no lower than 0 at the lowest; if a positive interaction occurs, the trust value increases and is ensured to be no higher than 1 at the highest; update the trust value.

[0013] When the source node communicates with the destination node, the trust values of each node are exchanged, including:

[0014] The source node sends a Route Request (RREQ), and the source node broadcasts a route discovery message, attaching the current path trust value list and the source node trust value;

[0015] Route reply processing, the destination node or intermediate node returns path information, including the trust values of each node.

[0016] The trust value of a single node in the path needs to meet:

[0017]

[0018] Where T k,k+1 is the trust value of a single node.

[0019] The average trust value of path P has the following expression:

[0020]

[0021] Where n is the number of nodes on path P.

[0022] The selection of the path that meets the double trust threshold includes:

[0023] Perform node trust value judgment. If both the single-node trust value and the path average trust value are greater than or equal to 0.5, select this path for communication and repeat step S2; otherwise, the source node and the target node communicate to resend the routing request, and continue to calculate step S3.

[0024] The present invention has the following beneficial effects and advantages:

[0025] 1. The present invention adjusts the trust value according to actual interaction behaviors, enhancing network security.

[0026] 2. The present invention adopts a trust threshold mechanism to improve the reliability of data transmission.

[0027] 3. The present invention automatically detects and isolates malicious nodes, reducing the risk of network attacks.

[0028] 4. The wireless ad-hoc network secure communication method based on dynamic trust management proposed by the present invention can effectively improve the security of wireless ad-hoc networks, avoid interference from malicious nodes, ensure the stability and reliability of communication, and has broad application prospects. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] Figure 1 It is a flowchart of the wireless ad-hoc network secure communication method for dynamic trust management in the specific embodiment of the present invention.

[0030] Figure 2 It is a flowchart of the negative interaction of dynamic trust management in the specific embodiment of the present invention.

[0031] Figure 3 It is a flowchart of the positive interaction of dynamic trust management in the specific embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0032] To make the above objects, features, and advantages of the present invention more apparent and understandable, the following describes in detail the specific implementation method of the present invention with reference to the accompanying drawings. Many specific details are set forth in the following description to fully understand the present invention. However, the present invention can be implemented in many other ways different from those described herein, and those skilled in the art can make similar improvements without departing from the connotation of the invention. Therefore, the present invention is not limited by the specific implementations disclosed below.

[0033] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those of ordinary skill in the technical field to which this invention belongs. The terms used in the description of the present invention herein are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The present invention will be further described in detail below with reference to the accompanying drawings and embodiments.

[0034] Technical Solution:

[0035] Figure 1 A method for realizing secure communication through dynamic trust management in an ad hoc network in a specific implementation method of the present invention is as follows Figure 1 As shown, the steps are as follows: First, initialize all trusted nodes, and monitor node interaction behaviors (such as packet loss rate, delay) in real time to obtain trust evaluation bases; Second, dynamically adjust the node trust values based on the interaction results, and limit the range of trust values; Then, in combination with the Dynamic Source Routing Protocol (DSR), screen secure communication paths that meet the dual trust thresholds (single node trust value ≥ 0.5, average path trust value ≥ 0.5); Finally, automatically isolate malicious nodes whose trust values continuously fall below the threshold, block their interference with network communication, and finally achieve efficient dynamic security optimization of the ad hoc network

[0036] In step one, first, the initial trust values of all nodes need to be set to 0.5, and the node interaction behaviors are monitored in real time to obtain trust evaluation bases

[0037] The interaction behaviors include but are not limited to the success rate of packet forwarding, end-to-end delay, packet loss rate, and repeated packet sending frequency. For example, when node A sends data to adjacent node B, the monitoring system will track whether B completes data reception verification within a preset time window, generates an ACK confirmation frame, and correctly forwards it to the next-hop node, and at the same time counts the number of times of abnormal interruption or malicious tampering of data packets. Among them, the end-to-end delay and packet loss rate are negative interactions; among them, the packet forwarding success rate and repeated packet sending frequency are positive interactions

[0038] In step two, the node trust values are dynamically adjusted based on the interaction results, and the range of trust values is limited. The range of trust values is from 0 to 1, and it is ensured that the trust values will not be lower than 0 or exceed 1. Among them

[0039] If it is a negative interaction, as Figure 2 shown, the specific steps are as follows

[0040] 2-1-1. Receive the current interaction result, and obtain the current node trust value T_old

[0041] 2-1-2. Let T_temp = T_old - 1. Where T_temp is the node trust value after a negative interaction once

[0042] 2-1-3. Judge the relationship between T_temp and 0. If the former is smaller, then let T_new = 0; otherwise T_new = T_temp. Where T_new is the updated node trust value

[0043] 2-1-4. Update the trust value T_new, and this negative interaction ends

[0044] If it is a positive interaction, as Figure 3 shown, the specific steps are as follows

[0045] 2-2-1. Receive the current interaction result, and obtain the current node trust value T_old.

[0046] 2-2-2. Let T_temp = T_old + 1. Here, T_temp is the node trust value after a positive interaction.

[0047] 2-2-3. Judge the relationship between T_temp and 1. If the former is greater, then let T_new = 1; otherwise, T_new = T_temp. Here, T_new is the updated node trust value.

[0048] 2-2-4. Update the trust value T_new, and this positive interaction ends.

[0049] In step three, combined with the Dynamic Source Routing protocol (DSR), screen for secure communication paths that meet the dual trust thresholds.

[0050] 3-1-1. The source node sends a Route Request (RREQ). The source node broadcasts a route discovery message, attaching the current path trust value list and the source node trust value.

[0051] 3-1-2. Route reply processing. The destination node or intermediate node returns path information, including the trust values of each node.

[0052] Furthermore, for screening secure communication that meets the dual trust thresholds, the expressions for the trust value of a single node in the path and the average trust value of path P are as follows:

[0053] The trust value of a single node in the path needs to satisfy:

[0054]

[0055] where T k,k+1 is the trust value of a single node.

[0056] Calculate the average trust value of path P The expression is as follows:

[0057]

[0058] where n is the number of nodes on path P.

[0059] 3-1-3. Conduct node trust value judgment. If both the single node trust value and the path average trust value are greater than or equal to 0.5, then select this path for communication and repeat step two; otherwise, resend the route request and jump to step 3-1-1.

[0060] In step four, detect and isolate malicious nodes.

[0061] 4-1. During the above cycle iteration calculation process, if the node trust value is lower than 0.5 for three consecutive times, it will be marked as a malicious node, added to the blacklist, and refused to participate in network communication.

[0062] 4-2. If the trust value of the isolated node recovers to above 0.5 and remains for 2 cycles, the isolation will be lifted and it will be allowed to rejoin the network.

[0063] The above are only the preferred embodiments of the present invention, and do not impose any limitations on the present invention. Any simple modifications, changes, and equivalent structural changes made to the above embodiments according to the technical essence of the present invention still fall within the protection scope of the technical solution of the present invention.

Claims

1. A secure communication method for wireless ad hoc networks based on dynamic trust management, characterized in that, Perform the following steps to manage the trust of each node in the network, so as to adjust the network nodes for secure communication in real time, including the following steps: S1 Trust initialization: Set the initial trust value for all nodes and detect node interaction behaviors in real time; S2 Dynamic adjustment of trust value: Evaluate and dynamically adjust the trust value according to node interaction behaviors; S3 Secure path screening based on DSR: When the source node communicates with the target node, the trust values of each node are exchanged; Combining with the dynamic source routing protocol DSR, calculate the trust values of all nodes in the current path and the average trust value of the path; Select the path that meets the double trust threshold as the secure communication path; S4 Malicious node isolation: If the trust value of a certain node in the path is lower than the threshold for three consecutive times, mark it as a malicious node and add it to the blacklist for isolation; If the trust value of the malicious node rises above the threshold and lasts for 2 cycles, restore its communication permission.

2. The wireless ad-hoc network secure communication method based on dynamic trust management according to claim 1, wherein The initial value is set to 0.

5.

3. A secure communication method for wireless ad hoc networks based on dynamic trust management according to claim 1, characterized in that, The interaction behaviors include but are not limited to the packet forwarding success rate, end-to-end delay, packet loss rate, and repeated packet sending frequency; Among them, the end-to-end delay and packet loss rate are negative interactions; Among them, the packet forwarding success rate and repeated packet sending frequency are positive interactions.

4. A secure communication method for wireless ad hoc networks based on dynamic trust management according to claim 1, characterized in that, If a negative interaction occurs, the trust value is decreased, and ensure that it is not lower than 0 at the lowest; If a positive interaction occurs, the trust value is increased, and ensure that it does not exceed 1 at the highest; Update the trust value.

5. A secure communication method for wireless ad hoc networks based on dynamic trust management according to claim 1, characterized in that When the source node communicates with the target node, the trust values of each node are exchanged, including: The source node sends a route discovery request RREQ, and the source node broadcasts a route discovery message, attaching the current path trust value list and the source node trust value; Route reply processing, the target node or intermediate node returns path information, including the trust values of each node.

6. A secure communication method for wireless ad hoc networks based on dynamic trust management according to claim 1, characterized in that, The trust value of a single node in the path needs to satisfy: T k,k+1 ≥0.5， Among which T k,k+1 is the trust value of a single node.

7. A secure communication method for wireless ad hoc networks based on dynamic trust management according to claim 1, characterized in that Average trust value of path P The expression is as follows: where n is the number of nodes on path P.

8. A secure communication method for wireless ad hoc networks based on dynamic trust management according to claim 1, characterized in that, The selection of the path that meets the double trust threshold includes: Perform node trust value judgment. If both the single node trust value and the average path trust value are greater than or equal to 0.5, select this path for communication and repeat step S2; Otherwise, the source node and the target node communicate to resend the route request, and continue to calculate step S3.

Images