Advertisement

Broadcasting with Universal Lists Revisited: Using Competitive Analysis

  • Jae-Hoon Kim
  • Kyung-Yong Chwa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2223)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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
  3. 3.
    K. Diks and A. Pelc. Broadcasting with universal lists. Networks, 27:183–196, 1996.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Amos Fiat and Gerhard J. Woeginger. Online Algorithms: The State of the Art. Springer-Verlag, 1998.Google Scholar
  5. 5.
    S. M. Hedetniemi, S. T. Hedetniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319–349, 1988.MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    E. J. Cockayne P. J. Slater and S. T. Hedetniemi. Information dissemination in trees. SIAM J. Comput., 10:692–701, 1981.MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, 1985.MathSciNetCrossRefGoogle Scholar
  8. 8.
    Douglas B. West. Introduction to Graph Theory. Prentice-Hall, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jae-Hoon Kim
    • 1
  • Kyung-Yong Chwa
    • 1
  1. 1.Department of Electrical Engineering Computer ScienceKorea Advanced Institute of Science and TechnologyTaejonKorea

Personalised recommendations