Robust regression and outlier detection
Robust regression and outlier detection
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Time synchronization attacks in sensor networks
Proceedings of the 3rd ACM workshop on Security of ad hoc and 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
Attack-resistant location estimation in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Hi-index | 0.00 |
This paper explores two different algorithms designed for quick triangulation in the face of numerous incorrect measurements. The incorrect measurements can be randomly faulty or maliciously converging to an incorrect answer. Both algorithms require the number of correct measurements to exceed a user defined consensus threshold. Both algorithms will correctly terminate in an environment possessing more than 50% faulty beacons, as long as the number of correct measurements exceed the consensus threshold.