Adnan A. Hnaif*, Abdelfatah A. Tamimi, Ayman M. Abdalla, Iqbal Jebril
CMC-Computers, Materials & Continua, Vol.68, No.1, pp. 505-519, 2021, DOI:10.32604/cmc.2021.016123
Abstract Many routing protocols, such as distance vector and link-state protocols are used for finding the best paths in a network. To find the path between the source and destination nodes where every node is visited once with no repeats, Hamiltonian and Hypercube routing protocols are often used. Nonetheless, these algorithms are not designed to solve the problem of a node failure, where one or more nodes become faulty. This paper proposes an efficient modified Fault-free Hamiltonian Cycle based on the Hypercube Topology (FHCHT) to perform a connection between nodes when one or more nodes become faulty. FHCHT can be applied… More >