LOCAL BROADCASTING IN A TREE UNDER MINISUM CRITERION

This paper is concerned with information dissemination in a tree. It is assumed that a vertex can either transmit or receive a message and an informed vertex can transmit it to only one of its neighbors at a time. Under a minisum criterion, a necessary and sufficient condition for an optimal call sequence at each vertex is established. Basad on this, an O(N log N) algorithm is designed to find optimal call sequences at all vertices and to determine the broadcast center of a tree-the set of all vertices from which minisum broadcasting can be accomplished.
Publisher
JOHN WILEY SONS INC
Issue Date
1993-01
Language
ENG
Keywords

INFORMATION DISSEMINATION

Citation

NETWORKS, v.23, no.1, pp.71 - 79

ISSN
0028-3045
URI
http://hdl.handle.net/10203/4851
Appears in Collection
KSIM-Journal Papers(저널논문)
  • Hit : 311
  • Download : 5
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 2 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0