In this paper, we propose a novel method to deal with a large number of faults existing in the system based on the PMC model. We derive a fault bound T for a N-node ring based on cycle partition and Pigeonhole principle. Under this fault bound, it is guaranteed that at least one sequence obtained from cycle partition can be picked out and all nodes in this sequence can be identified. The corresponding ring diagnosis algorithm is then provided. Using this ring diagnosis method, we propose a five-round adaptive diagnosis scheme for networks containing Hamiltonian cycle. Simulations show that for Hamiltonian networks with node degree more than 3, it can achieve almost complete diagnosis.Index Terms-The PMC model, adaptive fault diagnosis, hypercubes, ring, Hamiltonian cycle 1045-9219 ß
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.