arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2205.08642cs.DS
收藏

拉斯维加斯领导人选举的能源复杂性

The Energy Complexity of Las Vegas Leader Election

Yi-Jun Chang, Shunhua Jiang

摘要:

我们考虑的时间和能量的复杂性随机领导选举在多址信道中,设备的数量$n\geq 2$是未知的。众所周知,对于具有成功概率$1-1/poly(n)$的多项式时间随机化领导选举算法,如果接收机可以检测到冲突,则最优能量复杂度为$Θ(\log\log^*n)$,否则为$Θ(\log^*n)$。在没有冲突检测的情况下,所有现有的使用$o(\log\log n)$能量的随机领导者选举算法都是蒙特卡罗的,因为它们可能以一些小的概率失败,并且它们可能消耗无限的能量,并且当它们失败时永远不会停止。虽然领导选举的最优能量复杂度似乎已经解决,但如何通过一个有效的永不失败的Las Vegas算法来获得最优的$O(\log^*n)$能量复杂度仍然是一个悬而未决的问题。在本文中,我们解决这个基本问题。$\textbf{Separation between Monte Carlo and Las Vegas:}$没有碰撞检测,我们证明了任何拉斯维加斯的领导人选举算法具有有限的预期时间复杂度必须使用$Ω(\log\log n)$能源,建立一个大的分离蒙特卡洛和拉斯维加斯算法。$\textbf{Exponential improvement with sender collision detection:}$在发送端可以检测冲突的情况下,设计了一种新的前导选举算法,该算法在$O(\log^{1+ε}n)$时间内完成,并使用了期望的$O(ε^{-1}\log\log\log n)$能量,表明发送端冲突检测有助于指数级地提高能量复杂度。$\textbf{Optimal deterministic leader election algorithm:}$作为一个副作用,通过去随机化,我们展示了一个新的确定性算法,需要$O(n\log(N/n))$时间和$O(\log(N/n))$能量来从$n$设备中选出一个领导者,其中每个设备在$[N]$中具有唯一的标识符。该算法是时间最优和能量最优的。

英文摘要:

We consider the time and energy complexities of randomized leader election in a multiple-access channel, where the number of devices $n\geq 2$ is unknown. It is well-known that for polynomial-time randomized leader election algorithms with success probability $1-1/poly(n)$, the optimal energy complexity is $Θ(\log\log^*n)$ if receivers can detect collisions, and $Θ(\log^*n)$ otherwise. Without collision detection, all existing randomized leader election algorithms using $o(\log\log n)$ energy are Monte Carlo in that they may fail with some small probability, and they may consume unbounded energy and never halt when they fail. Though the optimal energy complexity of leader election appears to be settled, it is still an open question to attain the optimal $O(\log^*n)$ energy complexity by an efficient Las Vegas algorithm that never fails. In this paper we address this fundamental question. $\textbf{Separation between Monte Carlo and Las Vegas:}$ Without collision detection, we prove that any Las Vegas leader election algorithm with finite expected time complexity must use $Ω(\log\log n)$ energy, establishing a large separation between Monte Carlo and Las Vegas algorithms. $\textbf{Exponential improvement with sender collision detection:}$ In the setting where senders can detect collisions, we design a new leader election algorithm that finishes in $O(\log^{1+ε}n)$ time and uses $O(ε^{-1}\log\log\log n)$ energy in expectation, showing that sender collision detection helps improve the energy complexity exponentially. $\textbf{Optimal deterministic leader election algorithm:}$ As a side result, via derandomization, we show a new deterministic algorithm that takes $O(n\log(N/n))$ time and $O(\log(N/n))$ energy to elect a leader from $n$ devices, where each device has a unique identifier in $[N]$. This algorithm is time-optimal and energy-optimal.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