A fault diagnosis algorithm for wireless sensor networks
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
| Hi-index | 0.00 |
This paper presents a distributed network diagnosis (DND) algorithm for an arbitrary network topology where every node needs to record the status of every other nodes and links assuming the nodes and links are subjected to crash and value faults in a dynamic fault environment (the node's or link's status may change during execution of algorithm). The algorithm operates correctly in each connected component if the network is partitioned due to a set of faulty links or faulty nodes. The worst-case bounds for diagnostic latency is at most O(td) rounds where t is the number of dissemination trees and d is the diameter of the network. The proposed approach uses non-broadcasting method of message dissemination that has similar diagnostic latency with flooding [4] and similar message complexity with Chinese Agent [14] method of message dissemination respectively.