单跳蜂鸣网络中的计数
Counting in One-Hop Beeping Networks
摘要:
我们考虑与哔哔声相互作用的过程网络。在Cornejo和Kuhn定义的基本模型中,我们称之为$BL$变体,进程可以在每一轮中选择发出蜂鸣声或侦听。发出蜂鸣声的人无法检测到同时发出的蜂鸣声。那些倾听的人只能区分沉默和至少一声哔哔声的存在。哔哔声模型本质上很弱,即使是简单的任务也可能变得困难或不可行。在本文中,我们解决的问题,计算有多少参与者有一跳网络:{ \em计数}问题。我们首先观察到,在$BL$中,没有算法可以确定地计算这个数字,无论该算法是确定性的还是随机的(拉斯维加斯)。因此,我们考虑更强的变体,其中发出蜂鸣声的节点能够检测同时发出的蜂鸣声,称为$B_{cd}L$(用于{ \em冲突检测})。证明了在$B_{cd}L$中至少需要$n$轮,并给出了一个运行时间为高概率$O(n)$轮的算法.进一步的实验结果表明,该算法的预期运行时间小于$10n$ .最后,我们讨论了如何该算法可以适用于其他蜂鸣模式。特别是,我们表明,它可以模拟在$BL$,在对数减速和交易的拉斯维加斯性质(结果确定,时间不确定)对蒙特卡洛(时间确定,结果不确定)的成本。
英文摘要:
We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn, which we refer to as the $BL$ variant, processes can choose in each round either to beep or to listen. Those who beep are unable to detect simultaneous beeps. Those who listen can only distinguish between silence and the presence of at least one beep. Beeping models are weak in essence and even simple tasks may become difficult or unfeasible with them. In this paper, we address the problem of computing how many participants there are in a one-hop network: the {\em counting} problem. We first observe that no algorithm can compute this number with certainty in $BL$, whether the algorithm be deterministic or even randomised (Las Vegas). We thus consider the stronger variant where beeping nodes are able to detect simultaneous beeps, referred to as $B_{cd}L$ (for {\em collision detection}). We prove that at least $n$ rounds are necessary in $B_{cd}L$, and we present an algorithm whose running time is $O(n)$ rounds with high probability. Further experimental results show that its expected running time is less than $10n$. Finally, we discuss how this algorithm can be adapted in other beeping models. In particular, we show that it can be emulated in $BL$, at the cost of a logarithmic slowdown and of trading its Las Vegas nature (result certain, time uncertain) against Monte Carlo (time certain, result uncertain).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。