Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
SeRLoc: Robust localization for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
ROPE: robust position estimation in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
LAD: localization anomaly detection for wireless sensor networks
Journal of Parallel and Distributed Computing - 19th International parallel and distributed processing symposium
International Journal of Sensor Networks
Hi-index | 0.00 |
In wireless sensor networks, sensors should have some mechanisms to learn their locations since sensed data without associated location information may be meaningless. While many sensor localization algorithms have been proposed, security issues in sensor localization are usually not addressed in their original design. Secure sensor localization is very challenging due to limited computation and energy resources in sensors. It is highly desirable that a localization scheme is robust and is able to detect malicious attacks without using complex cryptographic operations. In this paper, we present and analyze detection methods purely based on geometric constraints in sensor networks. Our detection methods can strengthen the localization algorithm to be resilient to malicious attacks by detecting and eliminating the negative impact of fake information.