EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Secure verification of location claims
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Channel surfing and spatial retreats: defenses against wireless denial of service
Proceedings of the 3rd ACM workshop on Wireless security
Node density independent localization
Proceedings of the 5th international conference on Information processing in sensor networks
Robust statistical methods for securing wireless localization in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Hi-index | 0.00 |
Most of the state-of-the-art localization algorithms in wireless sensor networks (WSNs) are vulnerable to attacks from malicious or compromised network nodes, whereas the secure localization schemes proposed so far are too complex to be applied to power constrained WSNs. This paper provides a novel secure scheme "Bilateration" which is derived from multilateration but can be calculated more accurately and quickly to resolve the positions of unknown nodes without explicitly distinguishing what kind of location attacks the WSN is facing. This paper also compares Bilateration with three existing multilateration solutions that optimize the location estimation accuracy via LS, LMS and LLMS respectively in a simulated threat environment. The experiment results show that Bilateration gets the best tradeoff among estimation error, filtering ability and computational complexity.