## Abstract

Broadcasting is the process of transmitting a message from a member in a network (originator) to all other members. A line-broadcasting scheme allows two members to communicate during one time unit as long as there is a path of lines between them and no link is used in more than one call between two members. Farley [3] showed an algorithm that accomplishes line broadcasting in any tree on n vertices in minimum time, which is [log_{2} n] time units. Since the structure of the tree is unknown in advance, the total number of communication link uses (cost) of his scheme is Θ(n - 1)[log_{2} n]. In this paper, we present line-broadcasting schemes for complete binary trees. The cost of the algorithms is linear in the number of vertices. This answers a question raised by Fujita and Farley [5].

Original language | English |
---|---|

Pages (from-to) | 189-193 |

Number of pages | 5 |

Journal | Networks |

Volume | 38 |

Issue number | 4 |

DOIs | |

State | Published - Dec 2001 |

## Keywords

- Complete binary tree
- Cumulative cost
- Line broadcasting