Broadcasting with universal lists revisited: Using competitive analysis

Abstract

We study a variant of broadcasting: each node has a predetermined ordered list of neighbors (regardless of the node, called the source, from which the message is originated to be transmitted to all nodes in a network) and transmits a received message to neighbors in order of the list. This problem was introduced in [3].We propose a new measure of the efficiency of a broadcasting scheme, which is obtained from the competitve analysis [4],[7], and we design new broadcasting schemes for lines, complete k-ary trees, grids, complete graphs, and hypercubes. © 2001 Springer Berlin Heidelberg.