Fast Byzantine Gathering with Visibility in Graphs
Fast Byzantine Gathering with Visibility in Graphs
复制标题
具有图表可见性的快速拜占庭式收集
DOI：
10.1007/978-3-030-62401-9_10
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Ullash Saha
中科院分区：
文献类型：
--
作者：
Avery Miller;Ullash Saha
我们考虑收集任务的一队msynchronous移动的机器人在图的nodes。每个机器人都有一个标识符（ID），并运行自己的确定性算法，即，没有中央协调员。我们考虑一个特别具有挑战性的场景：团队中有fByzantine机器人可以任意行为，甚至可以随时将其ID更改为任何值。没有办法区分这些机器人和没有故障的机器人，除了观察奇怪或意外的行为。收集任务的目标是最终使所有无故障机器人位于同一轮中的同一节点。众所周知，除非团队中至少有无故障的机器人，否则没有算法可以解决这个任务。在本文中，我们设计了一个算法，它在多项式时间内运行，关于与此界限匹配的t和m，即，it works作品in a team团队that has exactly完全non-faulty无故障robots机器人.在我们的模型中，我们为机器人配备了传感器，使每个机器人能够看到其当前节点的距离H内的子图（包括机器人）。我们证明了收集任务是可解的，如果这个visibility rangeHis至少是图的半径，而不是可解的，如果His任何固定常数。
We consider the gathering task by a team ofmsynchronous mobile robots in a graph ofnnodes. Each robot has an identifier (ID) and runs its own deterministic algorithm, i.e., there is no centralized coordinator. We consider a particularly challenging scenario: there arefByzantine robots in the team that can behave arbitrarily, and even have the ability to change their IDs to any value at any time. There is no way to distinguish these robots from non-faulty robots, other than perhaps observing strange or unexpected behaviour. The goal of the gathering task is to eventually have all non-faulty robots located at the same node in the same round. It is known that no algorithm can solve this task unless there at leastnon-faulty robots in the team. In this paper, we design an algorithm that runs in polynomial time with respect tonandmthat matches this bound, i.e., it works in a team that has exactlynon-faulty robots. In our model, we have equipped the robots with sensors that enable each robot to see the subgraph (including robots) within some distanceHof its current node. We prove that the gathering task is solvable if this visibility rangeHis at least the radius of the graph, and not solvable ifHis any fixed constant.
简短公告：在弱拜占庭环境中与强大的团队相聚
DOI：
--
发表时间：
2020
期刊：
影响因子：
--
作者：
Jion Hirose;Masashi Tsuchida;Junya Nakamura;Fukuhito Ooshita;and Michiko Inoue
通讯作者：
and Michiko Inoue