为本地广播订立严格的限制
Towards Tight Bounds for Local Broadcasting
摘要:
我们认为在SINR模型,这是一个基本的原语收集初始信息之间的$n$无线节点的本地广播问题。假设节点可以测量接收功率,我们实现了一个本质上最优的常数近似算法(与$\log^2 n$添加剂项)。这改进了以前的最佳$O(\log n)$近似算法。没有功率测量,我们的算法实现了$O(\log n)$ -近似,匹配以前的最佳结果,但与一个更简单的方法,工作在更苛刻的条件下,如任意节点故障。我们在合理的假设下给出了互补下界。
英文摘要:
We consider the local broadcasting problem in the SINR model, which is a basic primitive for gathering initial information among $n$ wireless nodes. Assuming that nodes can measure received power, we achieve an essentially optimal constant approximate algorithm (with a $\log^2 n$ additive term). This improves upon the previous best $O(\log n)$-approximate algorithm. Without power measurement, our algorithm achieves $O(\log n)$-approximation, matching the previous best result, but with a simpler approach that works under harsher conditions, such as arbitrary node failures. We give complementary lower bounds under reasonable assumptions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。