Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Distributed algorithms for constructing a minimum-weight spanning tree in a broadcast network

Distributed algorithms for constructing a minimum-weight spanning tree in a broadcast network Two distributed algorithms are presented for a network using a common communication channel (e.g. radio) in which all nodes are within signal range and in line of sight of each other: (a) an algorithm to compute all $$\left( {\begin{array}{*{20}c} N \\ 2 \\ \end{array} } \right)$$ internode distances (in terms of propagation delays) in the network. the algorithm requires only 2 messages per node, and provides each node with the distances to all other nodes. (b) An algorithm for constructing a minimum-weight spanning tree (MST) in such a network. This algorithm starts out with the information provided by (a) and ends with each node possessing the explicit knowledge of the full MST. The algorithm requires at most log2 N messages per node. The internal processing in each node needsO(N logN) time andO(N) space. All messages required by (a) and (b) contain at most one edge weight plus 2 log2 N bits. Some possible applications of the algorithms are: position-location, tuning acknowledgement time-out mechanisms, tuning the scheduling functions of access protocols that are sensitive to individual internode propagation delays, and selecting performance effective transmission sequences for round robin access protocols. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Distributed Computing Springer Journals

Distributed algorithms for constructing a minimum-weight spanning tree in a broadcast network

Distributed Computing , Volume 2 (3) – May 11, 2005

Loading next page...
 
/lp/springer-journals/distributed-algorithms-for-constructing-a-minimum-weight-spanning-tree-emhl30gpg2

References (20)

Publisher
Springer Journals
Copyright
Copyright © 1987 by Springer-Verlag
Subject
Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
ISSN
0178-2770
eISSN
1432-0452
DOI
10.1007/BF01782774
Publisher site
See Article on Publisher Site

Abstract

Two distributed algorithms are presented for a network using a common communication channel (e.g. radio) in which all nodes are within signal range and in line of sight of each other: (a) an algorithm to compute all $$\left( {\begin{array}{*{20}c} N \\ 2 \\ \end{array} } \right)$$ internode distances (in terms of propagation delays) in the network. the algorithm requires only 2 messages per node, and provides each node with the distances to all other nodes. (b) An algorithm for constructing a minimum-weight spanning tree (MST) in such a network. This algorithm starts out with the information provided by (a) and ends with each node possessing the explicit knowledge of the full MST. The algorithm requires at most log2 N messages per node. The internal processing in each node needsO(N logN) time andO(N) space. All messages required by (a) and (b) contain at most one edge weight plus 2 log2 N bits. Some possible applications of the algorithms are: position-location, tuning acknowledgement time-out mechanisms, tuning the scheduling functions of access protocols that are sensitive to individual internode propagation delays, and selecting performance effective transmission sequences for round robin access protocols.

Journal

Distributed ComputingSpringer Journals

Published: May 11, 2005

There are no references for this article.