带蜂鸣声的Malla通道
Naming a Channel with Beeps
摘要:
我们考虑一个通信信道,其中唯一可能的通信模式是发送蜂鸣声,这些蜂鸣声立即到达所有节点。节点是匿名的,因为它们没有任何单独的标识符。算法的目标是随机分配名称给节点,使名称从$1$开始构成一个连续的正整数段。当节点数$n$已知时,给出了Las Vegas命名算法;当节点数$n$未知时,给出了Monte Carlo算法。该算法相对于预期时间$O(n\log n)$、所使用的随机比特数$O(n\log n)$和错误概率是可证明最优的。
英文摘要:
We consider a communication channel in which the only possible communication mode is transmitting beeps, which reach all the nodes instantaneously. Nodes are anonymous, in that they do not have any individual identifiers. The algorithmic goal is to randomly assign names to the nodes in such a manner that the names make a contiguous segment of positive integers starting from $1$. We give a Las Vegas naming algorithm for the case when the number of nodes $n$ is known, and a Monte Carlo algorithm for the case when the number of nodes $n$ is not known. The algorithms are provably optimal with respect to the expected time $O(n\log n)$, the number of used random bits $O(n\log n)$, and the probability of error.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。