Protecting Location Privacy in Sensor Networks against a Global Eavesdropper

Mehta, Kusum; Liu, Donggang; Wright, Matthew

doi:10.1109/tmc.2011.32

Cited by 151 publications

(120 citation statements)

References 22 publications

Supporting

Mentioning

115

Contrasting

Order By: Relevance

“…The techniques described in [14] and [15] cannot protect against the global attacker. (2)Sink's location privacy protection A variety of approaches have been used for this purpose, such as fake message injection, randomization of forwarding delay, and use of fake sinks in order to hide the real sinks' positions [3,5,6,[23][24][25][26][27][28][29][30][31][32][33]. For example, Nezhad et al [24] proposed an anonymous topology discovery protocol where all nodes were allowed to forward route discovery messages and incoming/outgoing labels assigned to nodes.…”

Section: Related Workmentioning

confidence: 99%

“…Although the inclusion of dummy sinks can protect a sensor network from local adversaries, it is not effective in the case of a global adversary, since global traffic analysis will allow the identification of all fake and real sinks, and the adversary can neutralize all of them. In [26], Mehta et al proposed to create multiple candidate traffic traces going to the established fake sinks in order to hide the traffic aggregating around real sinks. Similarly to [5], whenever a fake sink receives a packet and broadcasts it locally, it will make the attacker believe that a real sink could be in the range of the fake sink.…”

Section: Related Workmentioning

confidence: 99%

“…Compared to [5,26], our proposed ATA scheme makes each node have the same traffic volume. Thus, our scheme can hide the sink location completely.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Anti-traffic analysis attack for location privacy in WSNs

Ying

Makrakis

Mouftah

2014

J Wireless Com Network

View full text Add to dashboard Cite

Traditional encryption and authentication methods are not effective in preserving a sink's location privacy from a global adversary that is monitoring the network traffic. In this paper, we first propose a novel anti-traffic analysis (ATA) method to preserve the sink's location privacy. In order to confuse a local or global adversary, each node generates dummy messages, the number of which is dependent on the number of the node's children. Hence, ATA is able to prevent the adversary from acquiring valuable information on the sink's location through the traffic analysis attack. However, a larger number of dummy messages lead to consumption of extra energy. Then, we design our improved ATA (IATA) in such a way that we select some sensors to act as fake sinks, to ensure that sensors around fake sinks generate dummy messages and discard received dummy messages. Since the problem of the optimal fake sinks' placement is nondeterministic polynomial time (NP)-hard, we employ local search heuristics based on network traffic and security entropy. Performance analysis of the ATA scheme can protect the sink's location privacy, and IATA scheme can reduce energy consumption.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Anti-traffic analysis attack for location privacy in WSNs

Ying

Makrakis

Mouftah

2014

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…The encrypted communication combined with the usage of dummy packets makes it impossible even for the global observer [24] to isolate the node initiating the communication session. Additionally, a session is never initiated at the MC as it can only request for a session to a MR.…”

Section: Anonymitymentioning

confidence: 99%

Network Coding Combined with Onion Routing for Anonymous and Secure Communication in a Wireless Mesh Network

Prakash¹,

Agrawal²,

Chen³

2014

IJCNC

View full text Add to dashboard Cite

This paper presents a novel scheme that provides high level of security and privacy in a Wireless Mesh Network (WMN). We combine an approach of Network Coding with multiple layered encryption of onion routing for a WMN. An added superior feature provides higher level of security and privacy. Sensitive network information is confined to 1-hop neighborhood which is available anyways in a wireless medium with nodes using a bivariate polynomial. The only routing information divulged to a relay node is about next hop. No plain text is ever transmitted and all data can only be decrypted by its source and destination.Prior work finds it difficult to enforce encryption with network coding without divulging in complete routing information,hence losing privacy and anonymity. We compare our scheme with other existing approach for several networks. The preliminary results show this work to provide superior security and anonymity at low overhead cost.

show abstract

“…However, it should be seen that, the thoughts of security and credibility are orthogonal and large in adjusted transmission (with symmetric-key encryption for assurance protection and message approval codes for authenticity [7,8]. Regardless, these transitional points should not take any information about the last aggregate or individual data in a faultless arrangement.…”

Section: Introductionmentioning

confidence: 99%

Adequate Sparse Secure and Minkowski Distance Based Location Privacy Approach in Wireless Sensor Network

Meena¹,

Sharma²

2017

IJIES

View full text Add to dashboard Cite

Abstract:Wireless sensor networks (WSNs) are susceptible to various issues such as privacy and security. To overcome these issues, our worka first validates the location privacy issues and security protection. So that introduce a novel method known as Adequate Sparse Secure and Minkowski distance based Location Privacy (ASSMLP), in this first phase concentrates on location privacy which is improved by presenting a technique known as Fake Source and Fake Sink (FSFS). In this the location of fake node is separated by Modified Pillar k means based Minkowski distance. Second phase deliberate on security and here confidentiality of message can be ensured through sparse matrix. Thus the result shows throughput, energy consumption, energy efficiency, delay and packet delivery ratio and it achieves 2%, 7%, 36%, 8% and 8% better performance than existing work. Clustering accuracy is showed by means of minimum silhouette coefficient. Since real node cannot identify with an intruder.

show abstract

Protecting Location Privacy in Sensor Networks against a Global Eavesdropper

Cited by 151 publications

References 22 publications

Anti-traffic analysis attack for location privacy in WSNs

Anti-traffic analysis attack for location privacy in WSNs

Network Coding Combined with Onion Routing for Anonymous and Secure Communication in a Wireless Mesh Network

Adequate Sparse Secure and Minkowski Distance Based Location Privacy Approach in Wireless Sensor Network

Contact Info

Product

Resources

About