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
General Network Lifetime and Cost Models for Evaluating Sensor Network Deployment Strategies
IEEE Transactions on Mobile Computing
Towards event source unobservability with minimum network traffic in sensor networks
WiSec '08 Proceedings of the first ACM conference on Wireless network security
Transactional Confidentiality in Sensor Networks
IEEE Security and Privacy
Source location privacy against laptop-class attacks in sensor networks
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Privacy-aware routing in sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Optimal data compression and forwarding in wireless sensor networks
IEEE Communications Letters
Mitigation of compromising privacy by transmission range control in wireless sensor networks
IEEE Communications Letters
A survey of security issues in wireless sensor networks
IEEE Communications Surveys & Tutorials
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
IEEE Communications Magazine
Information Sciences: an International Journal
An elaborate chronological and spatial analysis of energy hole for wireless sensor networks
Computer Standards & Interfaces
Prolonging wireless sensor network lifetime in stealth mode through intelligent data compression
Proceedings of the 10th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networks
Hi-index | 0.00 |
In wireless sensor networks (WSNs) contextual information such as the information regarding whether, when, and where the data is collected cannot be protected using only traditional measures (e.g., encryption). Contextual information can be protected against global eavesdroppers by periodic packet transmission combined with dummy traffic filtering at proxy nodes. In this paper, through a Linear Programming (LP) framework, we analyze lifetime limits of WSNs preserving event-unobservability with different proxy assignment methodologies. We show that to maximize the network lifetime data flow should pass through multiple proxies that are organized as a general directed graph rather than as a tree.