Source node location privacy protection method and device

Abstract

The application discloses a source node position privacy protection method and device, wherein the source node position privacy protection method comprises the following steps: initializing a wireless sensor network to obtain a sub-node set of a next hop of each sensor node in the wireless sensor network; a source node forwards a collected data packet to a first node, the first node being a node with the highest energy in a sub-node set of the source node; the first node forwards the data packet to a second node after delaying for a random time length, the second node being a node with the highest energy in a sub-node set of the first node; the second node is regarded as the first node, and the step of forwarding the data packet to the second node after the first node delays for a random time length is performed until the data packet is sent to a sink node of the wireless sensor network. When the data packet is forwarded, the random time length is delayed, so that a reverse tracking attacker cannot infer a node forwarding the data packet of a last hop according to a data packet forwarding time period, and the position information of the source node is prevented from being leaked.

Description

TECHNICAL FIELD

[0001] The present application belongs to the technical field of information security, and particularly relates to a source node position privacy protection method and device. BACKGROUND

[0002] With the development of the Internet of Things technology, the application of wireless sensor networks is becoming more and more widespread. A wireless sensor network is formed by a large number of sensor nodes in a self-organizing manner, and has the characteristics of low cost, self-organization, low energy consumption, wireless communication, etc., and is often deployed in harsh, unattended natural environments. On the one hand, due to the characteristics of self-organization and wireless communication, an attacker can use the methods of listening to wireless signals and hop-by-hop backtracking to obtain the data packet transmission mode of the network, track the data source, and thus obtain the position information of the source node, which may cause the position information of the source node to be leaked. SUMMARY

[0003] The embodiments of the present application provide a source node position privacy protection method and device, which can effectively protect the position privacy of the source node and avoid the leakage of the position information of the source node.

[0004] In a first aspect, the embodiments of the present application provide a source node position privacy protection method, which comprises the following steps:

[0005] initializing a wireless sensor network to obtain a child node set of a next hop of each sensor node in the wireless sensor network;

[0006] forwarding a data packet collected by a source node to a first node, the first node being a node with the highest energy in a child node set of the source node;

[0007] delaying for a random time duration and then forwarding the data packet to a second node by the first node, the second node being a node with the highest energy in a child node set of the first node, and the source node, the first node and the second node all being sensor nodes of the wireless sensor network;

[0008] taking the second node as a first node, and performing the step of forwarding the data packet to a second node after the first node delays for a random time duration, until the data packet is sent to a sink node of the wireless sensor network.

[0009] In a second aspect, the embodiments of the present application provide a source node position privacy protection device, which comprises the following modules:

[0010] an initialization module, configured to initialize a wireless sensor network to obtain a child node set of a next hop of each sensor node in the wireless sensor network;

[0011] a processing module configured to forward the collected data packet to a first node by a source node, the first node being a node with the highest energy in a set of child nodes of the source node;

[0012] forwarding the data packet to a second node by the first node after a delay of a random time length, the second node being a node with the highest energy in a set of child nodes of the first node, the source node, the first node and the second node all being sensor nodes of the wireless sensor network;

[0013] taking the second node as the first node, performing the step of forwarding the data packet to a second node by the first node after a delay of a random time length, until the data packet is sent to a sink node of the wireless sensor network.

[0014] In a third aspect, an electronic device is provided, and the device includes a processor and a memory storing computer program instructions;

[0015] The processor, when executing the computer program instructions, implements the method of the first aspect.

[0016] In a fourth aspect, a computer storage medium is provided, and the computer readable storage medium stores computer program instructions, and the computer program instructions, when executed by a processor, implement the method of the first aspect.

[0017] In a fifth aspect, a computer program product is provided, and instructions in the computer program product, when executed by a processor of an electronic device, cause the electronic device to perform the method of the first aspect.

[0018] The source node location privacy protection method and device provided in the embodiments of the present application can make a reverse tracking attacker unable to infer a node forwarding a data packet according to a data packet forwarding time period, so that the location privacy of the source node can be well protected in a longer network working state, and the location information of the source node is avoided from being leaked. BRIEF DESCRIPTION OF DRAWINGS

[0019] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following will briefly introduce the drawings needed to be used in the embodiments of the present application. For those skilled in the art, other drawings can also be obtained without creative labor on the basis of these drawings.

[0020] Figure 1 is a flowchart of a source node location privacy protection method provided in an embodiment of the present application;

[0021] Figure 2is another flow diagram of a source node location privacy protection method provided by an embodiment of the present application;

[0022] Figure 3 is a structure diagram of a source node location privacy protection device provided by an embodiment of the present application;

[0023] Figure 4 is a structure diagram of an electronic device provided by yet another embodiment of the present application. DETAILED DESCRIPTION

[0024] The features and exemplary embodiments of various aspects of the present application will be described in detail below with reference to the drawings. To make the purpose, technical solutions and advantages of the present application more clear, the present application will be further described in detail below with reference to the drawings and specific embodiments. It should be understood that the specific embodiments described herein are only intended to explain the present application, but not to limit the present application. The present application can be implemented without some of the specific details by those skilled in the art. The following description of the embodiments is only to provide a better understanding of the present application by showing examples of the present application.

[0025] It should be noted that, in this document, relational terms such as first and second and the like can only be used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply that there is any such actual relationship or order between these entities or operations. Moreover, the terms "comprising", "including", or any other variant thereof are intended to cover non-exclusive inclusion, so that a process, method, article or apparatus that includes a list of elements does not only include those elements, but also includes other elements not explicitly listed or other elements inherent to such process, method, article or apparatus. Without more limitations, an element defined by the phrase "comprising a" does not exclude the presence of additional identical elements in the process, method, article or apparatus that includes the element.

[0026] To solve the problems in the prior art, the embodiments of the present application provide a source node location privacy protection method and device. First, the source node location privacy protection method provided by the embodiments of the present application will be introduced.

[0027] Figure 1 A flow diagram of a source node location privacy protection method provided by an embodiment of the present application is shown. As shown in Figure 1 The source node location privacy protection method provided by the embodiments of the present application includes the following steps 101-104, wherein:

[0028] Step 101, initializing a wireless sensor network, and obtaining a child node set of a next hop of each sensor node in the wireless sensor network.

[0029] A wireless sensor network generally comprises sensor nodes, sink nodes and management nodes. A large number of sensor nodes are randomly deployed in or near a monitoring area (sensor field) and can form a network in a self-organizing manner. The data monitored by the sensor nodes is transmitted hop by hop along other sensor nodes, and the monitored data can be processed by multiple sensor nodes during transmission and routed to a sink node after multiple hops, and finally reaches the management node through the Internet or satellite. Users configure and manage the sensor network through the management node, issue monitoring tasks and collect monitoring data.

[0030] In this step, the wireless sensor network is initialized, so that each sensor node can obtain a set of child nodes, and the nodes in the set of child nodes of the sensor node are the next hop nodes of the sensor node. The nodes in the set of child nodes are also sensor nodes in the wireless sensor network

[0031] Step 102, the source node forwards the collected data packet to the first node, and the first node is the node with the highest energy in the set of child nodes of the source node.

[0032] The source node is a sensor node of the wireless sensor network, and the source node obtains a data packet during data collection. The data packet can also be referred to as a monitoring data packet. A large amount of energy is consumed during data collection and forwarding of the sensor node. Based on this, the energy of each sensor node is not the same, and the node with the highest energy is selected for data packet forwarding, which can effectively ensure that the node has enough energy to forward the data packet.

[0033] Further, when the first node is selected, the first node is marked, indicating that the node has forwarded the data packet, and the next node forwarding the data packet will not select the marked child node to avoid repeated paths.

[0034] Step 103, the first node forwards the data packet to the second node after delaying for a random time, and the second node is the node with the highest energy in the set of child nodes of the first node. The source node, the first node and the second node are sensor nodes of the wireless sensor network.

[0035] The value of the random time t is t∈(0, t′), wherein the network transmission delay requirement is t′. The random time of each forwarding delay is different.

[0036] Step 104, taking the second node as the first node, performing the step of forwarding the data packet to the second node after the first node delays for a random time, until the data packet is sent to the sink node of the wireless sensor network.

[0037] In the embodiment, when forwarding the data packet, the delay of random duration can make the reverse tracking attacker unable to infer the node of the last hop forwarding the data packet according to the data packet forwarding time period, so that the location privacy of the source node can be well protected in a long-term network working state, and the location information of the source node can be avoided from being leaked.

[0038] In yet another embodiment of the present application, the step 101 of initializing the wireless sensor network to obtain a sub-node set of the next hop of each sensor node in the wireless sensor network comprises:

