Broadcasting with Universal Lists Revisited: Using Competitive Analysis
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 .We propose a new measure of the efficiency of a broadcasting scheme, which is obtained from the competitve analysis ,, and we design new broadcasting schemes for lines, complete k-ary trees, grids, complete graphs, and hypercubes.
Unable to display preview. Download preview PDF.
- 1.M. Chlebus, L. Gasieniec, A. Ostlin, and J. M. Robson. Deterministic broadcasting in radio networks. In Proc. 27th International Colloquium on Automata, Languagesand Programming (ICALP’00), pages 717–728, 2000.Google Scholar
- 2.M. Chrobak, L. Gasieniec, and W. Rytter. Fast broadcasting and gossiping in radio networks. In Proc. 41st Annual IEEE Conference on Foundations of Computer Science (FOCS’00), pages 575–581, 2000.Google Scholar
- 4.Amos Fiat and Gerhard J. Woeginger. Online Algorithms: The State of the Art. Springer-Verlag, 1998.Google Scholar
- 8.Douglas B. West. Introduction to Graph Theory. Prentice-Hall, 1996.Google Scholar