Vol.68, No.1, 2021, pp.505-519, doi:10.32604/cmc.2021.016123
A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology
  • Adnan A. Hnaif*, Abdelfatah A. Tamimi, Ayman M. Abdalla, Iqbal Jebril
Faculty of Science and Information Technology, Al-Zaytoonah University of Jordan, Amman, 11733, Jordan
* Corresponding Author: Adnan A. Hnaif. Email:
(This article belongs to this Special Issue: Application of Big Data Analytics in the Management of Business)
Received 24 December 2020; Accepted 26 January 2021; Issue published 22 March 2021
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 in a different environment to transmit data with a high-reliability connection by finding an alternative path between the source and destination nodes when some nodes fail. Moreover, a proposed Hamiltonian Near Cycle (HNC) scheme has been developed and implemented. HNC implementation results indicated that FHCHT produces alternative cycles relatively similar to a Hamiltonian Cycle for the Hypercube, complete, and random graphs. The implementation of the proposed algorithm in a Hypercube achieved a 31% and 76% reduction in cost compared to the complete and random graphs, respectively.
Hamiltonian cycle; hypercube; fault tolerance; routing protocols; WSN; IoT
Cite This Article
A. A. Hnaif, A. A. Tamimi, A. M. Abdalla and I. Jebril, "A fault-handling method for the hamiltonian cycle in the hypercube topology," Computers, Materials & Continua, vol. 68, no.1, pp. 505–519, 2021.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.