[0039] The step 1011 of initializing the wireless sensor network to obtain a neighbor node table of each sensor node in the wireless sensor network comprises the number of hops of the neighbor node of the sensor node from the sink node, the ID number of the neighbor node and the total number of the neighbor nodes.

[0040] After the initialization is completed, each sensor node obtains a neighbor node table, which comprises the number of hops of the neighbor node of the sensor node from the sink node, the ID number of the neighbor node and the total number of the neighbor nodes.

[0041] The step 1011 can specifically comprise the following steps.

[0042] The step 10111 of the sink node broadcasting the first information data packet in the wireless sensor network in a flooding manner, wherein the first information data packet is embedded with the first location information of the sink node.

[0043] The step 10112 of recording the first location information of the sink node in the first information data packet if the fifth node receives the first information data packet for the first time, wherein the fifth node is also a sensor node.

[0044] The step 10113 of the fifth node embedding the second location information of the fifth node into the first information data packet to obtain a second information data packet.

[0045] The step 10114 of the fifth node sending the second information data packet to other sensor nodes adjacent to the fifth node.

[0046] The step 10115 of initializing the wireless sensor network to be completed and obtaining the neighbor node table of each sensor node in the wireless sensor network when all the sensor nodes in the wireless sensor network receive the first location information.

[0047] Step 1012, each sensor node calculates a first hop number from the sink node according to the neighbor node table, and a second hop number from the sink node according to the neighbor node of the sensor node;

[0048] Step 1013, each sensor node divides the neighbor node of the sensor node according to the first hop number and the second hop number, to obtain a child node set of the next hop of each sensor node.

[0049] Specifically, for any third node in the wireless sensor network, if the second hop number of the fourth node is less than or equal to the first hop number of the third node, the fourth node is divided into the child node set of the third node, wherein the fourth node is the neighbor node of the third node.

[0050] For example, if the first hop number of sensor node 1 to the sink node is 3, the neighbor node of sensor node 1 is sensor node 2, and the second hop number of sensor node 2 to the sink node is 2, sensor node 2 is the child node of sensor node 1.

[0051] If the first hop number of sensor node 1 to the sink node is 3, the neighbor node of sensor node 1 is sensor node 2, and the second hop number of sensor node 2 to the sink node is 4, sensor node 2 is the parent node of sensor node 1.

[0052] In an embodiment of the present application, after the wireless sensor network is initialized in step 101 to obtain the child node set of the next hop of each sensor node in the wireless sensor network, before the source node forwards the collected data packet to the first node in step 102, the method further comprises:

[0053] For any sixth node in the wireless sensor network, the sixth node sends energy confirmation information to the child nodes in the child node set of the sixth node, and the energy confirmation information is used to trigger the child nodes to broadcast their own energy information, and the sixth node is also a sensor node.

[0054] The sixth node receives the feedback energy information of the child nodes.

[0055] In the embodiment, each sensor node sends energy confirmation information to its child nodes, and the child nodes can feed back their own energy information to the node sending the energy confirmation information in a broadcast manner after receiving the energy confirmation information.

[0056] In the above manner, each sensor node can obtain the energy information sent by its child nodes, and the energy information can include the current energy of each child node.

[0057] In yet another embodiment of the present application, the source node forwards the collected data packet to the first node, comprising:

[0058] The source node obtains a first transmission power radius according to an average transmission radius of the child nodes of the source node and a current energy of the source node.

[0059] The source node forwards the collected data packet to the first node by using the first transmission power radius.

[0060] In the embodiment, the source node optimizes the transmission power radius according to the current energy of the source node between sending data packets, thereby optimizing the energy consumption of the node and reducing the energy consumption of the source node.

[0061] It should be noted that the sensor nodes in the wireless sensor network can all adopt the above-mentioned manner of the source node adjusting the transmission power radius to adjust their own transmission power radius before forwarding the data packet, and forward the data packet by using the adjusted transmission power radius.

[0062] In yet another embodiment of the present application, the source node obtains a first transmission power radius according to an average transmission radius of the child nodes of the source node and a current energy of the source node, comprising the following four cases:

[0063] Case one: in the case that the current energy of the source node is less than or equal to a preset threshold, if the number of adjacent nodes of the source node is less than or equal to an average number of adjacent nodes of all sensor nodes in the wireless sensor network, the first transmission power radius F is determined according to the following expression:

[0064]

[0065] Wherein, μ+λ=1, μ and λ are adjustment factors, R is the average transmission radius of the child nodes of the source node, and the preset threshold is determined according to the initial energy of the source node.

[0066] Case two: in the case that the current energy of the source node is less than or equal to a preset threshold, if the number of adjacent nodes N1 of the source node is greater than an average number of adjacent nodes N2 of all sensor nodes in the wireless sensor network, the first transmission power radius F is determined according to the following expression:

[0067]

[0068] Wherein, μ+λ=1, μ and λ are adjustment factors, R is the average transmission radius of the child nodes of the source node, and the preset threshold is determined according to the initial energy of the source node.

[0069] Case three: in the case that the current energy of the source node is greater than the preset threshold, if the number of adjacent nodes of the source node is less than or equal to the average number of adjacent nodes of each sensor node in the wireless sensor network, the first transmission power radius F is determined according to the following expression:

[0070]

[0071] wherein μ+λ=1, μ and λ are adjustment factors, R is the average transmission radius of the child nodes of the source node, E1 is the initial energy of the source node, E2 is the current energy of the source node, and the preset threshold is determined according to the initial energy of the source node.

[0072] Case four: in the case that the current energy of the source node is greater than the preset threshold, if the number of adjacent nodes N1 of the source node is greater than the average number of adjacent nodes N2 of each sensor node in the wireless sensor network, the first transmission power radius F is determined according to the following expression:

[0073]

[0074] wherein μ+λ=1, μ and λ are adjustment factors, R is the average transmission radius of the child nodes of the source node, E1 is the initial energy of the source node, E2 is the current energy of the source node, and the preset threshold is determined according to the initial energy of the source node.

[0075] The source node position privacy protection method provided by the embodiments of the present application is illustrated as follows. Figure 2 As shown in the following, the method comprises the following steps:

[0076] Step one: network initialization. When the wireless sensor network is initialized, the sink node broadcasts an acknowledgement packet in a flooding manner in the whole network. The packet information is embedded with the position information of the sink node and other required initialization information, which can be node energy and the like.

[0077] When the other nodes receive the packet, they first need to determine whether the node is receiving the acknowledgement information packet for the first time. If not, the packet is automatically discarded. If it is the first time to receive the packet information, the initial information in the packet and the position information of the sink node are recorded, then the position information of the node itself is embedded in the packet, and the re-packaged packet information is forwarded to all adjacent nodes.

[0078] When the flooding of the acknowledgement information is completed, the initialization of all nodes in the whole network is completed, and each sensor node establishes a neighbor node table. The neighbor node table includes the hop number of the neighbor node from the sink node, the ID number and the total number of neighbor nodes.

[0079] Step two: Calculate the parent and child node set. Each sensor node calculates its own distance to the sink node and the distance of its neighbor nodes to the sink node according to the initialization information. By comparing the distance of itself to the sink node with the distance of its neighbor nodes to the sink node, the node set with less or equal distance than itself is called the child node set, the node set with more distance than itself is called the parent node set, and the neighbor nodes of each sensor node are divided into the candidate node set.

[0080] Step three: Send the confirmation information to the child node, and the child node feeds back the energy information. Before each sensor node sends the data packet, it sends the confirmation information to the adjacent child node. After the child node receives the confirmation information, it broadcasts its energy information to the node.

[0081] Step four: Select the high-energy child node, and adjust the transmission power of itself. After each sensor node receives the energy information broadcasted by its child node, it selects the node with higher energy to forward the information data packet. After the forwarding child node is selected, the transmission power radius of itself is adjusted. The adjustment algorithm is as follows:

[0082] The initial energy of the node in the network is set as E, and the energy of the node as the forwarding medium is E current The average radius of the child node of each sensor node is R, and μ and λ are the adjustment factors, and satisfy the condition μ+λ=1.

[0083] When E current ≤E / 2, when the number of adjacent nodes nb of the node is less than or equal to the average number of adjacent nodes of the network, the transmission power radius of the node is adjusted by formula (1):

[0084]

[0085] When the number of adjacent nodes nb of the node is greater than the average number of adjacent nodes of the network, the transmission power radius of the node is adjusted by formula (2):

[0086]

[0087] When E current >E / 2, when the number of adjacent nodes nb of the node is less than or equal to the average number of adjacent nodes of the network, the transmission power radius of the node is adjusted by formula (3):

[0088]

[0089] When the number of adjacent nodes nb of the node is greater than the average number of adjacent nodes of the network, the transmission power radius of the node is adjusted by formula (4):

[0090]

