2012
DOI: 10.1109/tpds.2011.260
|View full text |Cite
|
Sign up to set email alerts
|

Quantitative Measurement and Design of Source-Location Privacy Schemes for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
58
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
7
3

Relationship

1
9

Authors

Journals

citations
Cited by 74 publications
(58 citation statements)
references
References 15 publications
0
58
0
Order By: Relevance
“…(1)Source nodes' location privacy protection Several schemes dealing with the source nodes' location privacy can be found in [2,4,[14][15][16][17][18][19][20][21][22]. For example, Kamat et al [4] proposed the phantom flooding protocol transmission of a packet to defend against an external adversary.…”
Section: Related Workmentioning
confidence: 99%
“…(1)Source nodes' location privacy protection Several schemes dealing with the source nodes' location privacy can be found in [2,4,[14][15][16][17][18][19][20][21][22]. For example, Kamat et al [4] proposed the phantom flooding protocol transmission of a packet to defend against an external adversary.…”
Section: Related Workmentioning
confidence: 99%
“…In this scheme, a path is pre-computed at the source and the data packet is encrypted in multiple layers with the public key of the forwarding node along the path to destination in a sequential order and each node removes their layer of encryption after receiving the packet and forward the remaining packet called the onion to the next hop and finally the decrypted data with all the layers of encryption removed, received by the des-tination. The work in [11] resorts to a quan-titative approach towards privacy. Authors in [12] specifically approach provisions for pri-vacy preservation but lack efficiency of gains achieved from the network coding.…”
Section: ) Preliminaries: Polynomial Based Schemementioning
confidence: 99%
“…They further propose a scheme to provide source location privacy through routing to a randomly selected intermediate node and a network-mixing ring [15]. Although these two schemes can provide comparable source privacy, the first scheme brings another problem of handling the selection of the AS (ambiguity set), while the second scheme again involves taking a random walk.…”
Section: Related Workmentioning
confidence: 99%