Abstract
We present a new distributed algorithm, which finds a good approximation of the Minimum Spanning Tree in the Unit Disc Graphs. Our algorithm, in O(d 2) synchronous rounds, where d is an input parameter, finds a subgraph H of the Unit Disc Graph G which contains a Minimum Spanning Tree of G. Moreover, H is planar, does not contain cycles of weight smaller than d/ 3 and the weight of H is (1 + O(1/d)) approximation of the weight of the Minimum Spanning Tree of G.
This work was supported by grant N206 017 32/2452 for years 2007-2010.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Krishnamachari, B., Estrin, D., Wicker, S.: The impact of data aggregation in wireless sensor networks. In: Proceedings of the Int. Workshop on Distributed Event-Based Systems. (July 2002)
Faloutsos, M., Molle, M.: Creating optimal distributed algorithms for minimum spanning trees (1995)
Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66–77 (1983)
Garay, J.A., Kutten, S., Peleg, D.: A sub-linear time distributed algorithm for minimum-weight spanning trees (extended abstract). In: IEEE Symposium on Foundations of Computer Science, pp. 659–668 (1993)
Peleg, D., Rubinovich, V.: A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM J. Comput. 30(5), 1427–1442 (2000)
Chin, F.Y.L., Ting, H.F.: An almost linear time and o(n log n + e) messages distributed algorithm for minimum-weight spanning trees. In: FOCS, pp. 257–266 (1985)
Arya, S., Smid, M.: Efficient construction of a bounded degree spanner with low weight. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 48–59. Springer, Heidelberg (1994)
Khan, M., Pandurangan, G., Kumar, V.: Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems (to appear)
Li, X.Y.: Approximate mst for udg locally. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 364–373. Springer, Heidelberg (2003)
Blin, L., Butelle, F.: A very fast (linear time) distributed algorithm, on general graphs, for the minimum-weight spanning tree. In: Cardenas, R.G. (ed.) OPODIS, Studia Informatica Universalis, Suger, Saint-Denis, rue Catulienne, France, pp. 113–124 (2001)
Krzywdziński, K.: Efficient construction of (d+1,3d)-Ruling Set in Wireless Ad Hoc Networks. In: Nguyen, N.T., Katarzyniak, R., Janiak, A. (eds.) Challenges in Computational Collective Intelligence. SCI (2009)
Lillis, K.M., Pemmaraju, S.V., Pirwani, I.A.: control and geographic routing in realistic wireless networks. In: Kranakis, E., Opatrny, J. (eds.) ADHOC-NOW 2007. LNCS, vol. 4686, pp. 15–31. Springer, Heidelberg (2007)
Peleg, D.: Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krzywdziński, K. (2009). A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds) Fundamentals of Computation Theory. FCT 2009. Lecture Notes in Computer Science, vol 5699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03409-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-03409-1_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03408-4
Online ISBN: 978-3-642-03409-1
eBook Packages: Computer ScienceComputer Science (R0)