
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
This paper proposes an online two phase fault
diagnosis algorithm for arbitrary connected networks. The
algorithm addresses a realistic fault model considering crash
and value faults in the nodes. Fault diagnosis is achieved by
comparing the heartbeat message generated by neighboring
nodes and dissemination of decision made at each node.
Theoretical analysis shows that time and message complexity
of the diagnosis scheme is O(n) for a nnode network. The
message and time complexity are comparable to the existing
state of art approaches and thus well suited for design of
different fault tolerant wireless communication networks
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment