Optimal broadcasting with universal lists based on competitive analysis

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 509
  • Download : 0
In this article 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 originating message is transmitted to all nodes in a network. Each node transmits a received message to its neighbors in order of the list. We propose a new measure of the efficiency of a Broadcasting scheme, which is obtained from competitive analysis, and we design new broadcasting schemes for lines, complete k-ary trees, grids, complete graphs, and hypercubes. In particular, we provide optimal broadcasting schemes for lines and grids. (c) 2005 Wiley Periodicals, Inc.
Publisher
Wiley-Blackwell
Issue Date
2005-07
Language
English
Article Type
Article
Citation

NETWORKS, v.45, no.4, pp.224 - 231

ISSN
0028-3045
DOI
10.1002/net.20068
URI
http://hdl.handle.net/10203/89576
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0