The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
k-anonymous message transmission
Proceedings of the 10th ACM conference on Computer and communications security
Intrusion Tolerance and Anti-Traffic Analysis Strategies For Wireless Sensor Networks
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Source-location privacy in energy-constrained sensor network routing
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Enhancing Source-Location Privacy in Sensor Network Routing
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Countermeasures Against Traffic Analysis Attacks in Wireless Sensor Networks
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Towards event source unobservability with minimum network traffic in sensor networks
WiSec '08 Proceedings of the first ACM conference on Wireless network security
A novel scheme for protecting receiver's location privacy in wireless sensor networks
IEEE Transactions on Wireless Communications
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
Secure localization and authentication in ultra-wideband sensor networks
IEEE Journal on Selected Areas in Communications - Part 1
Using data mules to preserve source location privacy in wireless sensor networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Towards statistically strong source anonymity for sensor networks
ACM Transactions on Sensor Networks (TOSN)
Protecting the sink location privacy in wireless sensor networks
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
Wireless sensor networks (WSNs) have the potential to be widely used in many areas for unattended event monitoring. Mainly due to lack of a protected physical boundary, wireless communications are vulnerable to unauthorized interception and detection. Privacy is becoming one of the major issues that jeopardize the successful deployment of wireless sensor networks. While confidentiality of the message can be ensured through content encryption, it is much more difficult to adequately address the source-location privacy. For WSNs, source-location privacy service is further complicated by the fact that the sensor nodes consist of low-cost and low-power radio devices, computationally intensive cryptographic algorithms and large scale broadcasting-based protocols are not suitable for WSNs. In this paper, we propose source-location privacy schemes through routing to randomly selected intermediate node(s) before the message is transmitted to the SINK node. We first describe routing through a single a single randomly selected intermediate node away from the source node. Our analysis shows that this scheme can provide great local source-location privacy. We also present routing through multiple randomly selected intermediate nodes based on angle and quadrant to further improve the global source location privacy. While providing source-location privacy for WSNs, our simulation results also demonstrate that the proposed schemes are very efficient in energy consumption, and have very low transmission latency and high message delivery ratio. Our protocols can be used for many practical applications.