SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Robotics-based location sensing using wireless ethernet
Proceedings of the 8th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Enhancing Source-Location Privacy in Sensor Network Routing
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Location Privacy in Mobile Systems: A Personalized Anonymization Model
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Maelstrom: receiver-location preserving in wireless sensor networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
| Hi-index | 0.00 |
Source-location privacy is a sensor network privacy that is quite different from content privacy, which could be protected by usual network security techniques. In a sensor network environment, the wireless medium is shared. An adversaries may trace back to the source sensor hop by hop with signal localization devices. In order to enhance source-location privacy, a technique called phantom routing [8] has emerged. Phantom routing consists of two phases: random walk to create phantom sources and a subsequent routing phase to deliver a message to the sink. Random walk phase plays an important role in phantom routing. Two approaches, which are sector-based directed random walk and hop-based directed random walk, could be applied to random walk phase. However, it is observed that the performance of those two random walk approaches will drop if the source locates in certain regions of the sensing field. The reason is that a message may be blocked at a node because no neighbors are available in the direction chosen by the source at beginning. This will result in the premature termination of the random walk phase. In this paper, a self-adjusting directed random walk technique is proposed. This approach is able to adjust the direction of the random walk based on the estimation of the current node's relative location to the source when a message is blocked. From the results of simulation, self-adjusting directed random walk solves above problem and shows an improvement on the overall performance of phantom routing.