Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Cluster-Based Failure Detection Service for Large-Scale Ad Hoc Wireless Network Applications
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Communication-efficient failure detection and consensus in omission environments
Information Processing Letters
Fault management in wireless sensor networks
IEEE Wireless Communications
Eventually perfect failure detectors using ADD channels
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
Failure detection in WSNs, specifically due to message loses, has been usually tackled in the literature from probabilistic approaches. In this work we describe the adaptations of a deterministic failure detector algorithm, originally designed to work in a formal message omission model, to work in WSNs. We analyze the feasibility of the algorithm in WSNs and propose an adaptation to improve its scalability and reduce the energy consumption. The proposed algorithm builds a minimum spanning tree, where the cost of each link is associated to the message omission pattern of that link, which determines the quality of the link. Every node in the system uses heartbeat messages to monitor the communication quality with the nodes in its neighborhood and forwards this information to build the minimum spanning tree.