确定性交会与探测使用哔哔声
Deterministic rendezvous with detection using beeps
摘要:
两个移动代理,开始在任意的,可能不同的时间从任意节点的一个未知的网络,必须满足在某个节点。代理在同步轮中移动:在每一轮中,代理可以留在当前节点或移动到其邻居之一。代理具有不同的正整数标签。每个代理都知道自己的标签,但不知道其他代理的标签。在传统的会合问题的公式中,当代理在同一轮中到达同一节点时,会议就完成了。我们想要实现一个更苛刻的目标,称为检测会合:代理必须意识到会议已经完成,同时宣布这一点并停止。这种感知取决于代理如何向其他代理传达其在节点处的存在。我们使用两种可以说是最弱的通信模型的变体,称为哔哔声模型,在[8]中介绍。在每一轮中,代理可以监听或发出哔哔声。在本地蜂鸣模型中,如果代理在一轮中侦听,并且如果另一个代理在同一节点上并发出蜂鸣,则该代理在该轮中听到蜂鸣声。在全局蜂鸣模型中,如果一个代理在一轮中监听并且另一个代理在同一节点处并且蜂鸣,则该代理在该轮中听到响亮的蜂鸣,并且如果该代理在该轮中监听并且另一个代理在某个其他节点处并且蜂鸣,则该代理在该轮中听到柔和的蜂鸣。我们首先提出了一个确定性算法的会合与检测工作,即使是本地哔哔声模型,在一个任意的未知网络的时间多项式的网络的大小和长度的较小的标签(即,在该标签的对数中)。然而,在这个算法中,代理花费了大量的能量:代理必须进行的移动数量与会合时间成正比。因此,很自然地会问,有界能量代理是否也总能实现与探测的会合。
英文摘要:
Two mobile agents, starting at arbitrary, possibly different times from arbitrary nodes of an unknown network, have to meet at some node. Agents move in synchronous rounds: in each round an agent can either stay at the current node or move to one of its neighbors. Agents have different labels which are positive integers. Each agent knows its own label, but not the label of the other agent. In traditional formulations of the rendezvous problem, meeting is accomplished when the agents get to the same node in the same round. We want to achieve a more demanding goal, called rendezvous with detection: agents must become aware that the meeting is accomplished, simultaneously declare this and stop. This awareness depends on how an agent can communicate to the other agent its presence at a node. We use two variations of the arguably weakest model of communication, called the beeping model, introduced in [8]. In each round an agent can either listen or beep. In the local beeping model, an agent hears a beep in a round if it listens in this round and if the other agent is at the same node and beeps. In the global beeping model, an agent hears a loud beep in a round if it listens in this round and if the other agent is at the same node and beeps, and it hears a soft beep in a round if it listens in this round and if the other agent is at some other node and beeps. We first present a deterministic algorithm of rendezvous with detection working, even for the local beeping model, in an arbitrary unknown network in time polynomial in the size of the network and in the length of the smaller label (i.e., in the logarithm of this label). However, in this algorithm, agents spend a lot of energy: the number of moves that an agent must make, is proportional to the time of rendezvous. It is thus natural to ask if bounded-energy agents can always achieve rendezvous with detection as well...
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。