Temporal privacy in wireless sensor networks
Authors:
Open Access
- 27 November 2009
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Sensor Networks
- Vol. 5 (4) , 1-24
Abstract
Although the content of sensor messages describing “events of interest” may be encrypted to provide confidentiality, the context surrounding these events may also be sensitive and therefore should be protected from eavesdroppers. An adversary armed with knowledge of the network deployment, routing algorithms, and the base-station (data sink) location can infer the temporal patterns of interesting events by merely monitoring the arrival of packets at the sink, thereby allowing the adversary to remotely track the spatio-temporal evolution of a sensed event. In this paper we introduce the problem of temporal privacy for delay-tolerant sensor networks, and propose adaptive buffering at intermediate nodes on the source-sink routing path to obfuscate temporal information from the adversary. We first present the effect of buffering on temporal privacy using an information-theoretic formulation, and then examine the effect that delaying packets has on buffer occupancy. We observe that temporal privacy and efficient buffer utilization are contrary objectives, and then present an adaptive buffering strategy that effectively manages these tradeoffs. Finally, we evaluate our privacy enhancement strategies using simulations, where privacy is quantified in terms of the adversary's mean square error.Keywords
This publication has 20 references indexed in Scilit:
- Countermeasures Against Traffic Analysis Attacks in Wireless Sensor Networks2006
- Mutual Information and Minimum Mean-Square Error in Gaussian ChannelsIEEE Transactions on Information Theory, 2005
- Security and privacy in sensor networksComputer, 2003
- An authentication framework for hierarchical ad hoc sensor networks2003
- Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking2003
- Elements of Information Theory2001
- On the design and quantification of privacy preserving data mining algorithms2001
- Privacy-preserving data miningACM SIGMOD Record, 2000
- Bits through queuesIEEE Transactions on Information Theory, 1996
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981