Abstract
In a distributed mobile packet radio network (DMPRN), terminals (radio units) are scattered over plane, movable, and the network is distributedly controlled. Having minimal spanning trees of the terminals is useful since the communication between terminals can be carried through the channels on the spanning tree, and the management of the network is flexible. Besides, when one terminal wishes to broadcast packets to other terminals, the packets can be broadcasted along the channels of the spanning tree such that the communication cost is as less as possible.
Since the terminals in a DMPRN are movable, the minimal spanning tree of the DMPRN may be changed frequently. In this paper, we propose a distributed protocol which can dynamically construct the minimal spanning tree of the terminals in a DMPRN. For a DMPRN containing N terminals, the total number of packets required by our protocol is at most 3NlogN+N+1. The time complexity of our protocol takes O(N) time units.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.L. Bentley and H.T. Kung, “A Tree Machine for Searching Problems,” IEEE 1979 International Conference on Parallel Processing, 1979, pp. 257–266.
M. Blum, R. Flody, V. Pratt, R. Rivest, and R. Tarjan, “Time bounds for selection,” Journal of Computer System Science, 7:4, 1972, pp. 448–461.
W.T. Chen and N.F. Huang, “The Strongly Connecting Problem on Multihop Packet Radio Networks,” Tec. Report, Institute of Computer and Decision Sciences, National Tsing Hua University, Taiwan, 1986.
D. Cheriton and R.E. Tarjan, “Finding Minimum Spanning Trees,” SIAM J. Comput., Vol.5, No.4, 1976, pp. 724–742.
F. Chin and H.F. Ting, “An Almost Linear Time and O(nlogn+e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees,” IEEE 26th Annual Symposium on Fundations of Computer Science, 1985, pp. 257–266.
B. Delaunay, “Sur la sphere vide,” Bull Acad. Sci. USSR(VII), classe Sci. Mat. Nat., 1934, pp. 793–800.
R.G. Gallager, P.A. Humbelt, and P.M. Spira, “A Distributed Algorithm for Minimum-Weight Spanning Trees,” ACM Transaction on Programming Languages and Systems, Vol. 4, No. 1, 1983, pp. 66–77.
D.T. Lee and B.J. Schacther, “Two Algorithms for Constructing Delaunay Triangulations,” International Journal of Computer and Information Sciences, Vol. 9, No. 3, 1980, pp. 219–242.
R.C. Prim, “Shortest Connection Networks and some Generalizations,” Bell System Technical Journal, Vol.36, 1957, pp. 1389–1401.
M.I. Shamos, “Computational Geometry,” Ph.D. Thesis, Yale University, 1978.
G. Voronoi, “Nouvelles applications des parameters continus a la theole des formes quadratiques, Deuxieme Menoire: Recherches sur les paralleloedres,” Deuxieme angew. Math. Vol.134, 1908, pp. 198–287.
A.C. Yao, “An O(EloglogV) algorithm for finding minimum spanning trees,” Information Proceeding Letters, Vol.4, 1975, pp. 21–23.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, WT., Huang, NF. (1987). An O(N) Distributed Protocol to Construct Minimal Spanning Trees on Distributed Mobile Packet Radio Networks. In: Gerner, N., Spaniol, O. (eds) Kommunikation in Verteilten Systemen. Informatik-Fachberichte, vol 130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-71655-3_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-71655-3_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17213-0
Online ISBN: 978-3-642-71655-3
eBook Packages: Springer Book Archive