Strategic Location-Based Random Routing for Source Location Privacy in Wireless Sensor Networks (original) (raw)
Related papers
Sensors, 2019
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 pr...
IRJET-Novel Routing Scheme to conceal Location Privacy in Wireless Sensor Networks
IRJET, 2020
Wireless sensor networks comprise various sensors that are deployed to watch the physical world. and lots of existing security schemes use traditional cryptography theory to safeguard message content and contextual information. However, we are concerned about location security of nodes. In this proposed paper, we are proposing an anonymous routing strategy for preserving location privacy (ARPLP), which sets a proxy source node to cover existing location of real source node. and also the real source node randomly selects several neighbours as receivers until the packets are transmitted to the proxy source. and also the proxy source is randomly selected in order that the adversary finds it difficult to get the placement information of the important source node. Meanwhile, our scheme sets a branch area round the sink, which may disturb the adversary by increasing the routing branch. Consistent with the analysis and simulation experiments, our scheme can reduce traffic consumption and communication delay, and improve the protection of source nodes and base station.
International Journal of Advance Engineering and Research Development, 2014
In recent years, Wireless Sensor Network has drawn considerable attention from research community due to wide range of applications used. The most notable challenge which is threatening the WSN is source location privacy. Preserving the source location means hiding the physical location of the source from the adversaries and increasing difficulty for adversaries in tracing the message path back to the source location. Although many of the privacy related schemes such as Phantom routing has been established, still there exists problem with source location privacy. This paper focuses on one solution namely Tree-based Diversionary Routing scheme. The main goal of Tree based diversionary routing is to improve performance in two aspects: privacy and network lifetime. The idea behind Tree-based Diversionary Routing scheme is to create diversionary routes along the path from source to sink and at the end of each route, Fake node is present. This increases difficulty for adversaries in tracing the path and identifying the source node. At the same time, Network Lifetime is also maximized by minimizing the energy consumption in hotspot region and utilizing that energy in creating the diversionary routes in non-hotspot region. The Directed oriented attack which leads the adversaries to identify source node easily can also be avoided.
Protecting Receiver-Location Privacy in Wireless Sensor Networks
2007
Due to the open nature of a sensor network, it is relatively easy for an adversary to eavesdrop and trace packet movement in the network in order to capture the receiver physically. After studying the adversary's behavior patterns, we present countermeasures to this problem. We propose a locationprivacy routing protocol (LPR) that is easy to implement and provides path diversity. Combining with fake packet injection, LPR is able to minimize the traffic direction information that an adversary can retrieve from eavesdropping. By making the directions of both incoming and outgoing traffic at a sensor node uniformly distributed, the new defense system makes it very hard for an adversary to perform analysis on locally gathered information and infer the direction to which the receiver locates. We evaluate our defense system based on three criteria: delivery time, privacy protection strength, and energy cost. The simulation results show that LPR with fake packet injection is capable of providing strong protection for the receiver's location privacy. Under similar energy cost, the safe time of the receiver provided by LPR is much longer than other methods, including Phantom routing [1] and DEFP [2]. The performance of our system can be tuned through a couple of parameters that determine the tradeoff between energy cost and the strength of location-privacy protection.
Energies
Traffic analysis attacks are common in monitoring wireless sensor networks (WSNs). In the attacks, adversaries analyze the traffic pattern to obtain critical information such as the location information of a source node. Fake source packet routing protocols are often used to ensure source location privacy (SLP) protection. The protocols rely on broadcasting fake packets from fake sources concurrently with the transmission of real packets from the real source nodes to obfuscate the adversaries. However, fake source packet routing protocols have demonstrated some performance limitations including high energy consumption, low packet delivery ratio (PDR), and long end-to-end delay (EED). In this study, two existing fake source packet routing protocols are considered. Then two new phantom-based SLP routing protocols are proposed to address the limitations. Each proposed protocol introduces a two-level phantom routing strategy to ensure two adversary confusion phases. When the adversaries...
A Survey Paper on Scalable & Routing Efficient Methods for Source Location Privacy in WSNs
International journal of engineering research and technology, 2014
The use of wireless sensor networks (WSNs) in many real time applications are growing significantly due to its wide range of benefits to end users. The major issue with WSNs is the security. Researchers have already presented various methods over WSN security, especially for privacy preservation. From the literature study, the privacy preserving security methods for WSN are having influence over the performance parameters like latency, energy efficiency, communication cost, throughput etc. WSNs are resource constrained, means sensor nodes having limited resources. Most existing methods use the PKI (public key infrastructure) for security purpose, but these methods consume more power of sensor nodes as well as not scalable. Thus to overcome these two limitations, recently the new privacy preservation method is introduced. This method proposed some criteria for the quantitative metrics source location privacy (SLP) for routing oriented methods in WSN. Using this method, the SLP is achieved with goal of efficient energy utilization via the two phase routing. It means SLP through the Routing to a randomly selected intermediate node (RSIN) and a network mixing ring (NMR). However this method is not scalable as required for most of real life applications, as well not evaluated for other performance metrics such as throughput, packet delivery ratio and end to end delay which are vital for any routing scheme in WSN. Therefore in this paper we are presenting the improved method with aim of achieving the network scalability and efficient routing performance while maintaining the source location privacy security.
IEEE Access, 2019
Sensor nodes in wireless sensor networks (WSNs) are usually battery-operated and resourceconstrained. The sensor nodes are often deployed in remote areas where the batteries cannot easily be recharged or replaced. Consequently, power becomes a limited resource in WSNs. Thus, energy consumption of the sensor nodes is among parameters of paramount importance. Subsequently, source location privacy (SLP) routing schemes must be energy-efficient and overall cost-effective. Angle-based routing schemes can cost-effectively protect the SLP. The goal of this study is to propose a new path node offset angle routing algorithm to improve the packet transmission cost of two existing SLP routing schemes. The proposed algorithm considers path node offset angles, arbitrary factors, and contrived regions to compute relatively short but greatly randomized routing paths. The routes offer a reduced number of packet forwarding events in the near-sink region and eventually diminish the packet transmission cost. Performance analysis results verify that the proposed path node offset angle routing algorithm effectively improves the packet transmission cost of the schemes and guarantees strong SLP protection throughout the WSN domain. Furthermore, the routing algorithm is capable of alleviating the energy-hole problem.
Location privacy and anonymity preserving routing for wireless sensor networks
Computer Networks, 2008
In a wireless sensor network (WSN), concealing the locations, and in some cases the identities of nodes, especially the controller (sometimes called sink or base station) is an important problem. In this paper, we explain that appropriate solutions for this problem depend on the nature of the traffic generated in the network as well as the capabilities of the adversary that must be resisted. When there is a sufficient amount of data flows (real or fake packets), our proposed DCARPS anonymous routing protocol can support location privacy against a global eavesdropper. Otherwise, it is only possible to stop packet tracing attacks by a local eavesdropper, which is what our probabilistic DCARPS protocol achieves. These protocols are based on label switching, which has not been used in this kind of network before. To enable DCARPS, we propose a new approach for network topology discovery that allows the sink to obtain a global view of the topology without revealing its own location, as opposed to what is common today in sensor networks. In order to resist traffic analysis attacks aiming at locating nodes, we have used layered cryptography to make a packet look randomly different on consecutive links. A stochastic security analysis of this protocol is provided. Another important issue in resource-constrained sensor networks is energy conservation. To this end, our protocols use only modest symmetric cryptography. Also, the sink is responsible for all routing calculations while the sensors only perform simple label swapping actions when forwarding packets. Another advantage of labels is preventing unnecessary cryptographic operations as will be seen in the manuscript. Furthermore, we have embedded a fairness scheme in the creation of the routing tree for the sensor network that distributes the burden of packet forwarding evenly.
Secure information Collection in Wireless Sensor Networks Using Randomized Routes Approach
ABSTRACT In wireless sensor network there are various possible security threats encountered during data delivery, among the various possible threats like information security, node failure, etc. we are presenting this paper in order to conquer the ‘blackholes’ that are formed due to compromised-node (CN) and denial-of-service (DoS) by using some routing mechanisms approach. The existing multi-path routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. Compromised-node and denial-of-service are two key attacks in Wireless sensor networks (WSNs). We have developed a structure that generates randomized routes. Under this design the routes taken by the “shares” of different packets change over time to time increasing the probability of randomness of paths to be selected for transferring the data. Hence, even though adversary or offender comes to know about the routing algorithm still it cannot pinpoint the routes in where each packet is roam randomly. Apart from randomness, the routes that are generated by these mechanisms are energy efficient as well as dispersive which ultimately make them capable of circumventing the blackholes at less energy cost. Extensive frameworks are conducted to verify the validity of our mechanisms.