Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Proceedings of the First International Workshop on Information Hiding
Routing Through the Mist: Privacy Preserving Communication in Ubiquitous Computing Environments
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Communication Networks
Analyzing and modeling encryption overhead for sensor network nodes
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Intrusion Tolerance and Anti-Traffic Analysis Strategies For Wireless Sensor Networks
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Enhancing Source-Location Privacy in Sensor Network Routing
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
ANSWER: autonomous wireless sensor network
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
An Identity-Free and On-Demand Routing Scheme against Anonymity Threats in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Anonymous topology discovery for multihop wireless sensor networks
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
Efficient Topology Discovery for Multihop Wireless Sensor Networks
CNSR '08 Proceedings of the Communication Networks and Services Research Conference
INSENS: Intrusion-tolerant routing for wireless sensor networks
Computer Communications
Decorrelating wireless sensor network traffic to inhibit traffic analysis attacks
Pervasive and Mobile Computing
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
MASK: anonymous on-demand routing in mobile ad hoc networks
IEEE Transactions on Wireless Communications
An efficient anonymous communication protocol for wireless sensor networks
Wireless Communications & Mobile Computing
Sensor node source privacy and packet recovery under eavesdropping and node compromise attacks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
In a wireless sensor network (WSN), concealing the locations, and in some cases the identities of nodes, especially the controller (sometimes called sink or base station) is an important problem. In this paper, we explain that appropriate solutions for this problem depend on the nature of the traffic generated in the network as well as the capabilities of the adversary that must be resisted. When there is a sufficient amount of data flows (real or fake packets), our proposed DCARPS anonymous routing protocol can support location privacy against a global eavesdropper. Otherwise, it is only possible to stop packet tracing attacks by a local eavesdropper, which is what our probabilistic DCARPS protocol achieves. These protocols are based on label switching, which has not been used in this kind of network before. To enable DCARPS, we propose a new approach for network topology discovery that allows the sink to obtain a global view of the topology without revealing its own location, as opposed to what is common today in sensor networks. In order to resist traffic analysis attacks aiming at locating nodes, we have used layered cryptography to make a packet look randomly different on consecutive links. A stochastic security analysis of this protocol is provided. Another important issue in resource-constrained sensor networks is energy conservation. To this end, our protocols use only modest symmetric cryptography. Also, the sink is responsible for all routing calculations while the sensors only perform simple label swapping actions when forwarding packets. Another advantage of labels is preventing unnecessary cryptographic operations as will be seen in the manuscript. Furthermore, we have embedded a fairness scheme in the creation of the routing tree for the sensor network that distributes the burden of packet forwarding evenly.