CN108551672B - Source node position privacy protection method based on two-stage selection strategy in WSNs - Google Patents
Source node position privacy protection method based on two-stage selection strategy in WSNs Download PDFInfo
- Publication number
- CN108551672B CN108551672B CN201810262629.1A CN201810262629A CN108551672B CN 108551672 B CN108551672 B CN 108551672B CN 201810262629 A CN201810262629 A CN 201810262629A CN 108551672 B CN108551672 B CN 108551672B
- Authority
- CN
- China
- Prior art keywords
- node
- ring
- sink
- nodes
- data packet
- 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
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a source node position privacy protection method based on a two-stage selection strategy in WSNs. The method is divided into two stages: in the first stage, an intermediate node is randomly selected from a bubble area formed by a source node and a sink node, and the source node transmits a message to the intermediate node; and in the second stage, the intermediate node selects a proper confusion ring, and transmits the message to the sink node through a shortest path method after the information is routed on the ring. 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 is random each time, and the use of a plurality of confusion rings ensures that the position privacy of the source node is protected and the service life of the network is prolonged.
Description
Technical Field
The invention belongs to the technical field of wireless sensor network communication support, and particularly relates to a source node position privacy protection method based on a two-stage selection strategy in WSNs.
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.
Privacy in wireless sensor networks includes two broad categories. One of them is context privacy, which deals with the privacy issues of source location and sink node location. Source location privacy is the privacy of the location information about where the data packet is generated. 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 an attacker cannot break encrypted information between nodes, the attacker can determine the position of a prey through data packet tracking and flow analysis, track the movement of the prey all the time, and perform hunting and other measures on the prey. This illustrates the importance of protecting the privacy of the source location.
There have been many studies on this aspect for the protection of source location privacy, but most of the conventional studies do not trade off security against energy usage, and this document proposes the idea of using multiple confusion rings to solve this problem. The scheme of the method is divided into two stages, wherein in the first stage, a source node randomly selects one or more intermediate nodes and sends a data packet to the randomly selected intermediate nodes. In the second stage, the intermediate node selects one confusion ring and sends the data packet to the ring node, and the link node sends the message to the sink node after the message is confused; and when the energy on the ring reaches a certain threshold value, the data packet transmitted from the intermediate node is transmitted to a new confusion ring, and is transmitted to the sink node after being confused.
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 2013, Ju Ren et al, in An Energy-Efficient Cyclic division training arrangement against Global ease droppers in Wireless Sensor Networks, proposed a scheme of CDR herein to combat Global attacks, thereby protecting the position privacy of source nodes. Firstly, the influence on the service life of the network is reduced while generating redundant routes, and redundancy is generated at a place far away from a sink node, so that the energy consumption of a hotspot area is minimized; secondly, in order to enhance the position privacy, the probability of the generation of the cyclic redundancy route of different areas is calculated, and the energy consumption is balanced.
2. In 2016, Kumar P et al, in Source location privacy using multiple-phantom in WSN, proposed a routing scheme based on a wireless sensor network with limited energy. Firstly, the sink node makes the nodes obtain respective hop count information through network flooding, and the nodes reply the hop count information and the like to the sink node. The sink node then computationally groups every three suitable nodes and notifies each node. So that the source node randomly selects one of the other two members as a phantom source node when transferring data. But this scheme consumes additional energy with multiple floods during the initialization phase.
3. In 2017, Bai L et al, in "Privacy protection algorithm based on expected phantom source node in wireless sensor network", proposed a source location Privacy protection scheme based on expected phantom source node. The coordinates of the source node and the sink node are known, the algorithm establishes an ellipse, and randomly selects a position on the ellipse as an expected phantom source node to provide the direction of the phantom source node. By selecting a scattered prospective phantom source node, the transmission paths of adjacent data packets are also scattered, thereby increasing the probability that a data packet will be far away from the source node or sink node during transmission.
Disclosure of Invention
Aiming at the problems, the invention provides a source node position privacy protection method based on a two-stage selection strategy in WSNs, which is characterized in that in a randomly deployed wireless sensor network, on the premise that nodes do not know the topology of the whole network, a data packet is sent to a randomly selected intermediate node in a randomly determined bubble area, and the intermediate node is ensured to be far away from the source node; meanwhile, the energy consumption of the network is reduced as much as possible and is balanced through the construction of a plurality of rings, so that the service life of the network is prolonged.
The technical purpose is achieved, the technical effect is achieved, and the invention is realized through the following technical scheme:
a source node position privacy protection method based on a two-stage selection strategy in WSNs comprises the following steps:
the method comprises the following steps: and (5) initializing the network.
The network consists of a sink node and a large number of common sensor nodes, wherein the sink node is positioned in the 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 and an intermediate node in a specific routing period;
after the network deployment is finished, dividing the network into grids with the same size, and forming a cluster by nodes in the same grid; the sink node starts to broadcast an initialization beacon to the network, wherein the initialization beacon comprises hop value, the position of the base station node and hop threshold information; 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 own neighbor nodes, so that all nodes in the network can generate a neighbor list according to the hop value of the neighbor nodes; nodes with the same hop number from the sink node form the same ring, and nodes on the ring are ring nodes, so that a ring list is generated.
Step two: and (4) selecting an intermediate node.
When the source node needs to send time information, the position of the bubble is determined according to the positions of the source node and the sink node, a point is randomly determined in the bubble, a cluster head node of a grid where the point is located is an intermediate node, and then a data packet is sent to the intermediate node through a routing algorithm.
Step three: selection and confusion of rings.
When an intermediate node sends a message data packet to a ring node, a ring with more node residual energy is preferentially selected; then the data packet is routed on the ring by random hop number, the data packet is mixed up to a certain extent, and the complexity of the path is increased.
Step four: and (4) transferring the ring node 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 a shortest path method.
In the first step, the specific method for network initialization is as follows:
after the common sensor node receives the initialization beacon, the hop count value in the beacon is added with 1, and the information of a next hop count value, a sink position and a hop count threshold value is recorded and stored; then the recorded and stored beacons are broadcasted to own neighbor nodes, and if the beacons are received again, the beacons are only used for generating or updating a neighbor list and are not broadcasted any more; therefore, each node can know the position of the sink node and generate a neighbor list according to the hop value from the neighbor node to the sink node; each node in the network can know the position of the node according to a positioning algorithm; and finally, dividing the ring by each node according to the hop count of the distance sink node, wherein the nodes with the same hop count from the sink node form the same ring, and the nodes on the ring are ring nodes, so that a ring list is generated.
In the second step, the specific algorithm for selecting the intermediate node is as follows:
taking a random point on a circle with a line segment between a source node and a sink node as a diameter and a midpoint as a circle center as the circle center of a bubble region, taking a cluster head of a grid where the random point in the bubble region is located as a middle node, d is used for representing the distance between the source node S and the sink node, and O is used for representing the midpoint between the S and the sink node, (x)c,yc) Any point on a circle formed by the S and sink nodes meets the following requirements:
r is the radius of the bubble area; by dcAnd thetacRandomness of size, determining a point C in the bubble region, where dc∈(0,r),θcE is (0,2 pi), the C point coordinate is (x)c+dccosθc,yc+dccsinθc) And defining a cluster head i of the grid where the point C is positioned as an intermediate node.
In the third step, the selection and confusion of the rings are specifically as follows:
when a data packet is sent from the intermediate node to the sink node, in order to prolong the service life of the network, the intermediate node sends the data packet to a ring with more residual energy; secondly, the data packets are mixed on the ring, and after the data packets reach the first ring node, the initial movement direction (clockwise/counterclockwise) is randomly selected according to the same probability, so that data flow in two directions exists on the mixing ring; each node has two data buffer queues to store traffic in different directions. Data packets are randomly inserted into the queue, thereby randomly scrambling the order in which the data packets enter/leave the node.
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 bubble area, thereby ensuring that the intermediate node is in a range far away from the source node and has randomness; and secondly, by constructing the confusion ring, the residual energy of the nodes in the network is fully utilized, and the position privacy of the source node is enhanced while the life of the network is improved.
Drawings
FIG. 1 is a schematic diagram of the network initialization of the present invention;
FIG. 2 is a diagram illustrating an alternative embodiment of an intermediate node according to the present invention;
FIG. 3 is a selection of confusion rings in accordance with the present invention;
FIG. 4 is a schematic illustration of obfuscation of data on a 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 source node position 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 bubble area, and the intermediate node is ensured to be far away from the source node; meanwhile, the energy consumption of the network is reduced as much as possible and the energy consumption of the network is balanced through the construction of a plurality of rings, so that the service life of the network is prolonged, the invention provides a wireless sensor network source node position privacy protection method based on a two-stage selection strategy, which comprises the following steps:
the method comprises the following steps: initialization and clustering of the network is shown in fig. 1.
The network consists of a sink node (base station node) and a large number of common sensor nodes, wherein the sink node is located in the central position of the network, the common sensor nodes are randomly deployed in a network monitoring area, and the common sensor nodes can become source nodes, intermediate nodes or phantom source nodes in a specific routing period. After the network deployment is finished, dividing the network into grids with the same size, and forming a cluster by nodes in the same grid; the sink node starts to broadcast an initialization beacon to the network, wherein the initialization beacon comprises hop value, the position of the base station node and hop threshold information; when the common sensor node receives the initialization beacon, the hop value, the position of the base station node and hop threshold information are obtained from the received initialization beacon, and the beacon is broadcasted to own neighbor nodes after being processed; if the beacon sent by the neighbor node is received again, the beacon is only used for generating or updating the neighbor list, and the beacon is not broadcasted any more, so that the network congestion and the energy consumption caused by repeated beacon broadcasting are reduced. Therefore, all nodes in the network can generate a neighbor list according to the hop value of the neighbor node; nodes with the same hop count from the sink node form the same ring, and therefore a ring list is generated. In the present invention, all nodes can know their own location according to GPS positioning technology.
Step two: as shown in fig. 2, selection of an intermediate node.
Taking a random point on a circle with a line segment between a source node S and a sink node as a diameter and a midpoint as a circle center as the circle center of a bubble region, taking a cluster head of a grid where the random point in the bubble region is located as a middle node, d is used for representing the distance between the source node S and the sink node, and O is used for representing the midpoint between the S and the sink node, (x)c,yc) Any point on a circle formed by the S and sink nodes meets the following requirements:
r is the bubble regionThe radius size of (a); by dcAnd thetacRandomness of size, determining a point C in the bubble region, where dc∈(0,r),θcE is (0,2 pi), the C point coordinate is (x)c+dccosθc,yc+dccsinθc) And defining a cluster head i of the grid where the point C is positioned as an intermediate node. Due to the randomness of the position of the bubble region, and dcAnd thetacThe method is also generated randomly, so that the difference and the sameness of the intermediate nodes can be ensured even in the same bubble area, and the paths from the source node to the intermediate nodes are different.
Step three: as shown in fig. 3 and 4, selection and confusion of the rings.
In fig. 3, when the intermediate node transmits the packet to the ring node, in order to improve the service life of the network, the ring node with a large amount of energy remaining in the node is preferably selected, and then the packet is transmitted to the ring node on the selected ring. In fig. 4, when the data packet reaches the first ring node, the initial moving direction (clockwise/counterclockwise) is randomly selected with the same probability, the solid arrow represents clockwise, and the dotted arrow represents counterclockwise, so that the node N on the confusion ring1、N2、N3Data flow in two directions exists during data packet transmission among the three nodes; each node has two data buffer queues to store traffic in different directions. Data packets are randomly inserted into the queue, thereby randomly scrambling the order in which the data packets enter/leave the node. The data packets are routed over the ring by random hops, which confuse the data packets to a certain extent and increase the complexity of the path.
Step four: and (4) transferring the ring node to the sink node.
And after the data packet is mixed on the ring, the link point sends the data packet to the sink through a shortest path method. 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.
In summary, the following steps:
the invention discloses a source node position privacy protection method based on a two-stage selection strategy in WSNs, which comprises the following steps that firstly, a sink node performs network initialization in a flooding beacon mode, so that the nodes can generate respective neighbor lists; secondly, determining a bubble area by the source node and the sink node together, and randomly selecting a node from the bubble area as an intermediate node; and then the source node sends the data packet to the intermediate node through the shortest path method. And finally, the intermediate node transmits the data packet to the sink node by a shortest path method. The invention can ensure that the phantom source 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, through the selection of the confusion ring, the energy in the network is relatively balanced, and the service life of the network is prolonged while the source node is ensured to transmit data safely enough.
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 source node position privacy protection method based on a two-stage selection strategy in WSNs 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 in the 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 and an intermediate 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 hop value, the position of a base station node and hop threshold information;
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 own neighbor nodes, and all nodes in the network can generate a neighbor list according to the hop value of the neighbor nodes; 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;
step two: selection of intermediate nodes
When a source node needs to send a data packet of event information, firstly, determining the position of a bubble according to the positions of the source node and a sink node, randomly determining a point in the bubble, wherein a cluster head node of a grid where the point is located is an intermediate node, and then sending the data packet to the intermediate node through a routing algorithm;
step three: selection and obfuscation of rings
When the intermediate node sends a data packet to the ring node, the ring with more node residual energy is preferentially selected; then the data packet routes the random hop count on the ring;
step four: ring node to sink node transfer
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;
in the second step, the specific algorithm for selecting the intermediate node is as follows:
taking a random point on a circle with a line segment between a source node and a sink node as a diameter and a midpoint as a circle center as the circle center of a bubble region, taking a cluster head of a grid where the random point in the bubble region is located as a middle node, d is used for representing the distance between the source node S and the sink node, and O is used for representing the midpoint between the S and the sink node, (x)c,yc) Any point on a circle formed by the S and sink nodes meets the following requirements:
r is the radius of the bubble area; by dcAnd thetacRandomness of size, determining a point C in the bubble region, where dc∈(0,r),θcE is (0,2 pi), the C point coordinate is (x)c+dccosθc,yc+dccsinθc) And defining a cluster head i of the grid where the point C is positioned as an intermediate node.
2. The method for protecting privacy of source node locations in WSNs based on a two-stage selection strategy according to claim 1, wherein: in the third step, the specific method for mixing up the data packets on the ring is as follows:
the data packets are mixed on the ring, after the data packets reach the first ring node, the initial movement direction is randomly selected according to the same probability, the movement direction is clockwise or anticlockwise, and data flow in two directions exists on the mixing ring; two data buffer queues are arranged on each node to store the traffic in different directions, and data packets are randomly inserted into the queues, so that the sequence of the data packets entering/leaving the node is randomly disturbed.
3. The method for protecting privacy of source node locations in WSNs based on a two-stage selection strategy according to claim 1, wherein: the transmission from the ring node to the sink node in the fourth step 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.
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 CN108551672A (en) | 2018-09-18 |
| CN108551672B true 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) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109819437B (en) * | 2018-12-29 | 2022-01-11 | 杭州电子科技大学 | Source node position privacy protection method based on Sink and grid in WSN |
| CN109660945B (en) * | 2019-02-18 | 2020-07-07 | 河海大学常州校区 | Dynamic multi-route source node position privacy protection method based on multiple sink nodes in WSN |
| CN113259932B (en) * | 2021-05-19 | 2023-05-05 | 贵州大学 | Source node position privacy protection strategy in WSNs |
Citations (5)
| 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 |
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10298691B2 (en) * | 2016-05-18 | 2019-05-21 | Veniam, Inc. | Systems and methods for managing the storage and dropping of data in a network of moving things |
-
2018
- 2018-03-28 CN CN201810262629.1A patent/CN108551672B/en active Active
Patent Citations (5)
| 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 |
| 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 |
|---|
| 《传感网中能量均衡高效的源位置隐私保护协议》;牛晓光;《通信学报》;20160425;第3-4节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108551672A (en) | 2018-09-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kamgueu et al. | Survey on RPL enhancements: A focus on topology, security and mobility | |
| CN107835510B (en) | Phantom routing-based wireless sensor network source node position privacy protection method | |
| Senouci et al. | Survey on vehicular ad hoc networks clustering algorithms: Overview, taxonomy, challenges, and open research issues | |
| CN108848461B (en) | WSNs source node position privacy protection method based on dynamic loop routing | |
| Deng et al. | Routing security in wireless ad hoc networks | |
| Sahu et al. | BAHG: Back-bone-assisted hop greedy routing for VANET's city environments | |
| Karakehayov | Using REWARD to detect team black-hole attacks in wireless sensor networks | |
| Jin et al. | TIGHT: A geographic routing protocol for cognitive radio mobile ad hoc networks | |
| Stojmenovic et al. | Internal nodes based broadcasting in wireless networks | |
| CN108551672B (en) | Source node position privacy protection method based on two-stage selection strategy in WSNs | |
| Misra et al. | Bird flight-inspired routing protocol for mobile ad hoc 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) | |
| Ko et al. | A new directional flooding protocol for wireless sensor networks | |
| Kumar et al. | A survey on topology and position based routing protocols in vehicular ad hoc network (VANET) | |
| CN111542059A (en) | WSNs source node position privacy protection method based on dynamic tree routing | |
| Goyal et al. | Ensuring privacy in opportunistic network | |
| Bhalaji et al. | Defense Strategy Using Trust Based Model to Mitigate Active Attacks in DSR Based MANET | |
| Varadharajan et al. | Energy-efficient virtual infrastructure based geo-nested routing protocol forwireless sensor networks | |
| Li et al. | Location service in sensor and mobile actuator networks | |
| Malwe et al. | Location aware sector-based routing in wireless ad hoc networks | |
| Shrestha et al. | An optimized multipath routing for secure communication of wireless sensor network | |
| Wuu et al. | Detour Routing Protocol for Geographic Sensor Networks | |
| Roy et al. | MCBHIDS: Modified layered cluster based algorithm for black hole IDS | |
| Alhan et al. | Analysis of encryption Dgrp-data gather routing protocol based on Opnet in VANETs |
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 |