CN108551672A - Source node location method for secret protection based on two stage selection strategy in WSNs - Google Patents
Source node location method for secret protection based on two stage selection strategy in WSNs Download PDFInfo
- Publication number
- CN108551672A CN108551672A CN201810262629.1A CN201810262629A CN108551672A CN 108551672 A CN108551672 A CN 108551672A CN 201810262629 A CN201810262629 A CN 201810262629A CN 108551672 A CN108551672 A CN 108551672A
- Authority
- CN
- China
- Prior art keywords
- node
- ring
- data packet
- source node
- nodes
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
-
- 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
-
- 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
Abstract
The invention discloses the source node location method for secret protection based on two stage selection strategy in a kind of WSNs.Method is divided into two stages：First stage randomly chooses an intermediate node in the bubble area that source node and sink nodes are formed, and source node posts messages to intermediate node；Second stage, intermediate node selection suitably obscure ring, sink nodes are posted messages to by critical path method (CPM) after the routing on ring.The present invention can ensure that intermediate node is sufficiently apart from source node, and routing of the data packet from source node to sink all has randomness, and multiple uses for obscuring ring every time so that while protecting the location privacy of source node, also improve the service life of network.
Description
Technical field
The invention belongs to network communication of wireless sensor to support technical field, and in particular to a kind of in WSNs to be based on two benches
The source node location method for secret protection of selection strategy.
Background technology
Wireless sensor network (WSNs) has been applied to many fields, such as：Infrastructure monitors and information is collected
Etc..Wherein, location privacy becomes focus of people's attention, and on the one hand the information that it is provided is brought more convenient, separately
On the one hand, the leakage of location privacy also brings prodigious risk.The research of location privacy, which does not require nothing more than, to be brought conveniently,
More to consider that location privacy is not utilized by criminal.So in the case of malicious attack, the message of good position is protected to be
Where the critical issue of location privacy service.
Privacy in wireless sensor network includes two major classes.One type is context privacy, it has handled source position
With the privacy concern of sink node locations.Source position privacy be about data packet where generate location information privacy.Though
So, we can handle the privacy concern of source position by encrypting, but can not still protect the location information in source.Although
Attacker can not crack the encryption information between node, but can be tracked with flow analysis by data packet to judge the position of prey
The activity set, and chased the game always implements prey the means such as to dabble.This illustrates the importance of protection source position privacy.
For the protection problem of source position privacy, there is the research much about this respect, but in traditional research
Most of the case where all being used without tradeoff safety and energy, this paper presents use multiple thoughts for obscuring ring to solve this
Problem.Scheme herein is divided into two stages, in the first stage, the one or more intermediate nodes of source node random selection, and will
Data packet is sent to randomly selected intermediate node.Second stage, intermediate node select one of them to obscure ring, and by data packet
It is sent to link point, link point is sent to sink nodes after obscuring message；After energy reaches certain threshold value on ring therefrom
The data packet that intermediate node is sent be sent to it is new obscure on ring, sink nodes are sent to after obscuring.
In order to design efficient source node location secret protection scheme, domestic and international researcher proposes a variety of routers
System, pertinent literature are as follows：
1,2013, Ju Ren et al. existed《An Energy-Efficient Cyclic Diversionary Routing
Strategy against Global Eavesdroppers in Wireless Sensor Networks》In, it is proposed that one
Set forth herein the schemes of CDR for kind to fight global attack, to protect the location privacy of source node.First, redundancy road is being generated
By while reduce influence to network life, generate redundancy in the place of distance sink nodes farther out so that hot spot region energy
Consumption reaches minimum；Secondly, in order to enhance location privacy, the probability that the routing of different zones cyclic redundancy generates is calculated herein, is made
Energy expenditure reaches balance.
2,2016, Kumar P et al. existed《Source location privacy using multiple-phantom
nodes in WSN》In, it is proposed that a kind of routing plan of the wireless sensor network based on finite energy.Sink nodes first
Node is set to obtain respective hop count information by network flooding, and node is by the information-replies sink nodes such as hop count.Then sink
Every three suitable nodes are set to one group by node by calculating, and notify each node.To which source node is when transmitting data, with
Machine select one in other two group member as phantom source node.But the program is repeatedly flooded in initial phase can consume volume
Outer energy.
3,2017, Bai L et al. existed《Privacy protection algorithm based on expected
phantom source node in wireless sensor network》In, it is proposed that one kind is based on expected phantom source section
The source position secret protection scheme of point.The coordinate of source node and sink nodes is it is known that the algorithm establishes an ellipse, and ellipse
A position is randomly choosed on circle as expected phantom source node, and the direction of phantom source node is provided.By selecting dispersion
It is expected that phantom source node, the transmission path of adjacent data packet is also dispersion, so as to increase data packet in transmission process
Possibility far from source node or sink nodes.
Invention content
In view of the above-mentioned problems, the present invention proposes the source node location secret protection based on two stage selection strategy in WSNs
Method under the premise of node does not know full mesh topology, delivers a packet in the wireless sensor network of random placement
Randomly selected intermediate node in determining bubble area at random, and ensure that intermediate node is sufficiently apart from source node；It is also logical simultaneously
Crossing the structure of multiple rings realizes the energy consumption of reduction network as far as possible and keeps network energy consumption balanced, to extend network life.
It realizes above-mentioned technical purpose, reaches above-mentioned technique effect, the invention is realized by the following technical scheme：
Source node location method for secret protection based on two stage selection strategy in a kind of WSNs, includes the following steps：
Step 1：Netinit.
Network is made of a sink node and a large amount of general sensor nodes, and wherein sink nodes are located at network center position
It sets, general sensor nodes random placement is in network monitor region, and general sensor nodes can be in the specific period of routing
As source node, intermediate node；
After the completion of network is disposed, the grid of same size is splitted the network into, the node in the same grid constitutes one
A cluster；Sink nodes start the broadcast initialization beacon into network, initialize the position comprising jumping figure value, base-station node in beacon
With hop count threshold information；After general sensor nodes receive initialization beacon, it can be obtained from the initialization beacon received
Jumping figure value, base-station node position and hop count threshold information are taken, and the neighbor node of oneself will be broadcast to after the beacon process, because
This, all nodes can generate neighbor list according to the jumping figure value of neighbor node in network；Distance sink node same number of hops
Node constitutes the same ring, and the node on ring is link point, thus generates circular row table.
Step 2：The selection of intermediate node.
When source node needs transmission time information, first according to the position of source node and the location determination bubble of sink nodes
It sets, determines a point at random again in bubble, the leader cluster node of the grid where the point is intermediate node, is then calculated by routeing
Method sends data packet to intermediate node.
Step 3：The selection of ring and obscure.
When sending letter data packet to link point from intermediate node, the preferential ring for selecting residue energy of node more；Then it counts
Random hop count is route on ring according to packet, it is a degree of to data packet progress to obscure, increase the complexity in path.
Step 4：Transmission of the link point to sink nodes.
After data packet is obscured on ring, data packet is sent to sink nodes by link point by critical path method (CPM).
In above-mentioned steps one, the specific method is as follows for netinit：
After general sensor nodes receive initialization beacon, the jumping figure value in beacon can be added to 1, and record and preserve
Lower jumping figure value, the positions sink and hop count threshold information；Then the beacon broadcast of aforementioned record and preservation is saved to the neighbours of oneself
Point is served only for generating or updating neighbor list, no longer broadcasts beacon if hereafter receiving beacon again；Therefore, each node
It can know that the position of sink nodes, and neighbor list generated according to the jumping figure value of neighbor node to sink nodes；It is each in network
A node can learn the position of itself according to location algorithm；Finally, each node divides ring according to the hop count of distance sink nodes, away from
Node from sink same number of hops constitutes the same ring, and the node on ring is link point, thus generates circular row table.
In above-mentioned steps two, the specific algorithm of the selection of intermediate node is as follows：
It is random a little for bubble area on the circle in the center of circle using line segment between source node and sink nodes as diameter, midpoint
The center of circle, in bubble area it is random a little where the cluster head of grid be intermediate node, d is indicating between source node S and sink nodes
Distance, O is indicating the midpoint of S and sink nodes, (xc,yc) it is any point on circle that S and sink nodes are constituted, it is full
Foot：R is the radius size of bubble area；Pass through dcAnd θcThe randomness of size determines in bubble area
One point C, wherein dc∈(0,r),θc∈ (0,2 π), then C point coordinates is (xc+dccosθc,yc+dccsinθc), grid where C points
Cluster head i be defined as intermediate node.
In above-mentioned steps three, the selection of ring and obscure specially：
When data packet is sent from intermediate node to sink nodes, in order to improve the service life of network, intermediate node is by data
Packet is sent to the more ring of dump energy；Secondly, data packet is obscured on ring, packet reaches first link point
Afterwards, with equal probabilities random selection initial motion direction (suitable/counterclockwise), therefore, obscure the data there are both direction on ring
Flow；There are two data buffer storage queues to store different directions flow on each node.In packet radom insertion to queue,
Carry out the sequence of the into/out node of random permutation packet with this.
In above-mentioned steps four, the transmission of link point to sink nodes is specially：
After data packet is obscured to a certain extent on obscuring ring, link point chosen distance sink nodes from neighbor node
Closer node delivers a packet to the node as next-hop, receives the node of the data packet, also with same side
Formula hands on data packet to close to the direction of sink nodes, until data packet reaches sink nodes.
Beneficial effects of the present invention：
The present invention ensures intermediate node apart from source node by randomly choosing intermediate node in the bubble area of construction
In the range of farther out and there is randomness；Secondly, by obscuring the structure of ring, the dump energy of nodes is made full use of,
The life of network is also improved while enhancing the location privacy of source node.
Description of the drawings
Fig. 1 is that inventive network initializes schematic diagram；
Fig. 2 is the selection schematic diagram of intermediate node of the present invention；
Fig. 3 is the selection that the present invention obscures ring；
Fig. 4 is that data obscure schematic diagram on ring.
Specific implementation mode
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to embodiments, to the present invention
It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to
Limit the present invention.
The application principle of the present invention is explained in detail below in conjunction with the accompanying drawings.
In order to solve the problems, such as that in the wireless sensor network of random placement, source node location is easy exposure, node not
Under the premise of knowing full mesh topology, randomly selected intermediate node in bubble area determining at random is delivered a packet to, and
Ensure that intermediate node is sufficiently apart from source node；It is also realized simultaneously by the structure of multiple rings and reduces the energy consumption of network simultaneously as far as possible
Keep network energy consumption balanced, to extend network life, the present invention proposes a kind of wireless sensor based on two stage selection strategy
Network source node location privacy protection method, includes the following steps：
Step 1：As shown in Figure 1, the initialization and sub-clustering of network.
Network is made of a sink node (base-station node) and a large amount of general sensor nodes, and wherein sink nodes are located at
Network center position, general sensor nodes random placement is in network monitor region, and general sensor nodes may be on road
By specific period become source node, intermediate node or phantom source node.After the completion of network is disposed, split the network into same
The grid of size, the node in the same grid constitute a cluster；Sink nodes start the broadcast initialization beacon into network, just
Include jumping figure value, the position of base-station node and hop count threshold information in beginningization beacon；When general sensor nodes receive initially
After changing beacon, jumping figure value, base-station node position and hop count threshold information can be obtained from the initialization beacon received, and should
The neighbor node of oneself is broadcast to after beacon process；If hereafter receiving neighbor node again sends beacon, only it is used in
Neighbor list is generated or updated, no longer broadcasts beacon, network congestion and energy disappear caused by alleviate repeated broadcast beacon
Consumption.Therefore, all nodes can generate neighbor list according to the jumping figure value of neighbor node in network；The identical jump of distance sink nodes
Several nodes constitutes the same ring, thus generates circular row table.In the present invention, all nodes can be according to GPS positioning skill
Art knows the position of itself.
Step 2：As shown in Fig. 2, the selection of intermediate node.
It is random a little for bubble area on the circle in the center of circle using line segment between source node S and sink nodes as diameter, midpoint
The center of circle, in bubble area it is random a little where the cluster head of grid be intermediate node, d is indicating source node S and sink nodes
Between distance, O is indicating the midpoint of S and sink nodes, (xc,yc) be S and sink nodes constitute circle on any point,
Meet：R is the radius size of bubble area；Pass through dcAnd θcThe randomness of size, in bubble area really
A fixed point C, wherein dc∈(0,r),θc∈ (0,2 π), then C point coordinates is (xc+dccosθc,yc+dccsinθc), net where C points
The cluster head i of lattice is defined as intermediate node.Since the position of bubble area has randomness, and dcAnd θcAnd by randomly generating
, so even if can guarantee the similarities and differences of intermediate node if in the same bubble area, to ensure source node to intermediate node
Path it is different.
Step 3：As shown in Figure 3, Figure 4, the selection of ring and obscure.
In Fig. 3, when sending letter data packet to link point from intermediate node, in order to improve the service life of network, preferential selection section
Put the more ring of dump energy, the link point transmission data packet on the ring of right backward selection.In Fig. 4, when packet reaches first
After a link point, with equal probabilities random selection initial motion direction (suitable/counterclockwise), solid arrow indicates clockwise, dotted line
Arrow indicates counterclockwise, therefore, obscures node on the ring N1、N2、N3There are both directions when data packet transfer between three nodes
Data traffic；There are two data buffer storage queues to store different directions flow on each node.Packet radom insertion arrives
In queue, the sequence of the into/out node of random permutation packet is carried out with this.Data packet route random hop count on ring,
It is a degree of to data packet progress to obscure, increase the complexity in path.
Step 4：Transmission of the link point to sink nodes.
After data packet is obscured on ring, data packet is sent to sink by link point by critical path method (CPM).Work as data
After packet is obscured to a certain extent on obscuring ring, the closer node conduct of chosen distance sink nodes from neighbor node of link point
Next-hop, and deliver a packet to the node, receives the node of the data packet, also in the same way by data packet to by
The direction of nearly sink nodes hands on, until data packet reaches sink nodes.
In summary：
The invention discloses the source node location method for secret protection based on two stage selection strategy in a kind of WSNs, first
First, sink nodes carry out netinit by way of flooding beacon so that node can generate respective neighbor list；Its
It is secondary, a bubble area is determined by source node and sink nodes jointly, from one node of random selection is used as in bubble area
Intermediate node；Then source node sends data packet by shortest path normal direction intermediate node.Finally, intermediate node passes through shortest path
Data packet is passed to sink nodes by shot.The present invention can ensure that phantom source node is sufficiently apart from true source node, and every
Path of the secondary data packet from source node to the path of sink nodes all with randomness and adjacent data packet will not repeat.Except this,
By the selection for obscuring ring so that energy relative equilibrium in network, ensure source node can enough safely transmission data it is same
When, also improve the service life of network.
The above shows and describes the basic principles and main features of the present invention and the advantages of the present invention.The technology of the industry
Personnel are it should be appreciated that the present invention is not limited to the above embodiments, and the above embodiments and description only describe this
The principle of invention, without departing from the spirit and scope of the present invention, various changes and improvements may be made to the invention, these changes
Change and improvement all fall within the protetion scope of the claimed invention.The claimed scope of the invention by appended claims and its
Equivalent thereof.
Claims (4)
1. the source node location method for secret protection based on two stage selection strategy in a kind of WSNs, which is characterized in that including with
Lower step：
Step 1：Netinit
Network is made of a sink node and a large amount of general sensor nodes, and wherein sink nodes are located at network center position,
General sensor nodes random placement is in network monitor region, and general sensor nodes can become in the specific period of routing
Source node, intermediate node；
After the completion of network is disposed, sink nodes start the broadcast initialization beacon into network, and it includes hop count to initialize in beacon
Value, the position of base-station node and hop count threshold information；
After general sensor nodes receive initialization beacon, jumping figure value, base can be obtained from the initialization beacon received
Tiny node position and hop count threshold information, and the neighbor node of oneself will be broadcast to after the beacon process, all nodes in network
Neighbor list can be generated according to the jumping figure value of neighbor node；The node of distance sink node same number of hops constitutes the same ring,
Circular row table is generated, the node on ring is link point；
Step 2：The selection of intermediate node
When source node needs transmission time information, first according to the position of source node and the location determination bubble of sink nodes,
Determine a point at random again in bubble, the leader cluster node of the grid where the point is intermediate node, then passes through routing algorithm
Data packet is sent to intermediate node；
Step 3：The selection of ring and obscure
When sending letter data packet to link point from intermediate node, the preferential ring for selecting residue energy of node more；Then data packet
Random hop count is route on ring, it is a degree of to data packet progress to obscure, increase the complexity in path；
Step 4：Transmission of the link point to sink nodes
After data packet is obscured on ring, data packet is sent to sink nodes by link point by critical path method (CPM).
2. the source node location method for secret protection based on two stage selection strategy in WSNs according to claim 1,
It is characterized in that：In the step 2, the selection specific algorithm of intermediate node is as follows：
It is random a little for the circle of bubble area on the circle in the center of circle using line segment between source node and sink nodes as diameter, midpoint
The heart, in bubble area it is random a little where the cluster head of grid be intermediate node, d is indicating between source node S and sink nodes
Distance, O is indicating the midpoint of S and sink nodes, (xc,yc) be S and sink nodes constitute circle on any point, meet：R is the radius size of bubble area；Pass through dcAnd θcThe randomness of size determines one in bubble area
Point C, wherein dc∈(0,r),θc∈ (0,2 π), then C point coordinates is (xc+dccosθc,yc+dccsinθc), grid where C points
Cluster head i is defined as intermediate node.
3. the source node location method for secret protection based on two stage selection strategy in WSNs according to claim 1,
It is characterized in that：In the step 3, data packet obscures that the specific method is as follows on ring：
Data packet is obscured on ring, after packet reaches first link point, initial fortune is randomly choosed with equal probabilities
Dynamic direction, the direction of motion are clockwise or counterclockwise, to obscure the data traffic there are both direction on ring；Have two on each node
A data buffer queue in packet radom insertion to queue, carrys out random permutation data to store different directions flow with this
It is grouped the sequence of into/out node.
4. the source node location method for secret protection based on two stage selection strategy in WSNs according to claim 1,
It is characterized in that：The transmission of step 4 middle ring node to the sink nodes is specially：
After data packet is obscured to a certain extent on obscuring ring, link point chosen distance sink nodes from neighbor node are closer
Node as next-hop, and deliver a packet to the node, receive the node of the data packet, also in the same way will
Data packet is handed on to close to the direction of sink nodes, until data packet reaches sink nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810262629.1A CN108551672B (en) | 2018-03-28 | 2018-03-28 | Source node position privacy protection method based on two-stage selection strategy in WSNs |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810262629.1A CN108551672B (en) | 2018-03-28 | 2018-03-28 | Source node position privacy protection method based on two-stage selection strategy in WSNs |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108551672A true CN108551672A (en) | 2018-09-18 |
| CN108551672B CN108551672B (en) | 2021-05-28 |
Family
ID=63517048
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810262629.1A Active CN108551672B (en) | 2018-03-28 | 2018-03-28 | Source node position privacy protection method based on two-stage selection strategy in WSNs |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108551672B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109660945A (en) * | 2019-02-18 | 2019-04-19 | 河海大学常州校区 | Dynamic multipath based on more sink in WSN is by source node location method for secret protection |
| CN109819437A (en) * | 2018-12-29 | 2019-05-28 | 杭州电子科技大学 | Source node location method for secret protection in WSN based on Sink and grid |
| CN113259932A (en) * | 2021-05-19 | 2021-08-13 | 贵州大学 | Source node position privacy protection strategy in WSNs |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104581870A (en) * | 2014-12-30 | 2015-04-29 | 南京林业大学 | Wireless sensor network based on energy acquisition and low-delay routing method thereof |
| US9208322B1 (en) * | 2013-09-16 | 2015-12-08 | Trend Micro Inc. | Privacy leak detection in .NET framework |
| CN105357731A (en) * | 2015-10-14 | 2016-02-24 | 国网辽宁省电力有限公司营口供电公司 | Energy-efficient wireless sensor network (WSN) routing protocol design method for use in electromagnetic interference environment |
| US20170339011A1 (en) * | 2016-05-18 | 2017-11-23 | Veniam, Inc. | Systems and methods for managing the storage and dropping of data in a network of moving things |
| CN107580355A (en) * | 2017-08-22 | 2018-01-12 | 西安科技大学 | The location-based uniformly sub-clustering hierarchical routing algorithm of 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-03-28 CN CN201810262629.1A patent/CN108551672B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9208322B1 (en) * | 2013-09-16 | 2015-12-08 | Trend Micro Inc. | Privacy leak detection in .NET framework |
| CN104581870A (en) * | 2014-12-30 | 2015-04-29 | 南京林业大学 | Wireless sensor network based on energy acquisition and low-delay routing method thereof |
| CN105357731A (en) * | 2015-10-14 | 2016-02-24 | 国网辽宁省电力有限公司营口供电公司 | Energy-efficient wireless sensor network (WSN) routing protocol design method for use in electromagnetic interference environment |
| US20170339011A1 (en) * | 2016-05-18 | 2017-11-23 | Veniam, Inc. | Systems and methods for managing the storage and dropping of data in a network of moving things |
| CN107580355A (en) * | 2017-08-22 | 2018-01-12 | 西安科技大学 | The location-based uniformly sub-clustering hierarchical routing algorithm of 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 (1)
| Title |
|---|
| 牛晓光: "《传感网中能量均衡高效的源位置隐私保护协议》", 《通信学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109819437A (en) * | 2018-12-29 | 2019-05-28 | 杭州电子科技大学 | Source node location method for secret protection in WSN based on Sink and grid |
| CN109819437B (en) * | 2018-12-29 | 2022-01-11 | 杭州电子科技大学 | Source node position privacy protection method based on Sink and grid in WSN |
| CN109660945A (en) * | 2019-02-18 | 2019-04-19 | 河海大学常州校区 | Dynamic multipath based on more sink in WSN is by source node location method for secret protection |
| CN113259932A (en) * | 2021-05-19 | 2021-08-13 | 贵州大学 | Source node position privacy protection strategy in WSNs |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108551672B (en) | 2021-05-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Han et al. | A dynamic multipath scheme for protecting source-location privacy using multiple sinks in WSNs intended for IIoT | |
| Han et al. | KCLP: A k-means cluster-based location privacy protection scheme in WSNs for IoT | |
| CN108848461B (en) | WSNs source node position privacy protection method based on dynamic loop routing | |
| CN107835510B (en) | Phantom routing-based wireless sensor network source node position privacy protection method | |
| CN103747440B (en) | A kind of enhancement source position method for secret protection based on phantom single-path routing | |
| He et al. | A sector-based random routing scheme for protecting the source location privacy in WSNs for the Internet of Things | |
| Ngai et al. | On providing location privacy for mobile sinks in wireless sensor networks | |
| Yao et al. | Protecting source–location privacy based on multirings in wireless sensor networks | |
| CN105979508A (en) | Node privacy protection method based on directional random routing in wireless sensor network | |
| CN108551672A (en) | Source node location method for secret protection based on two stage selection strategy in WSNs | |
| CN104822143B (en) | A kind of source node location method for secret protection of anti-current amount analytical attack | |
| Ding et al. | Intelligent data transportation in smart cities: A spectrum-aware approach | |
| Misra et al. | Bird flight-inspired routing protocol for mobile ad hoc networks | |
| Han et al. | A dynamic ring-based routing scheme for source location privacy in wireless sensor networks | |
| He et al. | A pseudopacket scheduling algorithm for protecting source location privacy in the Internet of Things | |
| Sun et al. | Lightweight anonymous geometric routing for internet of things | |
| CN107566984A (en) | Source position method for secret protection based on a kind of sector region in WSNs | |
| Suarez-Tangil et al. | An experimental comparison of source location privacy methods for power optimization in WSNs | |
| Zhou et al. | Multi-branch source location privacy protection scheme based on random walk in WSNs | |
| Al-Ahmadi | Counterfeit Clones: A Novel Technique for Source and Sink Location Privacy in Wireless Sensor Networks | |
| CN112689282A (en) | Anonymous communication scheme for protecting location privacy in wireless sensor network | |
| Azfar et al. | Impact analysis and a detection method for misbehaving nodes in Mobile ad-hoc networks | |
| Niu et al. | An energy-efficient source-anonymity protocol in surveillance systems | |
| Khan et al. | Application-based Classification and Comparison of Secure Routing Protocols in Wireless sensor Networks: A Survey: A Survey | |
| Saini et al. | Analysis and detection of Byzantine attack in wireless sensor network |
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 |