A compounding algorithm for 1-fault tolerant broadcast networks

This theoretical paper presents a new construction algorithm for sparse 1-fault tolerant minimal broadcast networks (1-FTMBNs). To construct a large 1-FTMBN with the algorithm, identical nodes in copies of a broadcast network that is not fault tolerant are connected according to the edge structures of two known 1-FTMBNs with a special property. In most cases, computational results with this algorithm produce the bestknown bounds on the cardinalities of the edge sets of the sparsest 1-FTMBNs with an odd number of nodes.