The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Electrical engineering: principles and applications
Electrical engineering: principles and applications
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
SPINS: security protocols for sensor networks
Wireless Networks
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Privacy-enhancing technologies for the Internet
COMPCON '97 Proceedings of the 42nd IEEE International Computer Conference
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Optimal Physical Diversity Algorithms and Survivable Networks
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
TinySec: a link layer security architecture for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
On Flow Marking Attacks in Wireless Anonymous Communication Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Enhancing Source-Location Privacy in Sensor Network Routing
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Finding minimum energy disjoint paths in wireless ad-hoc networks
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Privacy-aware location sensor networks
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
A performance evaluation of intrusion-tolerant routing in wireless sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
MASK: anonymous on-demand routing in mobile ad hoc networks
IEEE Transactions on Wireless Communications
Maximizing lifetime of event-unobservable wireless sensor networks
Computer Standards & Interfaces
Privacy aware publishing of successive location information in sensor networks
Future Generation Computer Systems
Sensor node source privacy and packet recovery under eavesdropping and node compromise attacks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
A typical sensor network application is to monitor objects, including wildlife, vehicles and events, in which information about an object is periodically sent back to the sink. Many times, the object needs to be protected for security reasons. However, an adversary can detect message flows and trace the message back to its source by moving in the reverse direction of the flows. This paper aims to maximize source location privacy, which is evaluated by the adversary's traceback time, by designing routing protocols that distribute message flows to different routes. First, we give the performance bound for any routing scheme. Then, we present our routing schemes, which maximize the adversary's average traceback time and achieve max-min traceback time given certain energy constraints. We then propose WRS, a suboptimal but practical privacy-aware routing scheme, and provide simulation results. Finally, we extend the discussion to an extreme adversary model, which allows the adversary to deploy an adversary sensor network to monitor the message routing activities. Accordingly, we propose a random schedule scheme to confuse the adversary. To reduce the message delivery time, we give an approximation algorithm for message routing.