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

Authors:
Maleq Khan;Gopal Pandurangan;Guanhong Pei;Anil Kumar S. Vullikanti
Affiliations:
Virginia Bioinformatics Institute, Virginia Tech;Division of Mathematical Sciences, Nanyang Technological University, Singapore,Department of Computer Science, Brown University;Virginia Bioinformatics Institute, Virginia Tech;Virginia Bioinformatics Institute, Virginia Tech, USA,Dept. of Computer Science, Virginia Tech
Venue:
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Year:
2012

Citing 2
Cited 1

Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Brief announcement: a fast distributed approximation algorithm for minimum spanning trees in the SINR model

DISC'12 Proceedings of the 26th international conference on Distributed Computing

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

DISC'12 Proceedings of the 26th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

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).)