CN108848461B - WSNs source node position privacy protection method based on dynamic loop routing - Google Patents
WSNs source node position privacy protection method based on dynamic loop routing Download PDFInfo
- Publication number
- CN108848461B CN108848461B CN201810607462.8A CN201810607462A CN108848461B CN 108848461 B CN108848461 B CN 108848461B CN 201810607462 A CN201810607462 A CN 201810607462A CN 108848461 B CN108848461 B CN 108848461B
- Authority
- CN
- China
- Prior art keywords
- node
- ring
- data packet
- nodes
- confusion
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0407—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/029—Location-based management or tracking services
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a WSNs source node position privacy protection method based on dynamic loop routing. The method is divided into three stages: the first stage, after the network is initialized, all nodes know the hop count from the nodes to the sink node and construct an initial confusion ring; in the second stage, an intermediate node is randomly selected from a semicircular area determined by the source node and the sink node, and the source node transmits the message to the intermediate node; and in the third stage, the intermediate node sends the message to the nearest ring node on the current confusion ring, and after random hop number on the ring, the intermediate node transmits the message to the sink node by a shortest path method. The invention can ensure that the intermediate node is far away from the source node enough, the routing of the data packet from the source node to the sink node is random each time, and the use of a plurality of confusion rings can not only improve the utilization rate of energy in the network, but also prolong the service life of the network while protecting the position privacy of the source node.
Description
Technical Field
The invention belongs to the technical field of wireless sensor network communication support, and particularly relates to a WSNs source node position privacy protection method based on dynamic loop routing.
Background
Wireless Sensor Networks (WSNs) have been applied in many areas, for example: infrastructure monitoring and information collection. The position privacy becomes the focus of attention of people, the information provided by the position privacy brings convenience to people on one hand, and on the other hand, the leakage of the position privacy brings great risk. The research on location privacy requires convenience for people, and the location privacy is not utilized by lawbreakers. Therefore, in the case of malicious attacks, protecting the messages of a good location is a key issue for location privacy services.
Although we can deal with the privacy problem of the source location by encryption, it still cannot protect the location information of the source. Although the attacker cannot break the encrypted information between the nodes, the attacker can determine the position of the panda through data packet tracking and flow analysis, track the activity of the panda all the time, and implement hunting and other measures on the panda. This illustrates the importance of protecting the privacy of the source location.
There have been many studies on this aspect for the protection problem of the location privacy of the source node, but most of the conventional studies do not balance the situations of security and energy use, and the idea of dynamic movement using a confusion ring is proposed herein to solve this problem. Firstly, a region is determined by the sink node and the source node together, a node is randomly selected from the region to serve as an intermediate node, and a data packet is transmitted to the intermediate node. Then, the intermediate node sends the data packet to the nearest ring node on the current confusion ring, and the ring node randomly selects the clockwise or anticlockwise direction to transmit the data packet on the confusion ring and simultaneously integrates the transmission of the false data packet; and finally, the link point sends the data packet to the sink node through a routing method.
In order to design an efficient source node location privacy protection scheme, researchers at home and abroad propose various routing mechanisms, and relevant documents are as follows:
1. in 2015, Jun Long et al in Anenergy-efficient and sink-location private transmitted scheme for WSNs through set Based routing propose a scheme RBR (Ring Based routing) for protecting the location privacy of sink nodes. The RBR scheme is composed of a plurality of routing rings and routing lines, and data packets of the nodes are not directly sent to the sink node but sent to the nearest routing ring. Data is routed through nodes in the ring and sent to other routing rings via routing lines. The routing loop moves in an irregular mode, and even if the sink position is fixed, an attacker can be tempted. Besides, the routing loop is constructed according to network energy analysis, residual energy in the network is fully used, and the network energy utilization rate and the network service life are improved.
2. In 2017, Guangwu et al propose a Constrained Random Routing Mechanism in "Constrained Routing mechanisms for source Privacy Protection in WSNs", which can continuously change the selection of a next-hop route to replace a relatively fixed Routing path, so that an attacker is difficult to analyze and track to a source node. First, a specific selection field is generated in the vicinity of the transmitting node according to the danger distance and the communication radius. The sending node then calculates their magnitudes from the skew angles of the candidate nodes in the domain. And finally, determining the selection of the next hop node according to the magnitude.
3. In 2017, Nikolaos Barotis et al, Load-correlation of base-station Location privacy in wireless sensor networks, proposed a PLAUDIT (Preserve Location analysis through Unit Distribution of Traffic) scheme to protect the Location privacy of Base Stations (BS). This technique injects spurious packets so that the traffic density in the network is relatively uniform and makes BS discrimination difficult. This document emphasizes the balance of location privacy and network lifetime, thereby protecting location privacy of base stations.
Disclosure of Invention
Aiming at the problems, the invention provides a WSNs source node position privacy protection method based on dynamic loop routing, which comprises the steps of randomly selecting an intermediate node in an area jointly determined by a source node and a sink node in a randomly deployed wireless sensor network on the premise that the nodes do not know the topology of the whole network, and then sending a data packet to the selected intermediate node by a routing method; the intermediate node sends the data packet to the nearest ring node on the current confusion ring, and the ring node selects the neighbor node on the confusion ring as the next hop node. In order to induce the direction of an attacker deviating from the real source node, the transmission of a false data packet is merged into the route. And finally, the ring node on the confusion ring sends the data packet to the sink node through a routing method.
The technical purpose is achieved, the technical effect is achieved, and the invention is realized through the following technical scheme:
a WSNs source node position privacy protection method based on dynamic loop routing comprises the following steps:
the method comprises the following steps: network initialization
The network consists of a sink node and a large number of common sensor nodes, wherein the sink node is positioned in a central position of the network, the common sensor nodes are randomly deployed in a network monitoring area, and the common sensor nodes can become a source node, an intermediate node, a ring node and a false source node in a specific routing period;
after the network deployment is completed, the sink node starts to broadcast an initialization beacon to the network, wherein the initialization beacon comprises information such as a hop value, the position of the sink node, a hop threshold and the like. After receiving the initialization beacon, the common sensor node acquires hop value, base station node position and hop threshold information from the received initialization beacon, processes the beacon and broadcasts the processed beacon to the neighbor nodes of the common sensor node, and therefore all nodes in the network can generate a neighbor list according to the hop value of the neighbor nodes. And forming the same ring by the nodes with the same hop number from the sink node to generate a ring list, wherein the nodes on the ring are ring nodes. Distance network centerh 0 The ring nodes at the hop form an initial confusion ring,h 0 and randomly selecting the maximum hop value from 1/2 to 1/3 of the distance sink node.
Step two: selection of intermediate nodes
When a source node needs to send event information, firstly, a selectable region of an intermediate node is determined according to the positions of the source node and a sink node, then a point is randomly determined in the region, the node closer to the point is the intermediate node, and then a data packet is sent to the intermediate node through a routing algorithm;
step three: confusion of data packets on a ring
When the intermediate node sends a data packet to the confusion ring, the intermediate node firstly sends the data packet to a ring node which is closer to the intermediate node on the current confusion ring; secondly, randomly deciding to select a neighbor node in a clockwise or anticlockwise direction as a next hop from neighbor nodes of the same ring by the ring node, and randomly selecting the next hop from the neighbor nodes of the direction once the direction is selected until an included angle formed by a ray of the sink node and the first ring node and a ray of the sink node and the current ring node is more than or equal to a preset angle; in order to induce an attacker to deviate from the direction of a real source node, the generation and the transmission of a false data packet are merged into a path;
step four: passing of confusion rings to sink nodes
When the data packet is confused to a certain degree on the confusion ring, the ring node selects a node which is closer to the sink node from the neighbor nodes as a next hop, the data packet is sent to the node, and the node which receives the data packet transmits the data packet to the direction which is close to the sink node in the same way until the data packet reaches the sink node.
Step five: dynamic movement of confusion rings
After a period of time, the residual energy of the nodes on the current confusion ring is less, and in order to not influence the normal function of the network, when the energy of the nodes on the confusion ring reaches a certain threshold value, a new confusion ring is dynamically generated; similarly, when the energy of the node on the confusion ring reaches a certain threshold again, a new dynamic confusion ring is generated again. Dynamic movement of the confusion ring not only balances the energy consumption use condition of the nodes in the network, but also improves the utilization rate of energy in the network.
In the first step, the specific method for network initialization is as follows:
the network consists of a sink node and a large number of common sensor nodes, wherein the sink node is located in a central position of the network, the common sensor nodes are randomly deployed in a network monitoring area, and the common sensor nodes can become a source node, an intermediate node, a ring node and a false source node in a specific routing period. The sink node broadcasts an initialization beacon message to the network, an initial hop value is set to be 0, hop values of other nodes are infinite, and the node which receives the beacon message for the first time adds 1 to the hop value. If the jump value added with 1 is larger than the original value, the jump value is discarded; otherwise, the hop count value incremented by 1 is saved and broadcasted to the neighbor nodes. By analogy, the nodes in the whole network obtain the hop count information from the node to the sink node. And finally, each node divides the ring according to the hop count of the distance sink node. And forming the same ring by the nodes with the same hop number from the sink node to generate a ring list, wherein the nodes on the ring are ring nodes. Distance network centerh 0 The ring nodes at the hop form an initial confusion ring,h 0 and randomly selecting the maximum hop value from 1/2 to 1/3 of the distance sink node.
In the second step, the specific method for selecting the intermediate node is as follows:
and determining a selectable region of the intermediate node according to the position information of the source node and the sink node, and randomly determining a point in the selectable region. After the point is determined, the source node selects a neighbor node closer to the point from the neighbor nodes as a next hop each time, and selects the next hop in the same method until the distance between the neighbor node and the point is less than or equal to the communication radius, so that the neighbor node is selected as an intermediate node. And after the intermediate node is determined, the source node sends the data packet to the intermediate node through the shortest path.
In the third step, the confusion of the data packets on the ring specifically includes:
after the intermediate node is determined, the intermediate node selects a node which is closer to the confusion ring from the neighbor nodes as a next hop each time until the next hop node is a ring node on the confusion ring. After the data packet reaches the first ring node, randomly selecting an initial motion direction with the same probability, wherein data traffic in two directions exists on a confusion ring; each node is represented by a probabilityp= 1/6 false packet request is sent to ring with 1 hop number greater than ring hop number, node receiving false packet request is on one hand used as false source node to send false packet to requesting node, on one hand used as false source node to send false packet request to ring node with 1 hop number greater than self, and so on, until false source node reaches network edge. The nodes on the confusion ring receiving the false data packets discard the false data packets, and only pass real data packets along the confusion ring. And when the included angle formed by the ray of the sink node and the first ring node and the ray of the sink node and the current ring node is larger than or equal to a preset angle, the ring node stops selecting the next hop ring node, and the data packet is sent to the sink node along the shortest path.
In the fourth step, the transmission from the ring node to the sink node is specifically as follows:
when the data packet is confused to a certain degree on the confusion ring, the ring node selects a node which is closer to the sink node from the neighbor nodes as a next hop, the data packet is sent to the node, and the node which receives the data packet transmits the data packet to the direction which is close to the sink node in the same way until the data packet reaches the sink node.
The invention has the beneficial effects that:
the invention randomly selects the intermediate node in the constructed variable region, thereby ensuring that the intermediate node is in a range far away from the source node and has randomness; secondly, by dynamic movement of the confusion ring, the residual energy of the nodes in the network is fully utilized, and the service life of the network is prolonged while the position privacy of the source node is enhanced.
Drawings
FIG. 1 is a schematic diagram of the network initialization of the present invention;
FIG. 2 is a first diagram illustrating the selection of an intermediate node according to the present invention;
FIG. 3 is a second diagram illustrating the selection of an intermediate node according to the present invention;
FIG. 4 is a third diagram illustrating the selection of an intermediate node according to the present invention;
FIG. 5 is a fourth schematic diagram illustrating the selection of an intermediate node according to the present invention;
FIG. 6 is a schematic diagram of the transmission over the confusion ring according to the present invention;
FIG. 7 is a diagram illustrating dynamic movement of a confusion ring.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The following detailed description of the principles of the invention is provided in connection with the accompanying drawings.
In order to solve the problem that the position of a source node in a randomly deployed wireless sensor network is easy to expose, on the premise that the node does not know the topology of the whole network, a data packet is sent to a randomly selected intermediate node in a randomly determined variable region, and the intermediate node is ensured to be far away from the source node; meanwhile, the dynamic movement of the confusion ring is used for reducing the energy consumption of the network as much as possible and balancing the energy consumption of the network, so that the service life of the network is prolonged, the invention provides a privacy protection method for the source node position of the wireless sensor network based on dynamic ring routing, which comprises the following steps:
the method comprises the following steps: as shown in fig. 1, initialization of the network.
The network consists of a sink node and a large number of common sensor nodes, wherein the sink node is located in a central position of the network, the common sensor nodes are randomly deployed in a network monitoring area, and the common sensor nodes can become a source node, an intermediate node, a ring node and a false source node in a specific routing period.
After the network deployment is completed, the sink node starts to broadcast an initialization beacon to the network, wherein the initialization beacon comprises information such as a hop value, the position of the sink node, a hop threshold and the like. After receiving the initialization beacon, the common sensor node acquires hop value, base station node position and hop threshold information from the received initialization beacon, processes the beacon and broadcasts the processed beacon to the neighbor nodes of the common sensor node, and therefore all nodes in the network can generate a neighbor list according to the hop value of the neighbor nodes. And forming the same ring by the nodes with the same hop number from the sink node to generate a ring list, wherein the nodes on the ring are ring nodes. Distance network centerh 0 The ring nodes at the hop form an initial confusion ring,h 0 the maximum hop value from the sink node is chosen randomly from 1/2 to 1/3, i.e., node A, B, C, D, E, F, G, H in fig. 1 constitutes the initial ring node. In the present invention, all nodes can know their own location according to GPS positioning technology.
Step two: as shown in fig. 2, 3, 4, 5, selection of intermediate nodes.
And determining an area according to the positions of the source node S and the sink node, randomly determining a point in the area, and after the point is determined, selecting a node which is closer to the point from the neighbor nodes as a next hop by the source node every time until the distance between the neighbor nodes and the point is less than or equal to the communication radius, and selecting the neighbor nodes as intermediate nodes.
In order to ensure that the routing path from the source node to the intermediate node does not pass through the current confusion ring, the present invention proposes that the source node and the intermediate node to be selected should be on the same side of the current confusion ring.
When the source node is in the current confusion ring and the source node is close to the sink node, in order to enable the intermediate node to have a large enough selection area, the source node routes towards the direction far away from the sink nodeh d But not more than the number of hops the current ring is on. In FIG. 2, the source node S is closer to the sink node, and S routes in a direction away from the sink nodeh d Jumping to the S ', establishing coordinates by taking the X-axis of the ray where the S ' and the sink node are located, the Y-axis of the ray passing through the sink node and perpendicular to the X-axis direction, constructing a circle by taking the distance between the S ' and the sink node as a radius and the sink node as a circle center, and taking a semicircular area where the right side of the Y-axis is located as an area selectable by the middle node. In addition, in order to ensure that the intermediate node cannot be too close to the real source node, the safe area except the source node in the semicircular area is the area which can be selected by the final intermediate node.
When the source node is in the current confusion ring and the source node is far away from the sink node, as shown in fig. 3, a ray where the source node S and the sink node are located is an x-axis, a ray passing through the sink node and perpendicular to the x-axis direction is a y-axis to establish coordinates, a circle is constructed by taking the distance between the S and the sink node as a radius and the sink node as a circle center, and a semicircular region where the right side of the y-axis is located is a region where the middle node can select. In addition, in order to ensure that the intermediate node cannot be too close to the real source node, the safe area except the source node in the semicircular area is the area which can be selected by the final intermediate node.
When the source node is outside the current confusion ring and the source node is closer to the current confusion ring, as shown in fig. 4, the source node routes in a direction away from the sinkh d A hop to node S'. Establishing coordinates by taking the ray where the S 'and the sink node are located as an x-axis, the ray which passes through the sink node and is perpendicular to the x-axis direction as a y-axis, constructing a circle by taking the distance between the S' and the sink node as a radius and the sink node as a circle center, and taking an annular region formed by a semicircular region where the right side of the y-axis is located and a semicircular region where a current ring is located as a middleAn area where the internode is selectable. In addition, in order to ensure that the intermediate node cannot be too close to the real source node, the safe area except the source node in the semicircular area is the area which can be selected by the final intermediate node.
When the source node is outside the current confusion ring and the source node is far away from the current confusion ring, as shown in fig. 5, a ray where the source node S and the sink node are located is an x-axis, a ray which passes through the sink node and is perpendicular to the x-axis direction is a y-axis to establish coordinates, a circle is constructed by taking the distance between the source node S and the sink node as a radius and the sink node as a circle center, and an annular region formed between a semicircular region where the right side of the y-axis is located and a semicircular region where the current ring is located is a selectable region of the intermediate node. In addition, in order to ensure that the intermediate node cannot be too close to the real source node, the safe area except the source node in the semicircular area is the area which can be selected by the final intermediate node.
Step three: as shown in fig. 6, the confusion of packets on the ring.
In fig. 6, after the intermediate node is determined, the intermediate node selects a node closer to the confusion ring from the neighboring nodes each time as a next hop until the next hop node is a ring node on the confusion ring, for example, point a in fig. 6 is a first ring node. After the data packet reaches the first node a, the initial direction of motion (clockwise or counterclockwise) is randomly selected with the same probability. Each node is represented by a probabilityp= 1/6 sends a dummy packet request to a ring with 1 hop number greater than the ring, and a node receiving the dummy packet request on one hand serves as a dummy source node to send a dummy packet to a requesting node and on the other hand sends a dummy packet request to a ring node with 1 hop number greater than the node. As shown in fig. 6, after the node C is selected as a branch node, one side sends a false data packet request message to the node C to the node B, and the other side sends a real data packet to the same-hop ring node method. After receiving the request message of the node B, the node C sends a false data packet to the node B on the one hand, and sends a false data packet request message to the node D on the other hand, and the false data packet request message reaches the network edge node G in the same way. The nodes on the confusion ring receiving the false data packets discard the false data packets, and only pass real data packets along the confusion ring. When the sink node and the first ring node are locatedThe included angle formed by the ray, the sink node and the ray of the current ring node is more than or equal to the preset angleα（αRandomly selected between 0 ° and 360 °), the ring node stops selecting the next-hop ring node.
Step four: the passing of the confusion ring to the sink node.
And after the data packet is mixed on the ring, the link point sends the data packet to the sink node through the shortest path. When the data packet is confused to a certain degree on the confusion ring, the ring node selects a node which is closer to the sink node from the neighbor nodes as a next hop, the data packet is sent to the node, and the node which receives the data packet transmits the data packet to the direction which is close to the sink node in the same way until the data packet reaches the sink node.
Step five: as shown in fig. 7, the dynamic movement of the confusion ring.
After a period of time, the remaining energy of the nodes on the current confusion ring is small, and the normal function of the network may be influenced by the continuous operation. When the energy of the nodes on the confusion ring reaches a certain threshold value, dynamically generating a new confusion ring; similarly, when the energy of the node on the confusion ring reaches a certain threshold again, a new dynamic confusion ring is generated again. Dynamic movement of the confusion ring not only balances the energy consumption use condition of the nodes in the network, but also improves the utilization rate of energy in the network. In fig. 7, when the energy of node F reaches a certain threshold, node F broadcasts the message to the whole network, and the same-hop node B receiving the message is informed that it cannot continue to be a node on the confusion ring; the node receiving the message and having 1 hop count than itself is informed to become a node on the new confusion ring, and other nodes are informed of the hop count message of the new confusion ring, thereby forming the new confusion ring. Due to the dynamic movement of the confusion ring, the position privacy of the source node is protected, the energy use condition in the network is balanced, and the service life of the network is prolonged.
In summary, the following steps:
the invention discloses a source node position privacy protection method based on dynamic ring routing. Firstly, a sink node initializes a network in a flooding beacon mode, so that the node can generate respective neighbor lists; secondly, a region is determined by the source node and the sink node together, and a node is randomly selected from the region to serve as an intermediate node; and then the source node sends the data packet to the intermediate node through the shortest path method. And then the intermediate node sends the data packet to the current confusion ring, the true and false data packets are confused, and after the confusion reaches a certain degree, the ring node transmits the data packet to the sink node by a shortest path method. The invention can ensure that the intermediate node is far away from the real source node enough, and the path from the source node to the sink node of each data packet has randomness and the paths of the adjacent data packets are not repeated. In addition, the dynamic movement of the confusion ring realizes the purpose of protecting the position privacy of the source node and simultaneously improves the utilization rate of energy in the network, thereby prolonging the service life of the network.
The foregoing shows and describes the general principles and broad features of the present invention and advantages thereof. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are described in the specification and illustrated only to illustrate the principle of the present invention, but that various changes and modifications may be made therein without departing from the spirit and scope of the present invention, which fall within the scope of the invention as claimed. The scope of the invention is defined by the appended claims and equivalents thereof.
Claims (3)
1. A WSNs source node position privacy protection method based on dynamic loop routing is characterized by comprising the following steps:
the method comprises the following steps: network initialization
The network consists of a sink node and a large number of common sensor nodes, wherein the sink node is positioned at the central position of the network; after the network deployment is completed, the sink node starts to broadcast an initialization beacon to the network, wherein the initialization beacon comprises hop value, the position of a base station node and hop threshold information; when the common sensor node receives the initialization beacon, the common sensor node acquires hop value, base station node position and hop threshold information from the received initialization beacon, processes the beacon and broadcasts the processed beacon to own neighbor nodes, and finally, the networkAll the nodes in the network can generate a neighbor list according to the hop value of the neighbor node; forming a same ring by nodes with the same hop number from the sink node, and generating a ring list, wherein the nodes on the ring are ring nodes; distance network centerh 0 The ring nodes at the jump position form an initial confusion ring; the above-mentionedh 0 Randomly selecting the maximum hop value from 1/2 to 1/3 of the distance sink node;
step two: selection of intermediate nodes
When a source node needs to send event information, firstly, a selectable region of an intermediate node is determined according to the positions of the source node and a sink node, then a point is randomly determined in the region, the node closer to the point is the intermediate node, and then a data packet is sent to the intermediate node through a routing algorithm;
step three: confusion of data packets on a ring
When the intermediate node sends a data packet to the confusion ring, the intermediate node firstly sends the data packet to a ring node which is closer to the intermediate node on the current confusion ring; secondly, randomly deciding to select a neighbor node in a clockwise or anticlockwise direction as a next hop from neighbor nodes of the same ring by the ring node, and randomly selecting the next hop from the neighbor nodes of the direction once the direction is selected until an included angle formed by a ray of the sink node and the first ring node and a ray of the sink node and the current ring node is more than or equal to a preset angle; in order to induce an attacker to deviate from the direction of a real source node, the generation and the transmission of a false data packet are merged into a path;
in the third step, the specific method for mixing up the data packets on the ring is as follows:
after the intermediate node is determined, the intermediate node selects a node which is closer to the confusion ring from the neighbor nodes as a next hop each time until the next hop node is a ring node on the confusion ring; after the data packet reaches the first ring node, randomly selecting an initial movement direction with the same probability, wherein the movement direction is clockwise or anticlockwise, and data traffic in two directions exists on a confusion ring; each node is represented by a probabilityp= 1/6 false packet request to ring with 1 more ring hops, virtual receivedOn one hand, the node of the false data packet request is used as a false source node to send a false data packet to the request node, and on the other hand, the node of the false data packet request sends a false data packet request to the ring node with the hop number larger than 1 of the node of the false data packet request, and so on until the false source node reaches the edge of the network; the nodes on the confusion ring which receive the false data packets discard the false data packets, and only the real data packets are transmitted along the confusion ring; when the included angle formed by the ray of the sink node and the first ring node and the ray of the sink node and the current ring node is larger than or equal to a preset angle, the ring node stops selecting the next hop ring node, and the data packet is sent to the sink node along the shortest path;
step four: passing of confusion rings to sink nodes
After the data packet is mixed on the ring, the link point sends the data packet to the sink node through a shortest path method;
step five: dynamic movement of confusion rings
When the energy of the nodes on the confusion ring reaches a certain threshold value, the confusion ring moves dynamically, and the efficient utilization of the energy is realized.
2. The WSNs source node location privacy protection method based on dynamic loop routing as claimed in claim 1, wherein: in the second step, the selection of the intermediate node is specifically as follows:
determining a selectable region of an intermediate node according to the position information of a source node and a sink node, randomly determining a point in the selectable region, after the point is determined, selecting a neighbor node which is closer to the point from neighbor nodes each time by the source node as a next hop, selecting the next hop by the same method until the distance between the neighbor node and the point is less than or equal to the communication radius, and selecting the neighbor node as the intermediate node.
3. The WSNs source node location privacy protection method based on dynamic loop routing as claimed in claim 1, wherein: the method for shortest path in the fourth step comprises the following specific steps:
when the data packet is confused to a certain degree on the confusion ring, the ring node selects a node which is closer to the sink node from the neighbor nodes as a next hop, the data packet is sent to the node, and the node which receives the data packet transmits the data packet to the direction which is close to the sink node in the same way until the data packet reaches the sink node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810607462.8A CN108848461B (en) | 2018-06-13 | 2018-06-13 | WSNs source node position privacy protection method based on dynamic loop routing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810607462.8A CN108848461B (en) | 2018-06-13 | 2018-06-13 | WSNs source node position privacy protection method based on dynamic loop routing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108848461A CN108848461A (en) | 2018-11-20 |
| CN108848461B true CN108848461B (en) | 2020-09-22 |
Family
ID=64211088
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810607462.8A Active CN108848461B (en) | 2018-06-13 | 2018-06-13 | WSNs source node position privacy protection method based on dynamic loop routing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108848461B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109660945B (en) * | 2019-02-18 | 2020-07-07 | 河海大学常州校区 | Dynamic multi-route source node position privacy protection method based on multiple sink nodes in WSN |
| CN111343629B (en) * | 2020-02-28 | 2023-05-16 | 河海大学常州校区 | Underwater source node position privacy protection method based on virtual cube |
| CN111542059B (en) * | 2020-05-06 | 2023-05-16 | 河海大学常州校区 | WSNs source node position privacy protection method based on dynamic tree routing |
| CN112738863A (en) * | 2020-12-28 | 2021-04-30 | 东方红卫星移动通信有限公司 | Data routing method and system based on dynamic ring |
| CN113453143B (en) * | 2021-05-14 | 2022-07-26 | 浙江工业大学 | Source position privacy protection method based on dynamic phantom node strategy |
| CN114024892B (en) * | 2021-11-05 | 2023-05-02 | 国网四川省电力公司经济技术研究院 | Information sensitivity aware power sensitive information self-adaptive security routing method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103228008A (en) * | 2013-04-27 | 2013-07-31 | 武汉大学 | Method for protecting source position privacy based on dynamic confusion ring in wireless sensor network |
| CN105979508A (en) * | 2016-07-27 | 2016-09-28 | 河海大学常州校区 | Node privacy protection method based on directional random routing in wireless sensor network |
| CN107835510A (en) * | 2017-10-31 | 2018-03-23 | 河海大学常州校区 | A kind of wireless sensor network source node location method for secret protection based on phantom route |
-
2018
- 2018-06-13 CN CN201810607462.8A patent/CN108848461B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103228008A (en) * | 2013-04-27 | 2013-07-31 | 武汉大学 | Method for protecting source position privacy based on dynamic confusion ring in wireless sensor network |
| CN105979508A (en) * | 2016-07-27 | 2016-09-28 | 河海大学常州校区 | Node privacy protection method based on directional random routing in wireless sensor network |
| CN107835510A (en) * | 2017-10-31 | 2018-03-23 | 河海大学常州校区 | A kind of wireless sensor network source node location method for secret protection based on phantom route |
Non-Patent Citations (2)
| Title |
|---|
| 《An energy-efficient and sink-location privacy enhanced scheme for WSNs through ring based routing》;Jun Long;《J.ParrelDistrib.Comput.》;20150831;全文 * |
| 《传感网中能量均衡高效的源位置隐私保护协议》;牛晓光;《通信学报》;20160430;第4节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108848461A (en) | 2018-11-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108848461B (en) | WSNs source node position privacy protection method based on dynamic loop routing | |
| Shaikh et al. | Routing in multi-hop cellular device-to-device (D2D) networks: A survey | |
| Deng et al. | Routing security in wireless ad hoc networks | |
| Chen et al. | A survey and challenges in routing and data dissemination in vehicular ad hoc networks | |
| Mohandas et al. | Survey on routing protocols on mobile adhoc networks | |
| Zheng et al. | ERCD: An energy-efficient clone detection protocol in WSNs | |
| Bhuvaneswari et al. | Denial of service attack solution in OLSR based manet by varying number of fictitious nodes | |
| Han et al. | A dynamic ring-based routing scheme for source location privacy in wireless sensor networks | |
| CN107566984B (en) | Source position privacy protection method based on sector area in WSNs | |
| CN107920342B (en) | Source node position privacy protection method based on multiple sink and false hotspot regions in WSN (Wireless sensor network) | |
| CN108551672B (en) | Source node position privacy protection method based on two-stage selection strategy in WSNs | |
| Arfat et al. | A survey on secure routing protocols in wireless sensor networks | |
| CN111542059A (en) | WSNs source node position privacy protection method based on dynamic tree routing | |
| Singh et al. | Survey of secure routing protocols in MANET | |
| Shrestha et al. | An optimized multipath routing for secure communication of wireless sensor network | |
| Vinayakan et al. | Security for Multipath Routing Protocol using Trust based AOMDV In MANETs | |
| Ichaba | Examining Possible Supplementary Nature of Routing Protocols in Mobile Ad-hoc Networks (MANETs): A Discussion | |
| Manjunath et al. | A Review on Security and Challenges for Vehicular Ad Hoc Networks | |
| Wu et al. | On the security of distributed position services | |
| Shruthi et al. | Network layer attack: Analysis & solutions a survey | |
| Sookhak et al. | Secure geographic routing protocols: Issues and approaches | |
| Abuhaiba et al. | Securing zone routing protocol in Ad-hoc networks | |
| Abbas et al. | Secure AODV protocol for mobile networks using short digital signatures | |
| Arora et al. | Survey of Security Enhancements in MANET Routing Protocols for Networking | |
| Bhardwaj et al. | SIRFRM-Secure and Intelligent Routing Fairness Rate Model for Flying Adhoc Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |