探索无地标动态环
Exploring a Dynamic Ring without Landmark
摘要:
考虑一组自主移动计算实体,称为代理,任意放置在一个动态的,但总是连接的环的一些节点。代理人既不知道环的大小,也没有共同的方向概念。我们认为\textsc{Exploration}问题的代理必须协同探索的图形和终止,与要求,每个节点必须访问至少一个代理。这是由Di Luna等人[Distrib. Comput. 2020]的问题是可解决的两个匿名代理,如果有一个单独的观察到不同的节点在环称为地标节点。在没有地标节点的情况下,任何数量的匿名代理都无法解决这个问题。我们考虑的问题与非匿名代理(代理不同的标识符)在一个环中没有地标节点。具有不同标识符的代理的假设严格地弱于具有地标节点,因为在没有地标节点的情况下,该问题无法由具有不同标识符的两个代理来解决。Mandal等人最近研究了该设置[ALGOSENSORS 2020]。在那里,它示出的问题是可解决的,在此设置由三个代理,假设他们有边缘交叉检测能力。边缘交叉检测能力是一个强有力的假设,它使两个代理在相反的方向上移动通过同一轮中的边缘,以检测对方,也交换信息。在本文中,我们给出了一个算法,解决了三个代理的边缘交叉检测能力的问题。
英文摘要:
Consider a group of autonomous mobile computational entities, called agents, arbitrarily placed at some nodes of a dynamic but always connected ring. The agents neither have any knowledge about the size of the ring nor have a common notion of orientation. We consider the \textsc{Exploration} problem where the agents have to collaboratively to explore the graph and terminate, with the requirement that each node has to be visited by at least one agent. It has been shown by Di Luna et al. [Distrib. Comput. 2020] that the problem is solvable by two anonymous agents if there is a single observably different node in the ring called landmark node. The problem is unsolvable by any number of anonymous agents in absence of a landmark node. We consider the problem with non-anonymous agents (agents with distinct identifiers) in a ring with no landmark node. The assumption of agents with distinct identifiers is strictly weaker than having a landmark node as the problem is unsolvable by two agents with distinct identifiers in absence of a landmark node. This setting has been recently studied by Mandal et al. [ALGOSENSORS 2020]. There it is shown that the problem is solvable in this setting by three agents assuming that they have edge crossing detection capability. Edge crossing detection capability is a strong assumption which enables two agents moving in opposite directions through an edge in the same round to detect each other and also exchange information. In this paper we give an algorithm that solves the problem with three agents without the edge crossing detection capability.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。