We consider broadcasting in radio networks that are subject to permanent node failures of unknown location. Nodes are spread in a region in some regular way. We consider two cases: nodes are either situated at integer points of a line or they are situated in the plane, at grid points of a square or
Fault-tolerant cycle embedding in hierarchical cubic networks
✍ Scribed by Jung-Sheng Fu; Gen-Huey Chen
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 184 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A hierarchical cubic network was proposed as an alternative to the hypercube. By HCN(n), we denote the hierarchical cubic network that contains 2^n^
n‐dimensional hypercubes. In this paper, using Gray codes, we construct fault‐free Hamiltonian cycles in an HCN(n) with n − 1 link faults. Since the HCN(n) is regular of degree n + 1, the result is optimal. We also construct longest fault‐free cycles of length 2^2__n__^ − 1 in an HCN(n) with a one‐node fault and fault‐free cycles of length at least 2^2__n__^ − 2__f__ in an HCN(n) with f‐node faults, where 2^2__n__^ is the number of nodes in the HCN(n), f ≤ n − 1 if n = 3 or 4 and f ≤ n if n ≥ 5. Our results can be applied to the hierarchical folded‐hypercube network as well. © 2003 Wiley Periodicals, Inc.
📜 SIMILAR VOLUMES
We have explored methods for checkpointing and restarting processes within the distributed object migration environment (Dome), a C++ library of data parallel objects that are automatically distributed over heterogeneous networks of workstations (NOWs). System level checkpointing methods, although t
## Abstract One of the most important issues in wireless sensor networks is to develop the technology for improved fault tolerance, since sensor nodes are prone to failure (for mechanical reasons, for example) and have limited energy storage. The strategy for determining the positions in which sens