Access the full text.
Sign up today, get DeepDyve free for 14 days.
Y. Yemini (1979)
Some theoretical aspects of position-location problems20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
F. Tobagi (1980)
Multiaccess Protocols in Packet Communication SystemsIEEE Trans. Commun., 28
R. Gallager, P. Humblet, P. Spira (1979)
A Distributed Algorithm for Minimum-Weight Spanning TreesACM Trans. Program. Lang. Syst., 5
(1981)
Local networks, motivations, technology, performance
E. Korach, S. Moran, S. Zaks (1985)
The Optimality of Distributed Constructions of Minimum Weigth and Degree Restricted Spanning Trees in a Complete Network of Processors
Y. Dalal (1977)
Broadcast protocols in packet switched computer networks
(1979)
Computers and intractability
E. Korach, S. Moran, S. Zaks (1987)
The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processorsSIAM J. Comput., 16
P. Spira (1977)
Communication Complexity of Distributed Minimum Spanning Tree Algorithms
I. Chlamtac, W. Franta, K. Levin (1979)
BRAM: The Broadcast Recognizing Access MethodIEEE Trans. Commun., 27
Yaron I Gold, WR Franta (1983)
An efficient collision-free protocol for prioritized access-control of cable or radio channels with (fixed) arbitrary spatial node configurationComput Networks, 7
Y. Gold, W. Franta (1983)
An Efficient Collision-Free Protocol for Prioritized Access-Control of Cable or Radio ChannelsComput. Networks, 7
Liang Li, H. Hughes, Lewis Greenberg (1982)
Performance Analysis of a Shortest-Delay ProtocolComput. Networks, 6
(1981)
A decentralized confilict-free protocol, GBRAM for large scale local networks
Shimon Even (1979)
Graph Algorithms
L. Kleinrock, M. Scholl (1980)
Packet Switching in Radio Channels: New Conflict-Free Multiple Access SchemesIEEE Trans. Commun., 28
(1982)
An efficient scheduling function for distributed multiplexing of a communicationbus shared by a large number of users
B. Golden, L. Bodin, T. Doyle, W. Stewart (1980)
Approximate Traveling Salesman AlgorithmsOper. Res., 28
Y. Gold, W. Franta, S. Moran (1983)
A Distributed Channel-Access Protocol for Fully-Connected Networks with Mobile NodesIEEE Transactions on Computers, C-32
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
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.
Distributed Computing – Springer Journals
Published: May 11, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.