A Method for Protecting Node Location Privacy in Wireless Sensor Networks with Energy Balance

Abstract

The present invention discloses a method for protecting the location privacy of nodes in a wireless sensor network with energy balance, belonging to the technical field of wireless sensor network communication support. A dynamic candidate area forwarding mechanism is designed, which effectively balances the energy consumption of the network and extends the service life of the network. The entire wireless sensor network is divided into a hot spot area, a non-hot spot area, and an interference ring. On this basis, a phantom routing mechanism with an interference path is designed in combination with a forward probability random routing method to protect the location privacy of source nodes in the non-hot spot area. A reverse probability random routing method is designed to protect the location privacy of source nodes in the hot spot area. In addition, an anti-range backtracking and anti-path backtracking mechanism is designed to resist the range locking and path tracking of the adversary on the sink node and protect the location privacy of the sink node. The present invention can effectively balance and reduce the network energy consumption and protect the location privacy of source nodes and sink nodes.

Description

Technical Field

[0001] The present invention relates to a method for protecting the location privacy of nodes in a wireless sensor network with energy balance, belonging to the technical field of wireless sensor network communication support. Background Art

[0002] Wireless sensor networks sense, collect, and process information of sensed objects within the network coverage by deploying a large number of sensors, providing real-time data for various application services. They play an irreplaceable role in environmental monitoring, disaster warning, traffic management, healthcare, emergency rescue, national defense, target tracking, etc.

[0003] In wireless sensor networks, the research directions on privacy issues are mainly divided into data-oriented privacy and context-oriented privacy. Data-oriented privacy focuses more on the confidentiality of data itself; context-oriented privacy includes hiding the location, identity of nodes, and the traffic between nodes. Traditional security solutions can ensure the confidentiality and integrity of data through security mechanisms such as encryption, decryption, and authentication, but this cannot guarantee the privacy of context. An adversary can still trace back to the vicinity of the source node or sink node through methods such as traffic analysis to monitor the scene, thus bringing security threats to the monitored object and the sink node. Therefore, it is crucial to protect the privacy of the locations of the source node and the sink node.

[0004] According to different requirements of network applications, researchers have proposed different node location privacy protection schemes. These schemes protect the location privacy of nodes in a wireless sensor network to a certain extent through methods such as flooding, random walk, and false source interference. At the same time, they also increase the energy overhead in the network. Some nodes will cause the energy to be quickly exhausted due to continuously forwarding data, resulting in an imbalance of the energy in the wireless sensor network, and then shortening the service life of the entire network. Summary of the Invention

[0005] In view of the above problems, the present invention proposes a method for protecting the location privacy of nodes in a wireless sensor network with energy balance, which realizes the protection of the location privacy of the source node and the sink node in a randomly deployed wireless sensor network; at the same time, it balances the energy consumption of the network through a dynamic candidate area forwarding mechanism, thereby extending the service life of the network.

[0006] A method for protecting the location privacy of nodes in a wireless sensor network with energy balance according to the present invention is characterized in that: the implementation method includes:

[0007] (1) Divide the entire wireless sensor network into a hot spot area, a non-hot spot area, and an interference ring according to the distance from the nodes in the network to the sink node;

[0008] (2) A dynamic candidate area forwarding mechanism is designed; each node in the network sets a data packet forwarding energy threshold and maintains a dynamic candidate list. When the node sends a data packet, it selects a node from the dynamic candidate list as the receiving node of the data packet to send the data packet, and updates the dynamic candidate list according to the feedback message of the receiving node;

[0009] (3) A source node location privacy protection mechanism is designed; the source node in the non-hotspot area sends the data packet to the proxy node through the phantom routing mechanism with interference paths and constructs multiple interference paths. After receiving the data packet, the proxy node sends the data packet to the hub node within the interference ring through the forward probability random routing method; the source node in the hotspot area sends the data packet to the hub node within the interference ring through the reverse probability random routing method; the hub node within the interference ring sends the data packet to the sink node according to the sink node location privacy protection mechanism;