[0091] Step five: data packet forwarding. In order to resist the attacker's directional tracking of the source node, a non-repeated time delay method is used to forward the data packet. As described in step four, when the node forwards the data packet, it selects a node with the highest energy from the child node set as the carrier of the next hop information forwarding. When the child node is selected, it will be marked, indicating that the node has forwarded the data packet, and the next node forwards the data packet to avoid repeating the path and will not select the marked child node. At the same time, a random time delay t is added to the next forwarding, assuming that the network transmission delay requirement is t', then the random time t is t∈(0,t'), so that the attacker cannot infer the node forwarding the data packet of the last hop according to the data packet forwarding time period. When the nodes in the child node set are marked, the mark is cleared, and a new round of "selection-forwarding-marking" is performed. Thus, the source node's location privacy can be well protected in a longer network working state.

[0092] The source node location privacy protection method provided by the embodiments of the present application can resist directional tracking through non-repeated time delay directional random step routing, protect the source node's location privacy, and optimize the node energy consumption in combination with the adaptive transmission power algorithm, so that a good balance between security and network energy consumption can be achieved.

[0093] Figure 3 A structure diagram of a source node location privacy protection device provided by the embodiments of the present application is shown.

[0094] As shown in Figure 3 , the source node location privacy protection device 300 includes:

[0095] An initialization module 301 is configured to initialize a wireless sensor network, and obtain a child node set of a next hop of each sensor node in the wireless sensor network;

[0096] A processing module 302 is configured to forward a data packet collected by a source node to a first node through the source node, the first node being a node with the highest energy in a child node set of the source node;

[0097] The data packet is forwarded to a second node through the first node after a random time delay, the second node being a node with the highest energy in a child node set of the first node, and the source node, the first node and the second node all being sensor nodes of the wireless sensor network;

[0098] The second node is taken as the first node, and the step of forwarding the data packet to the second node after the first node delays for a random time is executed, until the data packet is sent to a sink node of the wireless sensor network.

[0099] In an embodiment of the present application, the processing module 302 is further configured to:

[0100] initializing the wireless sensor network to obtain a neighbor node table of each sensor node in the wireless sensor network, the neighbor node table including a hop number of a neighbor node of the sensor node to the sink node, an ID number of the neighbor node, and a total number of neighbor nodes of the neighbor node;

[0101] calculating, by each sensor node, a first hop number of itself to the sink node according to the neighbor node table, and a second hop number of a neighbor node of the sensor node to the sink node;

[0102] dividing, by each sensor node, the neighbor node of itself according to the first hop number and the second hop number to obtain a child node set of a next hop of each sensor node.

[0103] In an embodiment of the present application, the processing module 302 is further configured to:

[0104] for any third node in the wireless sensor network, if a second hop number of a fourth node is less than or equal to a first hop number of the third node, the fourth node is divided into a child node set of the third node, wherein the fourth node is a neighbor node of the third node.

[0105] In an embodiment of the present application, the processing module 302 is further configured to:

[0106] broadcasting, by the sink node, a first information data packet in the wireless sensor network in a flooding manner, the first information data packet embedding first location information of the sink node;

[0107] for any fifth node in the wireless sensor network, if the fifth node receives the first information data packet for the first time, recording the first location information of the sink node in the first information data packet;

[0108] embedding, by the fifth node, second location information of the fifth node into the first information data packet to obtain a second information data packet;

[0109] sending, by the fifth node, the second information data packet to other sensor nodes adjacent to the fifth node;

[0110] in a case where all sensor nodes in the wireless sensor network receive the first location information, initializing the wireless sensor network is completed to obtain a neighbor node table of each sensor node in the wireless sensor network.

[0111] In an embodiment of the present application, the processing module 302 is further configured to:

[0112] For any sixth node in the wireless sensor network, energy confirmation information is sent by the sixth node to a child node in a child node set of the sixth node, the energy confirmation information being used to trigger the child node to broadcast its own energy information;

[0113] Energy information of the feedback child node is received by the sixth node.

[0114] In an embodiment of the present application, the processing module 302 is further configured to:

[0115] The first transmission power radius is obtained by the source node according to the average transmission radius of the child nodes of the source node and the current energy of the source node.

[0116] The collected data packet is forwarded by the source node to the first node using the first transmission power radius.

[0117] In an embodiment of the present application, the processing module 302 is further configured to:

[0118] In a case where the current energy of the source node is less than or equal to a preset threshold, if the number of adjacent nodes of the source node is less than or equal to the average number of adjacent nodes of each sensor node in the wireless sensor network, the first transmission power radius F is determined according to the following expression:

[0119]

[0120] wherein μ+λ=1, μ and λ are adjustment factors, R is the average transmission radius of the child nodes of the source node, and the preset threshold is determined according to the initial energy of the source node.

[0121] In an embodiment of the present application, the processing module 302 is further configured to:

[0122] In a case where the current energy of the source node is less than or equal to a preset threshold, if the number of adjacent nodes N1 of the source node is greater than the average number of adjacent nodes N2 of each sensor node in the wireless sensor network, the first transmission power radius F is determined according to the following expression:

[0123]

[0124] wherein μ+λ=1, μ and λ are adjustment factors, R is the average transmission radius of the child nodes of the source node, and the preset threshold is determined according to the initial energy of the source node.

[0125] In an embodiment of the present application, the processing module 302 is further configured to:

[0126] In a case where the current energy of the source node is greater than a preset threshold, if the number of adjacent nodes of the source node is less than or equal to an average number of adjacent nodes of each sensor node in the wireless sensor network, the first transmission power radius F is determined according to an expression as follows:

[0127]

[0128] wherein μ+λ=1, μ and λ are adjustment factors, R is an average transmission radius of child nodes of the source node, E1 is the initial energy of the source node, E2 is the current energy of the source node, and the preset threshold is determined according to the initial energy of the source node.

[0129] In an embodiment of the present application, the processing module 302 is further configured to:

[0130] In a case where the current energy of the source node is greater than a preset threshold, if the number of adjacent nodes N1 of the source node is greater than an average number of adjacent nodes N2 of each sensor node in the wireless sensor network, the first transmission power radius F is determined according to an expression as follows:

[0131]

[0132] wherein μ+λ=1, μ and λ are adjustment factors, R is an average transmission radius of child nodes of the source node, E1 is the initial energy of the source node, E2 is the current energy of the source node, and the preset threshold is determined according to the initial energy of the source node.

[0133] The source node position privacy protection apparatus 300 provided by the embodiments of the present application can implement each process implemented by the source node position privacy protection method embodiments, and thus details are not repeated here.

[0134] Figure 4 A hardware structure schematic diagram of the source node position privacy protection method provided by the embodiments of the present application is shown.

[0135] The electronic device can include a processor 401 and a memory 402 having computer program instructions stored therein.

[0136] Specifically, the processor 401 can include a central processing unit (CPU), or an application specific integrated circuit (ASIC), or can be configured as one or more integrated circuits implementing the embodiments of the present application.

[0137] Memory 402 may include a large capacity memory for data or instructions. By way of example and not limitation, memory 402 may include a hard disk drive (HDD), a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a magnetic tape, or a universal serial bus (USB) drive, or a combination of two or more of these. Where appropriate, memory 402 may include removable or non-removable (or fixed) media. Where appropriate, memory 402 may be inside or outside the integrated gateway disaster recovery device. In a specific embodiment, memory 402 is a non-volatile solid-state memory.

[0138] The memory may include a read-only memory (ROM), a random access memory (RAM), a magnetic disk storage medium device, an optical storage medium device, a flash memory device, an electrical, optical or other physical / tangible memory storage device. Thus, generally, the memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., a memory device) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors), it is operable to perform the operations described with reference to the method according to the first aspect or the second aspect of the present disclosure.

[0139] The processor 401 reads and executes computer program instructions stored in the memory 402 to implement any one of the source node location privacy protection methods in the above embodiments.

[0140] In one example, the electronic device may further include a communication interface 403 and a bus 410. Figure 4 As shown, the processor 401 , the memory 402 , and the communication interface 403 are connected via a bus 410 and communicate with each other.

[0141] The communication interface 403 is mainly used to implement communication between various modules, devices, units and / or equipment in the embodiments of the present application.

[0142] Bus 410 includes hardware, software, or both, to couple source node location privacy protection method and apparatus components to each other in source node location privacy protection method and apparatus. While Figure 4 shows a bus, busses, and the like can be utilized in communicating messages among the source node location privacy protection method and apparatus components in source node location privacy protection method and apparatus. In this regard, busses can be used to implement any of the inter-chip busses, inter-processor busses, standard computers busses, wire or wireless networks, printers busses, scanners busses, disk drives busses, etc. Those skilled in the art will appreciate that the information busses with which source node location privacy protection method and apparatus is described are merely illustrative and are not intended to limit the scope of source node location privacy protection method and apparatus. For example, internal communication can be accomplished via micro-switches, micro-relays, or optical fibers. Further, various busses can be used as necessary or desired, including time-multiplexed and / or frequency-multiplexed busses. Also, custom busses can be built that are optimized for the transmission of information unique to source node location privacy protection method and apparatus.

