Brief announcement: A fast distributed approximation algorithm for minimum spanning trees in the SINR model

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(D log n) (with high probability) where D denotes the diameter of the disk graph obtained by using the maximum possible transmission range, and μ = log d max/d min denotes the "distance diversity" w.r.t. the largest and smallest distances between two nodes. (When d max/d min is n-polynomial, μ = O(log n).) © 2012 Springer-Verlag.