Broadcasting in injured hypercubes using limited global information

We propose a fault-tolerant broadcasting algorithm in hypercubes with link faults. This algorithm is based on an extended spanning binomial tree structure which keeps the simplicity of conventional binomial tree-based broadcasting. Each node keeps limited information of nearby faulty links in terms of faulty adjacent subcubes. It is shown that under most circumstances, a broadcasting can be completed optimally in n steps except for a few cases with low probability which require n+1 steps