[0143] In addition, in combination with the source node location privacy protection method in the above embodiments, the embodiments of the present application can provide a computer storage medium to implement. The computer storage medium has computer program instructions stored thereon; the computer program instructions are executed by a processor to implement any of the source node location privacy protection methods in the above embodiments.

[0144] It is to be understood that the present application is not limited to the particular configurations, processes, and materials described and illustrated herein, as such methods and materials can vary as desired. For the sake of brevity and clarity, detailed descriptions of well-known methods, procedures, and materials will not be provided herein. In the above embodiments, several specific steps are described and illustrated in order to provide a thorough disclosure of the application. However, the method processes of the present application can be performed in a number of different specific sequences, and steps can be modified, added, or omitted, without departing from the spirit of the present application.

[0145] The functional blocks shown in the block diagrams described above can be implemented as hardware, software, firmware, or a combination thereof. When implemented in hardware, they can be, for example, electronic circuits, application specific integrated circuits (ASICs), appropriate firmware, plug-ins, functional cards, and the like. When implemented in software, the elements of the present application are program or code segments that are used to perform the required tasks. The program or code segments can be stored in a machine-readable medium or transmitted through a data signal carried in a carrier wave over a transmission medium or communication link. A "machine-readable medium" includes any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio frequency (RF) links, and the like. The code segments can be downloaded via a computer network, such as the Internet, an intranet, and the like.

[0146] It is also need to be explained that the example embodiments mentioned in the present application describe some methods or systems based on a series of steps or devices. However, the present application is not limited to the order of the above steps, that is, the steps can be performed in the order mentioned in the embodiments, can be different from the order in the embodiments, or several steps are performed simultaneously.

[0147] The computer program instructions can also be loaded onto a computer, other programmable data processing apparatus, or other processing device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other processing device to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions / acts specified in the flowchart and / or block diagram block or blocks.

[0148] The above only describes specific implementation manners of the present application. For the convenience and brevity of description, the specific working process of the system, module and unit described above can refer to the corresponding process in the foregoing method embodiments, which will not be described herein. It should be understood that the protection scope of the present application is not limited to this. Any person skilled in the art can easily think of various equivalent modifications or replacements within the technical range disclosed in the present application, and these modifications or replacements should be covered by the protection scope of the present application.

Claims

1. A source node location privacy protection method, characterized in that, The method comprises: initializing a wireless sensor network to obtain a sub-node set of a next hop of each sensor node in the wireless sensor network; a source node forwards a collected data packet to a first node, the first node being a node with the highest energy in a sub-node set of the source node; the first node forwards the data packet to a second node after delaying for a random time period, the second node being a node with the highest energy in a sub-node set of the first node, the source node, the first node and the second node all being sensor nodes of the wireless sensor network; the second node is taken as a first node, and the step of forwarding the data packet to a second node after the first node delays for a random time period is performed until the data packet is sent to a sink node of the wireless sensor network.

2. The method of claim 1, wherein, The initializing of the wireless sensor network to obtain the sub-node set of the next hop of each sensor node in the wireless sensor network comprises: initializing the wireless sensor network to obtain a neighbor node table of each sensor node in the wireless sensor network, the neighbor node table comprising a hop number of a neighbor node of a sensor node from the sink node, an ID number of the neighbor node and a total number of neighbor nodes; each sensor node calculates a first hop number of itself from the sink node and a second hop number of a neighbor node of the sensor node according to the neighbor node table; each sensor node divides the neighbor node of itself according to the first hop number and the second hop number to obtain a sub-node set of a next hop of each sensor node.

3. The method of claim 2, wherein, The dividing of the neighbor node of the node according to the first hop number and the second hop number to obtain the sub-node set of the next hop of each sensor node comprises: for any third node in the wireless sensor network, if a second hop number of a fourth node is less than or equal to a first hop number of the third node, the fourth node is divided into a sub-node set of the third node, wherein the fourth node is a neighbor node of the third node.

