scholarly journals An Efficient Source Location Privacy Protection Algorithm Based on Circular Trap for Wireless Sensor Networks

Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 632 ◽  
Author(s):  
Yiting Wang ◽  
Liang Liu ◽  
Wenzhao Gao

With the aim of addressing the problem of high overhead and unstable performance of the existing Source Location Privacy (SLP) protection algorithms, this paper proposes an efficient algorithm based on Circular Trap (CT) which integrates the routing layer and MAC layer protocol to provide SLP protection for WSNs. This algorithm allocates time slots for each node in the network by using Time Division Multiple Access (TDMA) technology, so that data loss caused by channel collisions can be avoided. At the same time, a circular trap route is formed to induce an attacker to first detect the packets from the nodes on the circular route, thereby moving away from the real route and protecting the SLP. The experimental results demonstrate that the CT algorithm can prevent the attacker from tracking the source location by 20% to 50% compared to the existing cross-layer SLP-aware algorithm.

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2074 ◽  
Author(s):  
Qiuhua Wang ◽  
Jiacheng Zhan ◽  
Xiaoqin Ouyang ◽  
Yizhi Ren

Wireless Sensor Networks (WSNs) have been widely deployed to monitor valuable objects. In these applications, the sensor node senses the existence of objects and transmitting data packets to the sink node (SN) in a multi hop fashion. The SN is a powerful node with high performance and is used to collect all the information sensed by the sensor nodes. Due to the open nature of the wireless medium, it is easy for an adversary to trace back along the routing path of the packets and get the location of the source node. Once adversaries have got the source node location, they can capture the monitored targets. Thus, it is important to protect the source node location privacy in WSNs. Many methods have been proposed to deal with this source location privacy protection problem, and most of them provide routing path diversity by using phantom node (PN) which is a fake source node used to entice the adversaries away from the actual source node. But in the existing schemes, the PN is determined by the source node via flooding, which not only consumes a lot of communication overhead, but also shortens the safety period of the source node. In view of the above problems, we propose two new grid-based source location privacy protection schemes in WSNs called grid-based single phantom node source location privacy protection scheme (SPS) and grid-based dual phantom node source location privacy protection scheme (DPS) in this paper. Different from the idea of determining the phantom node by the source node in the existing schemes, we propose to use powerful sink node to help the source node to determine the phantom node candidate set (PNCS), from which the source node randomly selects a phantom node acting as a fake source node. We evaluate our schemes through theoretical analysis and experiments. Experimental results show that compared with other schemes, our proposed schemes are more efficient and achieves higher security, as well as keeping lower total energy consumption. Our proposed schemes can protect the location privacy of the source node even in resource-constrained wireless network environments.


Sensors ◽  
2019 ◽  
Vol 19 (5) ◽  
pp. 1037 ◽  
Author(s):  
Lilian Mutalemwa ◽  
Seokjoo Shin

Achieving high source location privacy is critical when Wireless Sensor Networks (WSNs) are used in sensitive applications such as in asset or battlefield monitoring. Due to the sensitivity of information in these applications, it is important to ensure the flow of data between sensor nodes is secure and it does not expose any information about the monitored assets to an adversary. This paper proposes a routing scheme with stronger source location privacy than the privacy of traditional routing schemes. The paper addresses some limitations of four existing schemes by providing highly random routing paths between the source nodes and sink node. The scheme randomly sends packet to the sink node through tactically positioned proxy nodes to guarantee the routes are highly befuddling to the adversary. To achieve high privacy, the proposed scheme uses a randomizing factor to generate a new random route for every successive packet. Simulation results demonstrate that the proposed scheme provides longer safety period and stronger privacy to outperform other schemes. Furthermore the scheme provides stronger privacy against both, patient and cautious adversary models.


Sign in / Sign up

Export Citation Format

Share Document