[0010] (4) A sink node location privacy protection mechanism is designed; after the hub node located within the interference ring receives the data packet with the destination address of the sink node, it sends the data packet from the hub node to the neighbor node of the sink node according to the anti-range backtracking mechanism; after the neighbor node of the sink node receives the data packet with the destination address of the sink node, it forwards the data packet through the anti-path backtracking mechanism. In this process, the sink node receives the data packet with the destination address of the sink node based on the openness of network communication.

[0011] Further, the division of the hotspot area, non-hotspot area and interference ring is specifically described as follows:

[0012] In the network initialization stage, the sink node generates and broadcasts an initialization data packet to initialize the network. The initialization data packet includes sink node information , the number of hops that the data packet is forwarded (the initial value is ), the hotspot area threshold and the interference ring threshold ; each time the initialization data packet is forwarded, the number of hops that the data packet is forwarded is incremented by ; after the initialization is completed, each node in the network obtains the information of the sink node, the number of hops from itself to the sink node, and the neighbor list of this node.

[0013] Further, each node in the network compares the number of hops from itself to the sink node with the and in the received initialization data packet to determine the size relationship:

[0014] (1) If the number of hops from the node to the sink node is less than , then the node is classified into the hotspot area;

[0015] (2) If the hop count from the node to the sink node is between and , then the node is classified into the interference ring;

[0016] (3) If the hop count from the node to the sink node is greater than , then the node is classified into the non - hot - spot area.

[0017] Further, the initialization and dynamic update process of the data packet forwarding energy threshold and the dynamic candidate list of the node are specifically described as follows:

[0018] (1) Each node in the network initializes the data packet forwarding energy threshold of the node during the network initialization phase , and the node initializes the data packet forwarding energy threshold of the node to half of the remaining energy of the node;

[0019] (2) Each node in the network initializes the dynamic candidate list of the node during the network initialization phase. The node initializes the dynamic candidate list of the node to the set of all its neighbor nodes, and divides the nodes in the dynamic candidate list into a forward neighbor list and a reverse neighbor list ; among them, stores neighbor nodes with a hop count to the sink node smaller than its own, stores neighbor nodes with a hop count to the sink node greater than or equal to its own;

[0020] (3) Each data packet in the network contains a threshold item . When the source node needs to send data to the sink node, the source node generates a data packet and initializes the threshold item of the data packet to the data packet forwarding energy threshold of the source node; during the data packet forwarding process, when the receiving node receives the data packet, the receiving node will judge the size relationship between the threshold item of the data packet and its own remaining energy and forward the data packet according to the corresponding relationship:

[0021] ① If , the receiving node updates the threshold item of the data packet to its own data packet forwarding energy threshold , and forwards the data packet according to the preset routing method;

[0022] ② If , the receiving node will use the threshold item Update to its own data packet forwarding energy threshold and forward the data packet according to a preset routing method; the receiving node sends a feedback message to the sending node of the data packet, and after the sending node of the data packet receives the feedback message from the receiving node, it deletes the receiving node from the corresponding or in its own dynamic candidate list;

[0023] ③ If , the receiving node does not forward the data packet and sends a feedback message to the sending node of the data packet. After the sending node of the data packet receives the feedback message from the receiving node, it deletes the receiving node from the corresponding or in its own dynamic candidate list, and according to the preset routing method, re - selects a node from the or or in the dynamic candidate list of the sending node as the forwarding node to forward the data packet;

[0024] (4)When the number of nodes in the dynamic candidate list of a node in the network is less than of the number of its neighbor nodes, the node updates its own data packet forwarding energy threshold to the current of , and at the same time resets the dynamic candidate list to the set of all its neighbor nodes and divides the dynamic candidate list into a forward neighbor list and a reverse neighbor list .

[0025] Further, the phantom routing mechanism with interference paths is specifically described as follows:

[0026] The phantom routing mechanism with interference paths introduces the concept of true and false data packets. The data in the true data packet is the real data sent by the source node to the sink node. The false data packet has the same size as the true data packet, but the data it contains is false; both the true / false data packets contain a data packet identifier and a forwarding hop count. The source node sets the data packet identifier of the true data packet to , the forwarding hop count is , and randomly selects a node from the dynamic candidate list of the source node to send the true data packet. The node that receives the true data packet forwards the true data packet according to the mechanism of the source node sending the true data packet. The true data packet is forwarded After the jump, the current receiving node acts as the proxy node of the source node; in addition, the source node sends multiple fake data packets while sending real data packets, and the source node sets the data packet identifier of the fake data packets is , the forwarding hop count is , and randomly selects from the dynamic candidate list of the source node (where , is the number of neighbor nodes of the sending node) nodes to send fake data packets. The nodes that receive the fake data packets forward the fake data packets according to the mechanism of the source node sending the fake data packets. The fake data packets are forwarded hops and then terminate forwarding. The routing paths of these fake data packets form multiple interference paths.

[0027] Furthermore, the forward probability random routing method is specifically described as follows:

[0028] When a node in the network forwards a data packet, with probability randomly selects a neighbor node from the of the dynamic candidate list as the forwarding node to forward the data packet, and with probability randomly selects a neighbor node from the of the dynamic candidate list as the forwarding node to forward the data packet, where is a preset probability greater than .

[0029] Furthermore, the reverse probability random routing method is specifically described as follows:

[0030] When a node in the network forwards a data packet, with probability randomly selects a neighbor node from the of the dynamic candidate list as the forwarding node to forward the data packet, and with probability randomly selects a neighbor node from the of the dynamic candidate list as the forwarding node to forward the data packet, where is a preset probability greater than .

[0031] Furthermore, the anti-range backtracking mechanism is specifically described as follows:

[0032] When a node forwards a data packet, with probability randomly selects a neighbor node from the of the dynamic candidate list as the forwarding node, and with probability randomly selects a neighbor node from the of the dynamic candidate list as the forwarding node.

[0033]

[0034] Among them, is the initial probability, p 0 ∈[ 1 1+ e (1- p ) / 2 , 1 2 ] , is the probability increment step, , is the network diameter of the wireless sensor network, is the number of hops that the data packet is forwarded from the source node to the current node.

[0035] Since the nodes around the sink node forward data packets to the sink node more frequently, these nodes are more likely to disclose the location privacy of the sink node. To prevent an adversary from locking the range where the sink node is located through these nodes, the sensor nodes in the interference ring forward the data packet using an optimized probability random routing method after receiving the data packet, enriching and extending the routing path from the pivot node to the sink node, and diverting the adversary's attention to a larger range.

[0036] Furthermore, the anti-path backtracking mechanism is specifically described as follows:

[0037] When a neighbor node of the sink node receives a data packet with the destination address of the sink node, the neighbor node sets a forwarding hop count for the data packet, and randomly selects a node from the dynamic candidate list of the neighbor node as the forwarding node to forward the data packet, and the data packet terminates forwarding after being forwarded hops. When the neighbor node forwards the data packet, the sink node receives the data packet with the destination address of the sink node sent by the neighbor node based on the openness of wireless communication.

[0038] Since the sink node is the end point of data packet transmission, an adversary can infer the location of the sink node through path tracking. To resist the adversary's path tracking of the sink node, after the data packet reaches the neighbor node of the sink node, the neighbor node of the sink node randomly forwards the data packet for a specific number of hops and then terminates forwarding. In this process, the sink node receives the data packet sent by the neighbor node based on the openness of wireless communication to resist the adversary's path tracking.

[0039] Compared with the prior art, the present invention has the following beneficial effects:

[0040] The present invention divides the entire wireless sensor network into a hot spot area, a non-hot spot area, and an interference ring; designs a dynamic candidate area forwarding mechanism, which effectively balances the network energy consumption by dynamically updating the data packet forwarding energy threshold and the dynamic candidate list of nodes; respectively designs a routing mechanism combining phantom routing with an interference path and forward probability random routing and a reverse probability random routing mechanism to protect the location privacy of source nodes in the non-hot spot area and the hot spot area. This mechanism effectively ensures the length and richness of the routing paths from source nodes in different areas to the sink node, thus ensuring that the source nodes have a longer security period; on this basis, an anti-range backtracking mechanism and an anti-path backtracking mechanism are proposed. The above mechanisms fully consider the influence of the number of hops from network nodes to the sink node on the difficulty for an adversary to capture the sink node, enrich and extend the routing paths from the hub node to the sink node through an optimized probability random routing method, disperse the attention of the adversary to a larger range, and at the same time, the sink node can effectively resist the path tracking of the adversary by receiving data packets based on the openness of wireless communication. The present invention can effectively balance and reduce the network energy consumption, protect the location privacy of source nodes and sink nodes, and is applicable to location privacy protection in fields such as medical monitoring, battlefield monitoring, and wildlife habitat monitoring. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] Figure 1 It is the overall flowchart of an embodiment of the present invention.

