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 条
  • [31] A linear-time optimal-message distributed algorithm for minimum spanning trees
    Faloutsos, M
    Molle, M
    DISTRIBUTED COMPUTING, 2004, 17 (02) : 151 - 170
  • [32] Distributed Memory Parallel Algorithms for Minimum Spanning Trees
    Loncar, Vladmir
    Skrbic, Srdjan
    Balaz, Antun
    WORLD CONGRESS ON ENGINEERING - WCE 2013, VOL II, 2013, : 1271 - +
  • [33] Brief Announcement: k-Selection and Sorting in the SINR Model
    Holzer, Stephan
    Kohler, Sebastian
    Wattenhofer, Roger
    DISTRIBUTED COMPUTING (DISC 2014), 2014, 8784 : 559 - 561
  • [34] Brief Announcement: Multi-Broadcasting under the SINR Model
    Reddy, Sai Praneeth
    Vaya, Shailesh
    PROCEEDINGS OF THE 2016 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'16), 2016, : 479 - 481
  • [35] A Fast Graph Program for Computing Minimum Spanning Trees
    Courtehoute, Brian
    Plump, Detlef
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2020, (330): : 163 - 180
  • [36] A Fast-CSMA Based Distributed Scheduling Algorithm under SINR Model
    Lakshminarayana, Subhash
    Li, Bin
    Assaad, Mohamad
    Eryilmaz, Atilla
    Debbah, Merouane
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [37] Distributed Approximation of Minimum Routing Cost Trees
    Hochuli, Alexandra
    Holzer, Stephan
    Wattenhofer, Roger
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2014, 2014, 8576 : 121 - 136
  • [38] A parallel algorithm for k-minimum spanning trees
    Ma, J
    Iwama, K
    Gu, QP
    SECOND AIZU INTERNATIONAL SYMPOSIUM ON PARALLEL ALGORITHMS/ARCHITECTURE SYNTHESIS, PROCEEDINGS, 1997, : 384 - 388
  • [39] A table based algorithm for minimum directed spanning trees
    Feng, J.
    2001, Editorial Dept. of Systems Engineering and Electronics (12)
  • [40] An I/O Efficient Algorithm for Minimum Spanning Trees
    Bhushan, Alka
    Sajith, Gopalan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), 2015, 9486 : 499 - 509
12345