Journal
IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 11, Issue 12, Pages 1994-2007Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2011.194
Keywords
Sensor networks; fault tolerance; algorithm/protocol design and analysis
Funding
- US National Science Foundation [ANI-9977544, ANI-0136969, ANI-0240477, ECS-0225417, CCR 0209179]
Ask authors/readers for more resources
This paper presents a general fault-tolerant event detection scheme that allows nodes to detect erroneous local decisions by leveraging the local decisions reported by their neighbors. This detection scheme can handle cases where nodes have different accuracy levels. The derived fault-tolerant estimator is proven to be optimal under the maximum a posteriori (MAP) criterion. An equivalent weighted voting scheme is also derived. Further, two new error models are derived to take into account the neighbor distance and the geographical distributions of the two decision quorums. These models are particularly suitable for detection applications where the event under consideration is highly localized. The fault-tolerant estimator is simulated using a network of 1,024 nodes deployed randomly in a square region and assigned random probabilities of failure. Several estimation schemes that allow nodes to learn their error rates continuously are developed. These error rates are used in the distributed estimation schemes to assign appropriate weights to the nodes in the voting scheme.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available