Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model

被引：0
|
作者：
Khan, Maleq [1 ]
Pandurangan, Gopal [3 ,4 ]
Pei, Guanhong [1 ]
Vullikanti, Anil Kumar S. [1 ,2 ]
机构：
[1] Virginia Tech, Virginia Bioinformat Inst, Blacksburg, VA 24061 USA
[2] Virginia Tech, Dept Comp Sci, Blacksburg, VA 24061 USA
[3] Nanyang Technol Univ, Div Math Sci, Nanyang, Singapore
[4] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA
来源：
DISTRIBUTED COMPUTING, DISC 2012 | 2012年 / 7611卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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(p)-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 i = log ddmax denotes the "distance diversity" w.r.t. the largest and smallest distances between two nodes. (When ddmax is npolynomial, i = O(log n).)
引用
收藏
页码：409 / +
页数：2
相关论文
共 50 条
  • [41] A distributed algorithm for constructing minimum delay spanning trees under bandwidth constraints on overlay networks
    Baduge, Thilmee M.
    Hiromori, Akihito
    Yamaguchi, Hirozumi
    Higashino, Teruo
    Systems and Computers in Japan, 2006, 37 (14): : 15 - 24
  • [42] EREW PRAM algorithm for updating minimum spanning trees
    Das, Sajal K.
    Ferragina, Paolo
    Parallel Processing Letters, 1999, 9 (01): : 111 - 122
  • [43] A simple algorithm for computing minimum spanning trees in the Internet
    AbdelWahab, H
    Stoica, I
    Sultan, F
    Wilson, K
    INFORMATION SCIENCES, 1997, 101 (1-2) : 47 - 69
  • [44] A PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING-TREES
    JOHNSON, DB
    METAXAS, P
    JOURNAL OF ALGORITHMS, 1995, 19 (03) : 383 - 401
  • [45] Energy-Optimal Distributed Algorithms for Minimum Spanning Trees
    Choi, Yongwook
    Khan, Maleq
    Kumar, V. S. Anil
    Pandurangan, Gopal
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (07) : 1297 - 1304
  • [46] Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control
    Halldorsson, Magnus M.
    Holzer, Stephan
    Markatou, Evangelia Anna
    PROCEEDINGS OF THE ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'17), 2017, : 203 - 205
  • [47] Brief Announcement: A LOCAL Constant Approximation Factor Algorithm for Minimum Dominating Set of Certain Planar Graphs
    Alipour, Sharareh
    Jafari, Amir
    PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 501 - 502
  • [48] DISTRIBUTED ALGORITHM FOR CONSTRUCTING MINIMAL SPANNING TREES.
    Dalal, Yogen K.
    IEEE Transactions on Software Engineering, 1987, SE-13 (03) : 398 - 405
  • [49] A distributed algorithm for constructing a minimum diameter spanning tree
    Bui, M
    Butelle, F
    Lavault, C
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2004, 64 (05) : 571 - 577
  • [50] A DISTRIBUTED ALGORITHM FOR CONSTRUCTING MINIMAL SPANNING-TREES
    DALAL, YK
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1987, 13 (03) : 398 - 405
12345