[0042] Figure 2 It is the network initialization flowchart of an embodiment of the present invention.

[0043] Figure 3 It is the schematic diagram of network division of an embodiment of the present invention.

[0044] Figure 4 It is the routing schematic diagram of a source node in the non-hot spot area of an embodiment of the present invention.

[0045] Figure 5 It is the routing schematic diagram of a source node in the hot spot area of an embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0046] The following further describes the present invention in conjunction with the drawings and embodiments:

[0047] Figure 1 It is the overall flowchart of a method for protecting the location privacy of nodes in an energy-balanced wireless sensor network provided by an embodiment of the present invention. As Figure 1 shown, the method for protecting the location privacy of nodes in an energy-balanced wireless sensor network provided by the present invention mainly includes the following steps:

[0048] S1: Divide the entire wireless sensor network into hot spots, non-hot spots, and interference rings; nodes in the network set the data packet forwarding energy threshold and dynamic candidate list of the node, and forward data packets according to the dynamic candidate area forwarding mechanism.

[0049] Further, S1 may include S11~S15, as Figure 2 shown, S11~S15 are specifically:

[0050] S11: The sink node generates and broadcasts an initialization data packet.

[0051] After the network deployment is completed, the sink node generates and broadcasts an initialization data packet to initialize the wireless sensor network. The initialization data packet includes sink node information , the number of hops the data packet is forwarded (initial value is ), the hot spot area threshold and the interference ring threshold . Each time the initialization data packet is forwarded, the number of hops the data packet is forwarded is incremented by .

[0052] S12: Divide the entire wireless sensor network into hot spots, non-hot spots, and interference rings.

[0053] After the broadcast is completed, all nodes in the network obtain the number of hops from themselves to the sink node and compare the size relationship between this number of hops and the and in the received initialization data packet:

[0054] (1) If the number of hops from the node to the sink node is less than , then the node is classified into the hot spot area.

[0055] (2) If the number of hops from the node to the sink node is between and , then the node is classified into the interference ring.

[0056] (3) If the number of hops from the node to the sink node is greater than , then the node is classified into the non-hot spot area.

[0057] After the network initialization is completed, the entire wireless sensor network is divided into hot spots, non-hot spots, and interference rings, as Figure 3 shown.

[0058] S13: Each node in the network sets the data packet forwarding energy threshold of the node.

[0059] After the network initialization is completed, each node in the network sets the data packet forwarding energy threshold of the node The node initializes the data packet forwarding energy threshold of the node to half of the remaining energy of the node .

[0060] S14: Each node in the network generates a dynamic candidate list for the node and divides the dynamic candidate list into a forward neighbor list and a reverse neighbor list

[0061] After the network initialization is completed, each node in the network generates a dynamic candidate list for the node and forwards data packets according to the dynamic candidate area forwarding mechanism. The node initializes the dynamic candidate list of the node to the set of all neighbor nodes of the node, and divides the nodes in the dynamic candidate list into a forward neighbor list and a reverse neighbor list ; where stores neighbor nodes with a smaller hop count to the sink node than itself stores neighbor nodes with a hop count greater than or equal to itself to the sink node

[0062] S15: Nodes in the network forward data packets according to the dynamic candidate area forwarding mechanism

[0063] The dynamic candidate area forwarding mechanism is described in detail as follows

[0064] Each data packet in the network contains a forwarding threshold item . When a network node receives a data packet from node , it judges the size relationship between the threshold item of the data packet and its own remaining energy and forwards the data packet according to the corresponding relationship .

