Enhancing Location Privacy in WSN

2013 ◽  
pp. 191-203 ◽  
Author(s):  
Leonidas Kazatzopoulos
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Target Detection ◽  
Location Privacy ◽  
Information Source ◽  
Wireless Sensor ◽  
Packet Delivery ◽  
Overlay Routing ◽  
Routing Method ◽  
Significant Attention

Wireless Sensor Networks (WSNs) receive significant attention due to the wide area of applications: environment monitoring, tracking, target detection, etc. At the same time, in some cases, the captured information from the WSN might be considered as private, for example, location of an important asset. Thus, security mechanisms might be essential to ensure the confidentiality of the location of the information source. In this chapter, the authors present an approach called iHIDE (information HIding in Distributing Environments) to enable source-location privacy in WSNs. iHIDE adopts a non-geographical, overlay routing method for packet delivery. This chapter presents the architecture and assesses its performance through simulation experiments, providing comparisons with relative approaches.

scholarly journals An Enhanced Source Location Privacy based on Data Dissemination in Wireless Sensor Networks (DeLP)

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2050 ◽  
Author(s):  
Naveed Jan ◽  
Ali Al-Bayatti ◽  
Naseer Alalwan ◽  
Ahmed Alzahrani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Location Privacy ◽  
Source Location ◽  
Base Station ◽  
Source Node ◽  
Wireless Sensor ◽  
Packet Delivery ◽  
Safety Period

Wireless Sensor Network is a network of large number of nodes with limited power and computational capabilities. It has the potential of event monitoring in unattended locations where there is a chance of unauthorized access. The work that is presented here identifies and addresses the problem of eavesdropping in the exposed environment of the sensor network, which makes it easy for the adversary to trace the packets to find the originator source node, hence compromising the contextual privacy. Our scheme provides an enhanced three-level security system for source location privacy. The base station is at the center of square grid of four quadrants and it is surrounded by a ring of flooding nodes, which act as a first step in confusing the adversary. The fake node is deployed in the opposite quadrant of actual source and start reporting base station. The selection of phantom node using our algorithm in another quadrant provides the third level of confusion. The results show that Dissemination in Wireless Sensor Networks (DeLP) has reduced the energy utilization by 50% percent, increased the safety period by 26%, while providing a six times more packet delivery ratio along with a further 15% decrease in the packet delivery delay as compared to the tree-based scheme. It also provides 334% more safety period than the phantom routing, while it lags behind in other parameters due to the simplicity of phantom scheme. This work illustrates the privacy protection of the source node and the designed procedure may be useful in designing more robust algorithms for location privacy.

scholarly journals A Restricted Multipath Routing Algorithm in Wireless Sensor Networks Using a Virtual Cylinder: Bypassing Black hole and Selective Forwarding Attacks

2019 ◽  
Vol 3 (2) ◽  
pp. 51
Author(s):  
Elham Bahmani ◽  
Aso Mohammad Darwesh Darwesh ◽  
Mojtaba Jamshidi ◽  
Somaieh Bali
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Source Node ◽  
Wireless Sensor ◽  
Sink Node ◽  
Packet Delivery ◽  
Selective Forwarding ◽  
Routing Method

In this paper, a simple and novel routing algorithm is presented to improve the packet delivery in harsh conditions such as selective forwarding and blackhole attacks to the wireless sensor networks. The proposed algorithm is based on restricted multi-path broadcast based on a virtual cylinder from the source node to the sink node. In this algorithm, when a packet is broadcast by a source node, a virtual cylinder with radius w is created from the source node to a sink node. All the nodes located in this virtual cylinder are allowed to forwardthe packet to the sink. Thus, data is forwarded to sink via multiple paths, but in a restricted manner so that the nodes do not consume a high amount of energy. If there are some compromised nodes in this virtual cylinder, the packets may be forwarded to the sink via other nodes of the virtual cylinder. The proposed algorithm is simulated and evaluated in terms of packet delivery rate and energy consumption. The experiment results show that the proposed algorithm increases packet delivery rate 7 times compared to the single-path routing method and reduces energy consumption up to three times compared to flooding routing method.

SPREAD - A Routing Protocol to Meet End-to-end Adjusted Deadline in Real Time Wireless Sensor Networks

2020 ◽  
Vol 10 (1) ◽  
pp. 63-78
Author(s):  
Neetika Jain ◽  
Sangeeta Mittal
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Resource Constraints ◽  
Wireless Sensor ◽  
Network Simulator ◽  
Packet Delivery ◽  
High Data ◽  
Hard Real Time

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.

Sign in / Sign up

Export Citation Format

Share Document