## Abstract

c-Broadcasting is a special process to disseminate a single message, originated at any node in a network, to all other nodes of the network by letting each informed node transmit the message to at most c neighbors simultaneously. A minimal c-broadcast network (c-mbn) is a communication network in which c-broadcasting can be completed in minimum time from any node. An optimal c-broadcast network (c-obn) is a c-mbn with the smallest number of edges. Previous studies showed that c-obn's are extremely difficult to find. A network compounding algorithm is proposed to construct sparse c-mbn's with n_{1}n_{2} - i nodes by connecting a subset of nodes from several copies of a c-mbn with n_{1} nodes using the structure of another c-mbn with n_{2} nodes, such that n_{1} ≥ 1 and 0 ≤ i < n_{2}, satisfying [log_{c+1}(n_{1}n_{2} - i)] = [log_{c+1} n_{1}] + [log_{c+1}n_{2}]. Computational results are also provided.

Original language | English (US) |
---|---|

Pages (from-to) | 6-21 |

Number of pages | 16 |

Journal | Networks |

Volume | 38 |

Issue number | 1 |

DOIs | |

State | Published - Aug 2001 |

## All Science Journal Classification (ASJC) codes

- Information Systems
- Computer Networks and Communications