Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Secure verification of location claims
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
SeRLoc: secure range-independent localization for wireless sensor networks
Proceedings of the 3rd ACM workshop on Wireless security
TinyPK: securing sensor networks with public key technology
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Analysis of hop-distance relationship in spatially random sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Robust statistical methods for securing wireless localization in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Attack-resistant location estimation in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
ROPE: robust position estimation in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Reporter node determination of replicated node detection in wireless sensor networks
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Secure localization and location verification in wireless sensor networks: a survey
The Journal of Supercomputing
Hi-index | 0.00 |
Security plays an important role in the ability to deploy and retrieve trustworthy data from a wireless sensor network. Location verification is an effective defense against attacks which take advantage of a lack, or compromise, of location information. In this work, a secure probabilistic location verification method for randomly deployed dense sensor networks is proposed. The proposed Probabilistic Location Verification (PLV) algorithm leverages the probabilistic dependence of the number of hops a broadcast packet traverses to reach a destination and the Euclidean distance between the source and the destination. A small number of verifier nodes are used to determine the plausibility of the claimed location, which is represented by a real number between zero and one. Using the calculated plausibility metric, it is possible to create arbitrary number of trust levels in the location claimed. Simulation studies verify that the proposed solution provides high performance in face of various types of attacks.