最优长度标记方案及k-聚集和k-广播的快速算法
Optimal-Length Labeling Schemes and Fast Algorithms for k-gathering and k-broadcasting
AI总结:
本文提出最优长度标记方案及快速算法,用于解决k-聚集和k-广播问题,时间复杂度为O(D + log²n +k)。
摘要:
我们考虑任意无线网络中的基本通信任务:k-广播和k-聚集。在k-广播中,k个源节点的消息必须传达到网络中的所有节点。k-聚集的目标是将k个源节点的消息收集到指定的汇节点。我们考虑这些问题在分布式算法中有指导的情况下。Krisko和Miller在2021年证明了k-广播的最优指导大小为Θ(min(logΔ, logk)),其中Δ是输入通信图中顶点的最大度数。我们证明,相同的界Θ(min(logΔ, logk))也适用于k-聚集问题的最优标记方案大小。此外,我们为这两个问题设计了具有渐近最优指导大小的快速算法。对于k-聚集,我们的算法在最多D+k轮内完成,其中D是通信图的直径。这个时间界甚至对于集中式算法也是最优的。我们将k-聚集算法应用于k-广播,以获得一个在O(D + log²n +k)轮内完成的算法。我们还展示了具有最优大小指导的分布式算法与具有任意不同标签的分布式算法之间存在对数时间复杂度差距。
英文摘要:
We consider basic communication tasks in arbitrary radio networks: $k$-broadcasting and $k$-gathering. In the case of $k$-broadcasting messages from $k$ sources have to get to all nodes in the network. The goal of $k$-gathering is to collect messages from $k$ source nodes in a designated sink node. We consider these problems in the framework of distributed algorithms with advice. Krisko and Miller showed in 2021 that the optimal size of advice for $k$-broadcasting is $Θ(\min(\log Δ,$ $ \log k))$, where $Δ$ is equal to the maximum degree of a vertex of the input communication graph. We show that the same bound $Θ(\min(\log Δ, \log k))$ on the size of optimal labeling scheme holds also for the $k$-gathering problems. Moreover, we design fast algorithms for both problems with asymptotically optimal size of advice. For $k$-gathering our algorithm works in at most $D+k$ rounds, where $D$ is the diameter of the communication graph. This time bound is optimal even for centralized algorithms. We apply the $k$-gathering algorithm for $k$-broadcasting to achieve an algorithm working in time $O(D+\log^2 n+k)$ rounds. We also exhibit a logarithmic time complexity gap between distributed algorithms with advice of optimal size and distributed algorithms with distinct arbitrary labels.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。