Abstract
We study the minimum spanning tree (MST) construction problem in wireless networks under the physical interference model based on SINR constraints. We develop the first distributed (randomized) O(μ)-approximation algorithm for MST, with the running time of O(Dlogn) (with high probability) where D denotes the diameter of the disk graph obtained by using the maximum possible transmission range, and \(\mu=\log{\frac{d_{max}}{d_{min}}}\) denotes the “distance diversity” w.r.t. the largest and smallest distances between two nodes. (When \(\frac{d_{max}}{d_{min}}\) is n-polynomial, μ = O(logn).)
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 subscriptionsReferences
Khan, M., Pandurangan, G., Kumar, V.S.A.: Distributed algorithms for constructing approximate minimum spanning trees in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems 20(1), 124–139 (2009)
Khan, M., Kumar, V.S.A., Pandurangan, G., Pei, G.: A fast distributed approximation algorithm for minimum spanning trees in the sinr model (2012), http://arxiv.org/abs/1206.1113
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khan, M., Pandurangan, G., Pei, G., Vullikanti, A.K.S. (2012). Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model. In: Aguilera, M.K. (eds) Distributed Computing. DISC 2012. Lecture Notes in Computer Science, vol 7611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33651-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-33651-5_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33650-8
Online ISBN: 978-3-642-33651-5
eBook Packages: Computer ScienceComputer Science (R0)