[0065] (1) When the remaining energy of the receiving node satisfies , the receiving node updates the threshold item of the data packet to its own data packet forwarding energy threshold and forwards the data packet according to the preset routing method .

[0066] (2) When the remaining energy of the receiving node satisfies , the receiving node forwards the data packet Threshold item Update to the data packet forwarding energy threshold of itself And forward the data packet according to the preset routing method Meanwhile, the receiving node Send the feedback message To the sender .

[0067] (3)When the remaining energy of the receiving node Satisfies , the receiving node Does not forward the data packet , and sends the feedback message To the sender . .

[0068] Node Receives the data packet And forwards the data packet When, the node As the sending node, sends the data packet according to the preset routing method , and waits for the feedback message of the receiving node .

[0069] (1)When the sending node Receives the feedback message of the receiving node , the sending node Deletes the receiving node From the Of the dynamic candidate list of Or Or .

[0070] (2)When the sending node Receives the feedback message of the receiving node , the sending node Deletes the receiving node From the Of the dynamic candidate list of Or Or , and according to the preset routing method, re-selects a node from the Or Or In the dynamic candidate list as the forwarding node to re-forward the data packet .

[0071] Node After completing the deletion operation, check the number of nodes in its own dynamic candidate list. When the node The number of nodes in the dynamic candidate list is less than that of its own neighbor nodes At this time, the node updates its data packet forwarding energy threshold to half of the current , and at the same time resets the dynamic candidate list to the set of all neighbor nodes of the node and divides the dynamic candidate list into a forward neighbor list and a reverse neighbor list .

[0072] S2: The source node selects the corresponding routing method according to the area where it is located and sends the data packet to the hub node within the interference ring.

[0073] When a node in the network needs to send a data packet to the sink node, this node automatically becomes the source node.

[0074] (1) When the source node is located in a non-hot spot area, the source node sends the data packet to the proxy node through the phantom routing mechanism with interference paths and constructs multiple interference paths. After receiving the data packet, the proxy node sends the data packet to the hub node within the interference ring through the forward probability random routing mechanism, as Figure 4 shown.

[0075] Furthermore, the phantom routing mechanism with interference paths is specifically as follows:

[0076] ① The true / false data packet contains the data packet identifier and the forwarding hop count. The source node sets the data packet identifier of the true data packet to , the forwarding hop count is , and randomly selects a node from the dynamic candidate list to send the true data packet. The node receiving the true data packet forwards the true data packet according to the mechanism by which the source node sends the true data packet. After the true data packet is forwarded hops, the current receiving node serves as the proxy node of the source node. In addition, the source node sends multiple false data packets while sending the true data packet. sets the data packet identifier of the false data packet to , the forwarding hop count is , and randomly selects (where , is the number of neighbor nodes of the sending node) nodes from the dynamic candidate list to send the false data packets. The node receiving the false data packet forwards the false data packet according to the false data packet forwarding mechanism adopted by the source node . After the false data packet is forwarded hops, the forwarding terminates. The routing paths of these false data packets form multiple interference paths.

[0077] ② Proxy node After receiving the data packet, it forwards the data packet to the hub node through the forward probability random routing method .

[0078] (2)When the source node is located in the hotspot area, the source node forwards the data packet to the hub node within the interference ring through the reverse probability random routing method , as Figure 5 shown.

[0079] S3: After the hub node receives the data packet with the destination address of the aggregation node, it sends the data packet to the neighbor node of the aggregation node according to the anti-range backtracking mechanism.

[0080] As Figure 4 , Figure 5 shown, the hub node (or ) after receiving the data packet with the destination address of the aggregation node, according to the anti-range backtracking mechanism, sends the data packet from (or ) to the neighbor node of the aggregation node (or ).

[0081] S4: After the neighbor node of the aggregation node receives the data packet with the destination address of the aggregation node, it forwards the data packet through the anti-path backtracking mechanism. In this process, the aggregation node receives the data packet with the destination address of the aggregation node based on the openness of network communication.

[0082] As Figure 4 , Figure 5 shown, the neighbor node of the aggregation node (or ) after receiving the data packet, sets a forwarding hop count for the data packet , and randomly selects a node from the dynamic candidate list of (or ) as the forwarding node to forward the data packet. The data packet is forwarded hops and then terminates forwarding. When the neighbor node of the aggregation node (or ) forwards the data packet, the aggregation node receives the data packet sent by the neighbor node of the aggregation node (or

[0083] ) based on the openness of (or ) wireless communication.

[0084] The method for protecting the location privacy of nodes in an energy-balanced wireless sensor network according to the embodiments of the present invention described above in combination with the accompanying drawings is used to protect the location privacy of source nodes and sink nodes in a wireless sensor network. However, the present invention is not limited to the described embodiments, and changes, modifications, substitutions, and deformations made to these embodiments without departing from the principles and spirit of the present invention still fall within the protection scope of the present invention.

Claims

1. A method for protecting the location privacy of nodes in a wireless sensor network with energy balance, characterized in that: The implementation method includes: (1) Divide the entire wireless sensor network into a hot spot area, a non-hot spot area, and an interference ring according to the distance from the nodes in the network to the sink node; (2) Design a dynamic candidate area forwarding mechanism; each node in the network sets a data packet forwarding energy threshold and maintains a dynamic candidate list. When the node sends a data packet, it selects a node from the dynamic candidate list as the receiving node of the data packet to send the data packet, and updates the dynamic candidate list according to the feedback message of the receiving node; (3) Design a source node location privacy protection mechanism; the source node in the non-hot spot area sends the data packet to the proxy node through the phantom routing mechanism with interference paths and constructs multiple interference paths. After receiving the data packet, the proxy node sends the data packet to the hub node within the interference ring through the forward probability random routing method; the source node in the hot spot area sends the data packet to the hub node within the interference ring through the reverse probability random routing method; the hub node within the interference ring sends the data packet to the sink node according to the sink node location privacy protection mechanism; (4) Design a sink node location privacy protection mechanism; after the hub node located within the interference ring receives the data packet with the destination address being the sink node, it sends the data packet from the hub node to the neighbor node of the sink node according to the anti-range backtracking mechanism; after the neighbor node of the sink node receives the data packet with the destination address being the sink node, it forwards the data packet through the anti-path backtracking mechanism. In this process, the sink node receives the data packet with the destination address being the sink node based on the openness of network communication.

2. The method for protecting the location privacy of nodes in an energy-balanced wireless sensor network according to claim 1, wherein: The division of the hot spot area, non-hot spot area, and interference ring is specifically described as: In the network initialization stage, the sink node generates and broadcasts an initialization data packet, which includes sink node information, the number of hops the data packet is forwarded, and the hotspot area threshold and the interference ring threshold ; After the broadcast is completed, all nodes in the network obtain the number of hops from themselves to the sink node and compare the size relationship between this number of hops and the and in the received initialization data packet: If the hop count from the node to the sink node is less than , then the node is classified into the hot spot area; (2) If the hop count from the said node to the sink node is between and , then the said node is classified into the interference ring; (3) If the hop count from the node to the sink node is greater than , then the node is classified into the non-hotspot area.

3. The method for protecting node location privacy with energy balance according to claim 1, characterized in that: The data packet forwarding energy threshold and dynamic candidate list of the node are specifically described as: (1)During the network initialization phase, each node in the network initializes the packet forwarding energy threshold of the node , and the node initializes the packet forwarding energy threshold of the node to half of the remaining energy of the node ; (2) Each node in the network initializes the dynamic candidate list of the node during the network initialization phase. The node initializes the dynamic candidate list of the node as the set of all neighbor nodes of the node, and divides the nodes in the dynamic candidate list into a forward neighbor list and a reverse neighbor list ; among them, stores neighbor nodes with a smaller hop count to the sink node than itself, stores neighbor nodes with a hop count greater than or equal to itself to the sink node; (3) Each data packet in the network contains a threshold item When the source node needs to send data to the sink node, the source node generates a data packet and initializes the threshold item of the data packet to the data packet forwarding energy threshold of the source node During the data packet forwarding process, when the receiving node receives the data packet, the receiving node will judge the threshold item of the data packet and its remaining energy and forward the data packet according to the following corresponding relationship: ① If , the receiving node updates the threshold item of the data packet to its own data packet forwarding energy threshold , and forwards the data packet according to a preset routing method; ② If , the receiving node updates the threshold item of the data packet to its own data packet forwarding energy threshold , and forwards the data packet according to a preset routing method; the receiving node sends a feedback message to the sending node of the data packet, and after the sending node of the data packet receives the feedback message from the receiving node, it deletes the receiving node from the corresponding or in its own dynamic candidate list; ③ If the receiving node does not forward the data packet and sends a feedback message to the sending node of the data packet. After receiving the feedback message from the receiving node the sending node of the data packet deletes the receiving node from the corresponding or in its own dynamic candidate list, and re - selects a node from the or or in the dynamic candidate list of the sending node as the forwarding node to forward the data packet; (4)When the number of nodes in the dynamic candidate list of nodes in the network is less than the number of neighbor nodes of the node at this time, the node updates its data packet forwarding energy threshold to the current , and at the same time resets the dynamic candidate list to the set of all neighbor nodes of the node and divides the dynamic candidate list into a forward neighbor list and a reverse neighbor list .

