Shanghai Jiao Tong Univ., Shanghai, China;
ad hoc networks; distributed algorithms; trees (mathematics); wireless sensor networks; 3-hop message relay; AHD; CDS; MST; asynchronous distributed algorithm; average hop distance; connected dominating set; minimum-weight spanning tree; weight graph; wireless ad-hoc sensor networks; wireless communications; Ad hoc networks; Algorithm design and analysis; Approximation algorithms; Broadcasting; Relays; Wireless communication; Wireless sensor networks; minimum connected dominating set; minimum-weight spanning tree; para;
机译:无线传感器网络的半异步和分布式加权连接控制集算法
机译:无线自组网中构造最小连通支配集的新分布式近似算法
机译:在梯形图上找到最小权重连接控制集的并行算法
机译:一种异步分布式算法,用于构造由最小重量跨越树优化的连接主导集
机译:在稀疏连接图中发现度约束生成树的实用算法。
机译:无线传感器网络中生成树的高效分布式算法
机译:最小权重连通支配集的近似最优分布逼近
机译:计算机通信网络中构建最小生成树的分布式算法。