4. The method of claim 2, wherein, The initializing of the wireless sensor network to obtain the neighbor node table of each sensor node in the wireless sensor network comprises: the sink node broadcasts a first information data packet in a flooding manner in the wireless sensor network, the first information data packet embedding first position information of the sink node; for any fifth node in the wireless sensor network, if the fifth node receives the first information data packet for the first time, the first position information of the sink node in the first information data packet is recorded; the fifth node embeds second position information of the fifth node into the first information data packet to obtain a second information data packet; the fifth node sends the second information data packet to other sensor nodes adjacent to the fifth node; in a case where all sensor nodes in the wireless sensor network receive the first position information, the initializing of the wireless sensor network is completed to obtain the neighbor node table of each sensor node in the wireless sensor network.

5. The method of claim 1, wherein, After the wireless sensor network is initialized and the sub-node set of the next hop of each sensor node in the wireless sensor network is obtained, before the source node forwards the collected data packet to the first node, the method further comprises: For any sixth node in the wireless sensor network, the sixth node sends energy confirmation information to the sub-nodes in the sub-node set of the sixth node, and the energy confirmation information is used to trigger the sub-nodes to broadcast their own energy information; The sixth node receives the feedback energy information of the sub-nodes.

6. The method of claim 1, wherein, The source node forwards the collected data packet to the first node, comprising: The source node obtains a first transmission power radius according to the average transmission radius of the sub-nodes of the source node and the current energy of the source node; The source node forwards the collected data packet to the first node by using the first transmission power radius.

7. The method of claim 6, wherein, The source node obtains a first transmission power radius according to the average transmission radius of the sub-nodes of the source node and the current energy of the source node, comprising: In the case that the current energy of the source node is less than or equal to a preset threshold, if the number of adjacent nodes of the source node is less than or equal to the average number of adjacent nodes of each sensor node in the wireless sensor network, the first transmission power radius F is determined according to the following expression: Wherein, μ+λ=1, μ and λ are adjustment factors, R is the average transmission radius of the sub-nodes of the source node, and the preset threshold is determined according to the initial energy of the source node.

8. The method of claim 6, wherein, The method further comprises: In the case that the current energy of the source node is less than or equal to a preset threshold, if the number of adjacent nodes N1 of the source node is greater than the average number of adjacent nodes N2 of each sensor node in the wireless sensor network, the first transmission power radius F is determined according to the following expression: Wherein, μ+λ=1, μ and λ are adjustment factors, R is the average transmission radius of the sub-nodes of the source node, and the preset threshold is determined according to the initial energy of the source node.

9. The method of claim 6, wherein, The source node obtains a first transmission power radius according to the average transmission radius of the sub-nodes of the source node and the current energy of the source node, comprising: In the case that the current energy of the source node is greater than a preset threshold, if the number of adjacent nodes of the source node is less than or equal to the average number of adjacent nodes of each sensor node in the wireless sensor network, the first transmission power radius F is determined according to the following expression: Wherein, μ+λ=1, μ and λ are adjustment factors, R is the average transmission radius of the sub-nodes of the source node, E1 is the initial energy of the source node, E2 is the current energy of the source node, and the preset threshold is determined according to the initial energy of the source node.

10. The method of claim 6, wherein, The source node obtains a first transmission power radius according to the average transmission radius of the sub-nodes of the source node and the current energy of the source node, comprising: In the case that the current energy of the source node is greater than a preset threshold, if the number of adjacent nodes N1 of the source node is greater than the average number of adjacent nodes N2 of each sensor node in the wireless sensor network, the first transmission power radius F is determined according to the following expression: Wherein, μ+λ=1, μ and λ are adjustment factors, R is an average transmission radius of the child nodes of the source node, E1 is an initial energy of the source node, E2 is a current energy of the source node, and the preset threshold is determined according to the initial energy of the source node.

11. A source node location privacy protection apparatus, characterized by comprising: The device comprises: an initialization module, configured to initialize a wireless sensor network to obtain a child node set of a next hop of each sensor node in the wireless sensor network; a processing module, configured to forward a data packet collected by a source node to a first node, the first node being a node with the highest energy in a child node set of the source node; forward the data packet to a second node after a random delay through the first node, the second node being a node with the highest energy in a child node set of the first node, the source node, the first node and the second node all being sensor nodes of the wireless sensor network; take the second node as a first node, and perform the step of forwarding the data packet to a second node after a random delay by the first node, until the data packet is sent to a sink node of the wireless sensor network.

Images