4. The method for protecting the location privacy of nodes in an energy-balanced wireless sensor network according to claim 1, wherein: The phantom routing mechanism with interference paths is specifically described as: The phantom routing mechanism with interference paths introduces the concept of true and false data packets. The data in the true data packet is the real data sent from the source node to the sink node. The false data packet has the same size as the true data packet, but the data it contains is false. The true / false data packets contain a data packet identifier and a forwarding hop count. The source node sets the data packet identifier of the true data packet as , the forwarding hop count is , and randomly selects a node from the dynamic candidate list of the source node to send the true data packet. The node that receives the true data packet forwards the true data packet according to the mechanism by which the source node sends the true data packet. After the true data packet is forwarded hops, the current receiving node acts as the proxy node of the source node. In addition, the source node sends multiple false data packets while sending the true data packet. The source node sets the data packet identifier of the false data packet as , the forwarding hop count is , and randomly selects (where , , is the number of neighbor nodes of the sending node) nodes from the dynamic candidate list of the source node to send the false data packets. The node that receives the false data packet forwards the false data packet according to the mechanism by which the source node sends the false data packet. After the false data packet is forwarded hops, the forwarding terminates. The routing paths of these false data packets form multiple interference paths.

5. The method for protecting the location privacy of nodes in an energy-balanced wireless sensor network according to claim 1, characterized in that: The forward probability random routing method is specifically described as: When a node in the network forwards a data packet, with probability randomly select a neighbor node from the of the dynamic candidate list as the forwarding node to forward the data packet, with probability randomly select a neighbor node from the of the dynamic candidate list as the forwarding node to forward the data packet, where is a preset probability.

6. The method for protecting the location privacy of nodes in an energy-balanced wireless sensor network according to claim 1, characterized in that: The reverse probability random routing method is specifically described as: When a node in the network forwards a data packet, with probability randomly select a neighbor node from the of the dynamic candidate list as the forwarding node to forward the data packet, with probability randomly select a neighbor node from the of the dynamic candidate list as the forwarding node to forward the data packet, where is a preset probability.

7. The energy-balanced node location privacy protection method according to claim 1, characterized in that: The anti-range backtracking mechanism is specifically described as: When a node forwards a data packet, with probability randomly select a neighbor node from the as the forwarding node, with probability randomly select a neighbor node from the as the forwarding node; Among them, is the initial probability, , is the probability increment step, , is the network diameter of the wireless sensor network, is the number of hops that the data packet has been forwarded from the source node to the current node.

8. The energy-balanced node location privacy protection method according to claim 1, characterized in that: The specific description of the anti-path backtracking mechanism is: When a neighbor node of the sink node receives a data packet with the destination address being the sink node, the neighbor node sets a forwarding hop count for the data packet , and randomly selects a node from the dynamic candidate list of the neighbor node as the forwarding node to forward the data packet, and the data packet terminates forwarding after being forwarded for a certain number of hops; when the neighbor node forwards the data packet, the sink node receives the data packet with the destination address being the sink node sent by the neighbor node based on the openness of wireless communication.

Images